From 34c1199becdb2f9b0447553e66c85d8f6770558f Mon Sep 17 00:00:00 2001
From: zecke <zecke>
Date: Sun, 13 Oct 2002 19:05:24 +0000
Subject: Add a vCal Resource

Play a bit with cahce sizes
The idea is to have the current page
and the prior page cached... still looking how to do that
---
(limited to 'libopie2/opiepim/backend/otodoaccesssql.cpp')

diff --git a/libopie2/opiepim/backend/otodoaccesssql.cpp b/libopie2/opiepim/backend/otodoaccesssql.cpp
index ea8b3c9..9ef6b7c 100644
--- a/libopie2/opiepim/backend/otodoaccesssql.cpp
+++ b/libopie2/opiepim/backend/otodoaccesssql.cpp
@@ -286,18 +286,19 @@ OTodo OTodoAccessBackendSQL::find(int uid ) const{
     return todo( m_driver->query(&query) );
 
 }
+#define CACHE 32
 OTodo OTodoAccessBackendSQL::find( int uid, const QArray<int>& ints,
                                    uint cur, Frontend::CacheDirection dir ) const{
     qWarning("searching for %d", uid );
-    QArray<int> search( 8 );
+    QArray<int> search( CACHE );
     uint size =0;
     OTodo to;
 
-    // we try to cache 8 items
+    // we try to cache CACHE items
     switch( dir ) {
         /* forward */
     case 0:
-        for (uint i = cur; i < ints.count() && size < 8; i++ ) {
+        for (uint i = cur; i < ints.count() && size < CACHE; i++ ) {
             qWarning("size %d %d", size,  ints[i] );
             search[size] = ints[i];
             size++;
@@ -305,7 +306,7 @@ OTodo OTodoAccessBackendSQL::find( int uid, const QArray<int>& ints,
         break;
         /* reverse */
     case 1:
-        for (uint i = cur; i != 0 && size <  8; i-- ) {
+        for (uint i = cur; i != 0 && size <  CACHE; i-- ) {
             search[size] = ints[i];
             size++;
         }
--
cgit v0.9.0.2