1 files changed, 5 insertions, 4 deletions

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
@@ -288,2 +288,3 @@ OTodo OTodoAccessBackendSQL::find(int uid ) const{
 }
+#define CACHE 32
 OTodo OTodoAccessBackendSQL::find( int uid, const QArray<int>& ints,
@@ -291,3 +292,3 @@ OTodo OTodoAccessBackendSQL::find( int uid, const QArray<int>& ints,
     qWarning("searching for %d", uid );
-    QArray<int> search( 8 );
+    QArray<int> search( CACHE );
     uint size =0;
@@ -295,3 +296,3 @@ OTodo OTodoAccessBackendSQL::find( int uid, const QArray<int>& ints,
 
-    // we try to cache 8 items
+    // we try to cache CACHE items
     switch( dir ) {
@@ -299,3 +300,3 @@ OTodo OTodoAccessBackendSQL::find( int uid, const QArray<int>& ints,
     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] );
@@ -307,3 +308,3 @@ OTodo OTodoAccessBackendSQL::find( int uid, const QArray<int>& ints,
     case 1:
-        for (uint i = cur; i != 0 && size <  8; i-- ) {
+        for (uint i = cur; i != 0 && size <  CACHE; i-- ) {
             search[size] = ints[i];