author | zecke <zecke> | 2002-10-18 03:07:09 (UTC) |
---|---|---|
committer | zecke <zecke> | 2002-10-18 03:07:09 (UTC) |
commit | 86b3550348cf896b568e98d21da577c3f35a1a4a (patch) (unidiff) | |
tree | 865a24eb260564d502b933a9af105871d2da6d0f | |
parent | 218bc4583c545db50f3475930d61b1c76aca3fbd (diff) | |
download | opie-86b3550348cf896b568e98d21da577c3f35a1a4a.zip opie-86b3550348cf896b568e98d21da577c3f35a1a4a.tar.gz opie-86b3550348cf896b568e98d21da577c3f35a1a4a.tar.bz2 |
Hi Stefan,
this commit should fix your problems...
The XML todo backend was doing some stuff wrong
with sorted Records.
I even have a Comment describing this behaviour which
is from the current POV wrong..
need to check my brain what I though this should do
-rw-r--r-- | libopie/pim/otodoaccessxml.cpp | 24 | ||||
-rw-r--r-- | libopie2/opiepim/backend/otodoaccessxml.cpp | 24 |
2 files changed, 38 insertions, 10 deletions
diff --git a/libopie/pim/otodoaccessxml.cpp b/libopie/pim/otodoaccessxml.cpp index 3b4cab2..7a55c67 100644 --- a/libopie/pim/otodoaccessxml.cpp +++ b/libopie/pim/otodoaccessxml.cpp | |||
@@ -58,129 +58,129 @@ bool OTodoAccessXML::load() { | |||
58 | int len = ba.size(); | 58 | int len = ba.size(); |
59 | int i = 0; | 59 | int i = 0; |
60 | char *point; | 60 | char *point; |
61 | const char* collectionString = "<Task "; | 61 | const char* collectionString = "<Task "; |
62 | while ( dt+i != 0 && ( point = strstr( dt+i, collectionString ) ) != 0l ) { | 62 | while ( dt+i != 0 && ( point = strstr( dt+i, collectionString ) ) != 0l ) { |
63 | i = point -dt; | 63 | i = point -dt; |
64 | i+= strlen(collectionString); | 64 | i+= strlen(collectionString); |
65 | OTodo ev; | 65 | OTodo ev; |
66 | m_year = m_month = m_day = 0; | 66 | m_year = m_month = m_day = 0; |
67 | 67 | ||
68 | while ( TRUE ) { | 68 | while ( TRUE ) { |
69 | while ( i < len && (dt[i] == ' ' || dt[i] == '\n' || dt[i] == '\r') ) | 69 | while ( i < len && (dt[i] == ' ' || dt[i] == '\n' || dt[i] == '\r') ) |
70 | ++i; | 70 | ++i; |
71 | if ( i >= len-2 || (dt[i] == '/' && dt[i+1] == '>') ) | 71 | if ( i >= len-2 || (dt[i] == '/' && dt[i+1] == '>') ) |
72 | break; | 72 | break; |
73 | 73 | ||
74 | // we have another attribute, read it. | 74 | // we have another attribute, read it. |
75 | int j = i; | 75 | int j = i; |
76 | while ( j < len && dt[j] != '=' ) | 76 | while ( j < len && dt[j] != '=' ) |
77 | ++j; | 77 | ++j; |
78 | QCString attr( dt+i, j-i+1); | 78 | QCString attr( dt+i, j-i+1); |
79 | 79 | ||
80 | i = ++j; // skip = | 80 | i = ++j; // skip = |
81 | 81 | ||
82 | // find the start of quotes | 82 | // find the start of quotes |
83 | while ( i < len && dt[i] != '"' ) | 83 | while ( i < len && dt[i] != '"' ) |
84 | ++i; | 84 | ++i; |
85 | j = ++i; | 85 | j = ++i; |
86 | 86 | ||
87 | bool haveUtf = FALSE; | 87 | bool haveUtf = FALSE; |
88 | bool haveEnt = FALSE; | 88 | bool haveEnt = FALSE; |
89 | while ( j < len && dt[j] != '"' ) { | 89 | while ( j < len && dt[j] != '"' ) { |
90 | if ( ((unsigned char)dt[j]) > 0x7f ) | 90 | if ( ((unsigned char)dt[j]) > 0x7f ) |
91 | haveUtf = TRUE; | 91 | haveUtf = TRUE; |
92 | if ( dt[j] == '&' ) | 92 | if ( dt[j] == '&' ) |
93 | haveEnt = TRUE; | 93 | haveEnt = TRUE; |
94 | ++j; | 94 | ++j; |
95 | } | 95 | } |
96 | if ( i == j ) { | 96 | if ( i == j ) { |
97 | // empty value | 97 | // empty value |
98 | i = j + 1; | 98 | i = j + 1; |
99 | continue; | 99 | continue; |
100 | } | 100 | } |
101 | 101 | ||
102 | QCString value( dt+i, j-i+1 ); | 102 | QCString value( dt+i, j-i+1 ); |
103 | i = j + 1; | 103 | i = j + 1; |
104 | 104 | ||
105 | QString str = (haveUtf ? QString::fromUtf8( value ) | 105 | QString str = (haveUtf ? QString::fromUtf8( value ) |
106 | : QString::fromLatin1( value ) ); | 106 | : QString::fromLatin1( value ) ); |
107 | if ( haveEnt ) | 107 | if ( haveEnt ) |
108 | str = Qtopia::plainString( str ); | 108 | str = Qtopia::plainString( str ); |
109 | 109 | ||
110 | /* | 110 | /* |
111 | * add key + value | 111 | * add key + value |
112 | */ | 112 | */ |
113 | todo( &dict, ev, attr, str ); | 113 | todo( &dict, ev, attr, str ); |
114 | 114 | ||
115 | } | 115 | } |
116 | /* | 116 | /* |
117 | * now add it | 117 | * now add it |
118 | */ | 118 | */ |
119 | m_events.insert(ev.uid(), ev ); | 119 | m_events.insert(ev.uid(), ev ); |
120 | } | 120 | } |
121 | 121 | ||
122 | qWarning("counts %d", m_events.count() ); | 122 | qWarning("counts %d records loaded!", m_events.count() ); |
123 | return true; | 123 | return true; |
124 | } | 124 | } |
125 | bool OTodoAccessXML::reload() { | 125 | bool OTodoAccessXML::reload() { |
126 | return load(); | 126 | return load(); |
127 | } | 127 | } |
128 | bool OTodoAccessXML::save() { | 128 | bool OTodoAccessXML::save() { |
129 | // qWarning("saving"); | 129 | // qWarning("saving"); |
130 | if (!m_opened || !m_changed ) { | 130 | if (!m_opened || !m_changed ) { |
131 | // qWarning("not saving"); | 131 | // qWarning("not saving"); |
132 | return true; | 132 | return true; |
133 | } | 133 | } |
134 | QString strNewFile = m_file + ".new"; | 134 | QString strNewFile = m_file + ".new"; |
135 | QFile f( strNewFile ); | 135 | QFile f( strNewFile ); |
136 | if (!f.open( IO_WriteOnly|IO_Raw ) ) | 136 | if (!f.open( IO_WriteOnly|IO_Raw ) ) |
137 | return false; | 137 | return false; |
138 | 138 | ||
139 | int written; | 139 | int written; |
140 | QString out; | 140 | QString out; |
141 | out = "<!DOCTYPE Tasks>\n<Tasks>\n"; | 141 | out = "<!DOCTYPE Tasks>\n<Tasks>\n"; |
142 | 142 | ||
143 | // for all todos | 143 | // for all todos |
144 | QMap<int, OTodo>::Iterator it; | 144 | QMap<int, OTodo>::Iterator it; |
145 | for (it = m_events.begin(); it != m_events.end(); ++it ) { | 145 | for (it = m_events.begin(); it != m_events.end(); ++it ) { |
146 | out+= "<Task " + toString( (*it) ) + " />\n"; | 146 | out+= "<Task " + toString( (*it) ) + " />\n"; |
147 | QCString cstr = out.utf8(); | 147 | QCString cstr = out.utf8(); |
148 | written = f.writeBlock( cstr.data(), cstr.length() ); | 148 | written = f.writeBlock( cstr.data(), cstr.length() ); |
149 | 149 | ||
150 | /* less written then we wanted */ | 150 | /* less written then we wanted */ |
151 | if ( written != (int)cstr.length() ) { | 151 | if ( written != (int)cstr.length() ) { |
152 | f.close(); | 152 | f.close(); |
153 | QFile::remove( strNewFile ); | 153 | QFile::remove( strNewFile ); |
154 | return false; | 154 | return false; |
155 | } | 155 | } |
156 | out = QString::null; | 156 | out = QString::null; |
157 | } | 157 | } |
158 | 158 | ||
159 | out += "</Tasks>"; | 159 | out += "</Tasks>"; |
160 | QCString cstr = out.utf8(); | 160 | QCString cstr = out.utf8(); |
161 | written = f.writeBlock( cstr.data(), cstr.length() ); | 161 | written = f.writeBlock( cstr.data(), cstr.length() ); |
162 | 162 | ||
163 | if ( written != (int)cstr.length() ) { | 163 | if ( written != (int)cstr.length() ) { |
164 | f.close(); | 164 | f.close(); |
165 | QFile::remove( strNewFile ); | 165 | QFile::remove( strNewFile ); |
166 | return false; | 166 | return false; |
167 | } | 167 | } |
168 | /* flush before renaming */ | 168 | /* flush before renaming */ |
169 | f.close(); | 169 | f.close(); |
170 | 170 | ||
171 | if( ::rename( strNewFile.latin1(), m_file.latin1() ) < 0 ) { | 171 | if( ::rename( strNewFile.latin1(), m_file.latin1() ) < 0 ) { |
172 | // qWarning("error renaming"); | 172 | // qWarning("error renaming"); |
173 | QFile::remove( strNewFile ); | 173 | QFile::remove( strNewFile ); |
174 | } | 174 | } |
175 | 175 | ||
176 | m_changed = false; | 176 | m_changed = false; |
177 | return true; | 177 | return true; |
178 | } | 178 | } |
179 | QArray<int> OTodoAccessXML::allRecords()const { | 179 | QArray<int> OTodoAccessXML::allRecords()const { |
180 | QArray<int> ids( m_events.count() ); | 180 | QArray<int> ids( m_events.count() ); |
181 | QMap<int, OTodo>::ConstIterator it; | 181 | QMap<int, OTodo>::ConstIterator it; |
182 | int i = 0; | 182 | int i = 0; |
183 | 183 | ||
184 | for ( it = m_events.begin(); it != m_events.end(); ++it ) { | 184 | for ( it = m_events.begin(); it != m_events.end(); ++it ) { |
185 | ids[i] = it.key(); | 185 | ids[i] = it.key(); |
186 | i++; | 186 | i++; |
@@ -457,93 +457,107 @@ public: | |||
457 | /* completed */ | 457 | /* completed */ |
458 | case 0: { | 458 | case 0: { |
459 | ret = 0; | 459 | ret = 0; |
460 | if ( con1->todo.isCompleted() ) ret++; | 460 | if ( con1->todo.isCompleted() ) ret++; |
461 | if ( con2->todo.isCompleted() ) ret--; | 461 | if ( con2->todo.isCompleted() ) ret--; |
462 | break; | 462 | break; |
463 | } | 463 | } |
464 | /* priority */ | 464 | /* priority */ |
465 | case 1: { | 465 | case 1: { |
466 | ret = con1->todo.priority() - con2->todo.priority(); | 466 | ret = con1->todo.priority() - con2->todo.priority(); |
467 | qWarning(" priority %d %d %d", ret, | 467 | qWarning(" priority %d %d %d", ret, |
468 | con1->todo.priority(), | 468 | con1->todo.priority(), |
469 | con2->todo.priority() | 469 | con2->todo.priority() |
470 | ); | 470 | ); |
471 | break; | 471 | break; |
472 | } | 472 | } |
473 | /* description */ | 473 | /* description */ |
474 | case 2: { | 474 | case 2: { |
475 | QString str1 = string( con1->todo ); | 475 | QString str1 = string( con1->todo ); |
476 | QString str2 = string( con2->todo ); | 476 | QString str2 = string( con2->todo ); |
477 | ret = QString::compare( str1, str2 ); | 477 | ret = QString::compare( str1, str2 ); |
478 | break; | 478 | break; |
479 | } | 479 | } |
480 | /* deadline */ | 480 | /* deadline */ |
481 | case 3: { | 481 | case 3: { |
482 | /* either bot got a dueDate | 482 | /* either bot got a dueDate |
483 | * or one of them got one | 483 | * or one of them got one |
484 | */ | 484 | */ |
485 | if ( con1->todo.hasDueDate() && | 485 | if ( con1->todo.hasDueDate() && |
486 | con2->todo.hasDueDate() ) | 486 | con2->todo.hasDueDate() ) |
487 | ret = con1->todo.dueDate().daysTo( con2->todo.dueDate() ); | 487 | ret = con1->todo.dueDate().daysTo( con2->todo.dueDate() ); |
488 | 488 | ||
489 | 489 | ||
490 | else if ( con1->todo.hasDueDate() ) | 490 | else if ( con1->todo.hasDueDate() ) |
491 | ret = -1; | 491 | ret = -1; |
492 | else if ( con2->todo.hasDueDate() ) | 492 | else if ( con2->todo.hasDueDate() ) |
493 | ret = 0; | 493 | ret = 0; |
494 | break; | 494 | break; |
495 | } | 495 | } |
496 | default: | 496 | default: |
497 | ret = 0; | 497 | ret = 0; |
498 | break; | 498 | break; |
499 | }; | 499 | }; |
500 | 500 | ||
501 | /* twist it we're not ascending*/ | 501 | /* twist it we're not ascending*/ |
502 | if (!m_asc) | 502 | if (!m_asc) |
503 | ret = ret * -1; | 503 | ret = ret * -1; |
504 | return ret; | 504 | return ret; |
505 | } | 505 | } |
506 | private: | 506 | private: |
507 | bool m_asc; | 507 | bool m_asc; |
508 | int m_sort; | 508 | int m_sort; |
509 | 509 | ||
510 | }; | 510 | }; |
511 | 511 | ||
512 | QArray<int> OTodoAccessXML::sorted( bool asc, int sortOrder, | 512 | QArray<int> OTodoAccessXML::sorted( bool asc, int sortOrder, |
513 | int sortFilter, int cat ) { | 513 | int sortFilter, int cat ) { |
514 | qWarning("sorted! %d cat", cat); | 514 | qWarning("sorted! %d cat", cat); |
515 | OTodoXMLVector vector(m_events.count(), asc,sortOrder ); | 515 | OTodoXMLVector vector(m_events.count(), asc,sortOrder ); |
516 | QMap<int, OTodo>::Iterator it; | 516 | QMap<int, OTodo>::Iterator it; |
517 | int item = 0; | 517 | int item = 0; |
518 | 518 | ||
519 | bool bCat = sortFilter & 1 ? true : false; | 519 | bool bCat = sortFilter & 1 ? true : false; |
520 | bool bOnly = sortFilter & 2 ? true : false; | 520 | bool bOnly = sortFilter & 2 ? true : false; |
521 | bool comp = sortFilter & 4 ? true : false; | ||
521 | for ( it = m_events.begin(); it != m_events.end(); ++it ) { | 522 | for ( it = m_events.begin(); it != m_events.end(); ++it ) { |
522 | 523 | ||
523 | /* show category */ | 524 | /* show category */ |
524 | if ( bCat && cat != 0) | 525 | if ( bCat && cat != 0) |
525 | if (!(*it).categories().contains( cat ) ) | 526 | if (!(*it).categories().contains( cat ) ) { |
527 | qWarning("category mis match"); | ||
526 | continue; | 528 | continue; |
527 | /* isOverdue but we should not show overdue */ | 529 | } |
528 | if ( (*it).isOverdue() && !bOnly ) | 530 | /* isOverdue but we should not show overdue - why?*/ |
531 | /* if ( (*it).isOverdue() && !bOnly ) { | ||
532 | qWarning("item is overdue but !bOnly"); | ||
533 | continue; | ||
534 | } | ||
535 | */ | ||
536 | if ( !(*it).isOverdue() && bOnly ) { | ||
537 | qWarning("item is not overdue but bOnly checked"); | ||
529 | continue; | 538 | continue; |
530 | if ( !(*it).isOverdue() && bOnly ) | 539 | } |
540 | |||
541 | if ((*it).isCompleted() && comp ) { | ||
542 | qWarning("completed continue!"); | ||
531 | continue; | 543 | continue; |
544 | } | ||
532 | 545 | ||
533 | 546 | ||
534 | OTodoXMLContainer* con = new OTodoXMLContainer(); | 547 | OTodoXMLContainer* con = new OTodoXMLContainer(); |
535 | con->todo = (*it); | 548 | con->todo = (*it); |
536 | vector.insert(item, con ); | 549 | vector.insert(item, con ); |
537 | item++; | 550 | item++; |
538 | } | 551 | } |
552 | qWarning("XXX %d Items added", item); | ||
539 | vector.resize( item ); | 553 | vector.resize( item ); |
540 | /* sort it now */ | 554 | /* sort it now */ |
541 | vector.sort(); | 555 | vector.sort(); |
542 | /* now get the uids */ | 556 | /* now get the uids */ |
543 | QArray<int> array( vector.count() ); | 557 | QArray<int> array( vector.count() ); |
544 | for (uint i= 0; i < vector.count(); i++ ) { | 558 | for (uint i= 0; i < vector.count(); i++ ) { |
545 | array[i] = ( vector.at(i) )->todo.uid(); | 559 | array[i] = ( vector.at(i) )->todo.uid(); |
546 | } | 560 | } |
547 | qWarning("array count = %d %d", array.count(), vector.count() ); | 561 | qWarning("array count = %d %d", array.count(), vector.count() ); |
548 | return array; | 562 | return array; |
549 | }; | 563 | }; |
diff --git a/libopie2/opiepim/backend/otodoaccessxml.cpp b/libopie2/opiepim/backend/otodoaccessxml.cpp index 3b4cab2..7a55c67 100644 --- a/libopie2/opiepim/backend/otodoaccessxml.cpp +++ b/libopie2/opiepim/backend/otodoaccessxml.cpp | |||
@@ -58,129 +58,129 @@ bool OTodoAccessXML::load() { | |||
58 | int len = ba.size(); | 58 | int len = ba.size(); |
59 | int i = 0; | 59 | int i = 0; |
60 | char *point; | 60 | char *point; |
61 | const char* collectionString = "<Task "; | 61 | const char* collectionString = "<Task "; |
62 | while ( dt+i != 0 && ( point = strstr( dt+i, collectionString ) ) != 0l ) { | 62 | while ( dt+i != 0 && ( point = strstr( dt+i, collectionString ) ) != 0l ) { |
63 | i = point -dt; | 63 | i = point -dt; |
64 | i+= strlen(collectionString); | 64 | i+= strlen(collectionString); |
65 | OTodo ev; | 65 | OTodo ev; |
66 | m_year = m_month = m_day = 0; | 66 | m_year = m_month = m_day = 0; |
67 | 67 | ||
68 | while ( TRUE ) { | 68 | while ( TRUE ) { |
69 | while ( i < len && (dt[i] == ' ' || dt[i] == '\n' || dt[i] == '\r') ) | 69 | while ( i < len && (dt[i] == ' ' || dt[i] == '\n' || dt[i] == '\r') ) |
70 | ++i; | 70 | ++i; |
71 | if ( i >= len-2 || (dt[i] == '/' && dt[i+1] == '>') ) | 71 | if ( i >= len-2 || (dt[i] == '/' && dt[i+1] == '>') ) |
72 | break; | 72 | break; |
73 | 73 | ||
74 | // we have another attribute, read it. | 74 | // we have another attribute, read it. |
75 | int j = i; | 75 | int j = i; |
76 | while ( j < len && dt[j] != '=' ) | 76 | while ( j < len && dt[j] != '=' ) |
77 | ++j; | 77 | ++j; |
78 | QCString attr( dt+i, j-i+1); | 78 | QCString attr( dt+i, j-i+1); |
79 | 79 | ||
80 | i = ++j; // skip = | 80 | i = ++j; // skip = |
81 | 81 | ||
82 | // find the start of quotes | 82 | // find the start of quotes |
83 | while ( i < len && dt[i] != '"' ) | 83 | while ( i < len && dt[i] != '"' ) |
84 | ++i; | 84 | ++i; |
85 | j = ++i; | 85 | j = ++i; |
86 | 86 | ||
87 | bool haveUtf = FALSE; | 87 | bool haveUtf = FALSE; |
88 | bool haveEnt = FALSE; | 88 | bool haveEnt = FALSE; |
89 | while ( j < len && dt[j] != '"' ) { | 89 | while ( j < len && dt[j] != '"' ) { |
90 | if ( ((unsigned char)dt[j]) > 0x7f ) | 90 | if ( ((unsigned char)dt[j]) > 0x7f ) |
91 | haveUtf = TRUE; | 91 | haveUtf = TRUE; |
92 | if ( dt[j] == '&' ) | 92 | if ( dt[j] == '&' ) |
93 | haveEnt = TRUE; | 93 | haveEnt = TRUE; |
94 | ++j; | 94 | ++j; |
95 | } | 95 | } |
96 | if ( i == j ) { | 96 | if ( i == j ) { |
97 | // empty value | 97 | // empty value |
98 | i = j + 1; | 98 | i = j + 1; |
99 | continue; | 99 | continue; |
100 | } | 100 | } |
101 | 101 | ||
102 | QCString value( dt+i, j-i+1 ); | 102 | QCString value( dt+i, j-i+1 ); |
103 | i = j + 1; | 103 | i = j + 1; |
104 | 104 | ||
105 | QString str = (haveUtf ? QString::fromUtf8( value ) | 105 | QString str = (haveUtf ? QString::fromUtf8( value ) |
106 | : QString::fromLatin1( value ) ); | 106 | : QString::fromLatin1( value ) ); |
107 | if ( haveEnt ) | 107 | if ( haveEnt ) |
108 | str = Qtopia::plainString( str ); | 108 | str = Qtopia::plainString( str ); |
109 | 109 | ||
110 | /* | 110 | /* |
111 | * add key + value | 111 | * add key + value |
112 | */ | 112 | */ |
113 | todo( &dict, ev, attr, str ); | 113 | todo( &dict, ev, attr, str ); |
114 | 114 | ||
115 | } | 115 | } |
116 | /* | 116 | /* |
117 | * now add it | 117 | * now add it |
118 | */ | 118 | */ |
119 | m_events.insert(ev.uid(), ev ); | 119 | m_events.insert(ev.uid(), ev ); |
120 | } | 120 | } |
121 | 121 | ||
122 | qWarning("counts %d", m_events.count() ); | 122 | qWarning("counts %d records loaded!", m_events.count() ); |
123 | return true; | 123 | return true; |
124 | } | 124 | } |
125 | bool OTodoAccessXML::reload() { | 125 | bool OTodoAccessXML::reload() { |
126 | return load(); | 126 | return load(); |
127 | } | 127 | } |
128 | bool OTodoAccessXML::save() { | 128 | bool OTodoAccessXML::save() { |
129 | // qWarning("saving"); | 129 | // qWarning("saving"); |
130 | if (!m_opened || !m_changed ) { | 130 | if (!m_opened || !m_changed ) { |
131 | // qWarning("not saving"); | 131 | // qWarning("not saving"); |
132 | return true; | 132 | return true; |
133 | } | 133 | } |
134 | QString strNewFile = m_file + ".new"; | 134 | QString strNewFile = m_file + ".new"; |
135 | QFile f( strNewFile ); | 135 | QFile f( strNewFile ); |
136 | if (!f.open( IO_WriteOnly|IO_Raw ) ) | 136 | if (!f.open( IO_WriteOnly|IO_Raw ) ) |
137 | return false; | 137 | return false; |
138 | 138 | ||
139 | int written; | 139 | int written; |
140 | QString out; | 140 | QString out; |
141 | out = "<!DOCTYPE Tasks>\n<Tasks>\n"; | 141 | out = "<!DOCTYPE Tasks>\n<Tasks>\n"; |
142 | 142 | ||
143 | // for all todos | 143 | // for all todos |
144 | QMap<int, OTodo>::Iterator it; | 144 | QMap<int, OTodo>::Iterator it; |
145 | for (it = m_events.begin(); it != m_events.end(); ++it ) { | 145 | for (it = m_events.begin(); it != m_events.end(); ++it ) { |
146 | out+= "<Task " + toString( (*it) ) + " />\n"; | 146 | out+= "<Task " + toString( (*it) ) + " />\n"; |
147 | QCString cstr = out.utf8(); | 147 | QCString cstr = out.utf8(); |
148 | written = f.writeBlock( cstr.data(), cstr.length() ); | 148 | written = f.writeBlock( cstr.data(), cstr.length() ); |
149 | 149 | ||
150 | /* less written then we wanted */ | 150 | /* less written then we wanted */ |
151 | if ( written != (int)cstr.length() ) { | 151 | if ( written != (int)cstr.length() ) { |
152 | f.close(); | 152 | f.close(); |
153 | QFile::remove( strNewFile ); | 153 | QFile::remove( strNewFile ); |
154 | return false; | 154 | return false; |
155 | } | 155 | } |
156 | out = QString::null; | 156 | out = QString::null; |
157 | } | 157 | } |
158 | 158 | ||
159 | out += "</Tasks>"; | 159 | out += "</Tasks>"; |
160 | QCString cstr = out.utf8(); | 160 | QCString cstr = out.utf8(); |
161 | written = f.writeBlock( cstr.data(), cstr.length() ); | 161 | written = f.writeBlock( cstr.data(), cstr.length() ); |
162 | 162 | ||
163 | if ( written != (int)cstr.length() ) { | 163 | if ( written != (int)cstr.length() ) { |
164 | f.close(); | 164 | f.close(); |
165 | QFile::remove( strNewFile ); | 165 | QFile::remove( strNewFile ); |
166 | return false; | 166 | return false; |
167 | } | 167 | } |
168 | /* flush before renaming */ | 168 | /* flush before renaming */ |
169 | f.close(); | 169 | f.close(); |
170 | 170 | ||
171 | if( ::rename( strNewFile.latin1(), m_file.latin1() ) < 0 ) { | 171 | if( ::rename( strNewFile.latin1(), m_file.latin1() ) < 0 ) { |
172 | // qWarning("error renaming"); | 172 | // qWarning("error renaming"); |
173 | QFile::remove( strNewFile ); | 173 | QFile::remove( strNewFile ); |
174 | } | 174 | } |
175 | 175 | ||
176 | m_changed = false; | 176 | m_changed = false; |
177 | return true; | 177 | return true; |
178 | } | 178 | } |
179 | QArray<int> OTodoAccessXML::allRecords()const { | 179 | QArray<int> OTodoAccessXML::allRecords()const { |
180 | QArray<int> ids( m_events.count() ); | 180 | QArray<int> ids( m_events.count() ); |
181 | QMap<int, OTodo>::ConstIterator it; | 181 | QMap<int, OTodo>::ConstIterator it; |
182 | int i = 0; | 182 | int i = 0; |
183 | 183 | ||
184 | for ( it = m_events.begin(); it != m_events.end(); ++it ) { | 184 | for ( it = m_events.begin(); it != m_events.end(); ++it ) { |
185 | ids[i] = it.key(); | 185 | ids[i] = it.key(); |
186 | i++; | 186 | i++; |
@@ -457,93 +457,107 @@ public: | |||
457 | /* completed */ | 457 | /* completed */ |
458 | case 0: { | 458 | case 0: { |
459 | ret = 0; | 459 | ret = 0; |
460 | if ( con1->todo.isCompleted() ) ret++; | 460 | if ( con1->todo.isCompleted() ) ret++; |
461 | if ( con2->todo.isCompleted() ) ret--; | 461 | if ( con2->todo.isCompleted() ) ret--; |
462 | break; | 462 | break; |
463 | } | 463 | } |
464 | /* priority */ | 464 | /* priority */ |
465 | case 1: { | 465 | case 1: { |
466 | ret = con1->todo.priority() - con2->todo.priority(); | 466 | ret = con1->todo.priority() - con2->todo.priority(); |
467 | qWarning(" priority %d %d %d", ret, | 467 | qWarning(" priority %d %d %d", ret, |
468 | con1->todo.priority(), | 468 | con1->todo.priority(), |
469 | con2->todo.priority() | 469 | con2->todo.priority() |
470 | ); | 470 | ); |
471 | break; | 471 | break; |
472 | } | 472 | } |
473 | /* description */ | 473 | /* description */ |
474 | case 2: { | 474 | case 2: { |
475 | QString str1 = string( con1->todo ); | 475 | QString str1 = string( con1->todo ); |
476 | QString str2 = string( con2->todo ); | 476 | QString str2 = string( con2->todo ); |
477 | ret = QString::compare( str1, str2 ); | 477 | ret = QString::compare( str1, str2 ); |
478 | break; | 478 | break; |
479 | } | 479 | } |
480 | /* deadline */ | 480 | /* deadline */ |
481 | case 3: { | 481 | case 3: { |
482 | /* either bot got a dueDate | 482 | /* either bot got a dueDate |
483 | * or one of them got one | 483 | * or one of them got one |
484 | */ | 484 | */ |
485 | if ( con1->todo.hasDueDate() && | 485 | if ( con1->todo.hasDueDate() && |
486 | con2->todo.hasDueDate() ) | 486 | con2->todo.hasDueDate() ) |
487 | ret = con1->todo.dueDate().daysTo( con2->todo.dueDate() ); | 487 | ret = con1->todo.dueDate().daysTo( con2->todo.dueDate() ); |
488 | 488 | ||
489 | 489 | ||
490 | else if ( con1->todo.hasDueDate() ) | 490 | else if ( con1->todo.hasDueDate() ) |
491 | ret = -1; | 491 | ret = -1; |
492 | else if ( con2->todo.hasDueDate() ) | 492 | else if ( con2->todo.hasDueDate() ) |
493 | ret = 0; | 493 | ret = 0; |
494 | break; | 494 | break; |
495 | } | 495 | } |
496 | default: | 496 | default: |
497 | ret = 0; | 497 | ret = 0; |
498 | break; | 498 | break; |
499 | }; | 499 | }; |
500 | 500 | ||
501 | /* twist it we're not ascending*/ | 501 | /* twist it we're not ascending*/ |
502 | if (!m_asc) | 502 | if (!m_asc) |
503 | ret = ret * -1; | 503 | ret = ret * -1; |
504 | return ret; | 504 | return ret; |
505 | } | 505 | } |
506 | private: | 506 | private: |
507 | bool m_asc; | 507 | bool m_asc; |
508 | int m_sort; | 508 | int m_sort; |
509 | 509 | ||
510 | }; | 510 | }; |
511 | 511 | ||
512 | QArray<int> OTodoAccessXML::sorted( bool asc, int sortOrder, | 512 | QArray<int> OTodoAccessXML::sorted( bool asc, int sortOrder, |
513 | int sortFilter, int cat ) { | 513 | int sortFilter, int cat ) { |
514 | qWarning("sorted! %d cat", cat); | 514 | qWarning("sorted! %d cat", cat); |
515 | OTodoXMLVector vector(m_events.count(), asc,sortOrder ); | 515 | OTodoXMLVector vector(m_events.count(), asc,sortOrder ); |
516 | QMap<int, OTodo>::Iterator it; | 516 | QMap<int, OTodo>::Iterator it; |
517 | int item = 0; | 517 | int item = 0; |
518 | 518 | ||
519 | bool bCat = sortFilter & 1 ? true : false; | 519 | bool bCat = sortFilter & 1 ? true : false; |
520 | bool bOnly = sortFilter & 2 ? true : false; | 520 | bool bOnly = sortFilter & 2 ? true : false; |
521 | bool comp = sortFilter & 4 ? true : false; | ||
521 | for ( it = m_events.begin(); it != m_events.end(); ++it ) { | 522 | for ( it = m_events.begin(); it != m_events.end(); ++it ) { |
522 | 523 | ||
523 | /* show category */ | 524 | /* show category */ |
524 | if ( bCat && cat != 0) | 525 | if ( bCat && cat != 0) |
525 | if (!(*it).categories().contains( cat ) ) | 526 | if (!(*it).categories().contains( cat ) ) { |
527 | qWarning("category mis match"); | ||
526 | continue; | 528 | continue; |
527 | /* isOverdue but we should not show overdue */ | 529 | } |
528 | if ( (*it).isOverdue() && !bOnly ) | 530 | /* isOverdue but we should not show overdue - why?*/ |
531 | /* if ( (*it).isOverdue() && !bOnly ) { | ||
532 | qWarning("item is overdue but !bOnly"); | ||
533 | continue; | ||
534 | } | ||
535 | */ | ||
536 | if ( !(*it).isOverdue() && bOnly ) { | ||
537 | qWarning("item is not overdue but bOnly checked"); | ||
529 | continue; | 538 | continue; |
530 | if ( !(*it).isOverdue() && bOnly ) | 539 | } |
540 | |||
541 | if ((*it).isCompleted() && comp ) { | ||
542 | qWarning("completed continue!"); | ||
531 | continue; | 543 | continue; |
544 | } | ||
532 | 545 | ||
533 | 546 | ||
534 | OTodoXMLContainer* con = new OTodoXMLContainer(); | 547 | OTodoXMLContainer* con = new OTodoXMLContainer(); |
535 | con->todo = (*it); | 548 | con->todo = (*it); |
536 | vector.insert(item, con ); | 549 | vector.insert(item, con ); |
537 | item++; | 550 | item++; |
538 | } | 551 | } |
552 | qWarning("XXX %d Items added", item); | ||
539 | vector.resize( item ); | 553 | vector.resize( item ); |
540 | /* sort it now */ | 554 | /* sort it now */ |
541 | vector.sort(); | 555 | vector.sort(); |
542 | /* now get the uids */ | 556 | /* now get the uids */ |
543 | QArray<int> array( vector.count() ); | 557 | QArray<int> array( vector.count() ); |
544 | for (uint i= 0; i < vector.count(); i++ ) { | 558 | for (uint i= 0; i < vector.count(); i++ ) { |
545 | array[i] = ( vector.at(i) )->todo.uid(); | 559 | array[i] = ( vector.at(i) )->todo.uid(); |
546 | } | 560 | } |
547 | qWarning("array count = %d %d", array.count(), vector.count() ); | 561 | qWarning("array count = %d %d", array.count(), vector.count() ); |
548 | return array; | 562 | return array; |
549 | }; | 563 | }; |