summaryrefslogtreecommitdiff
path: root/libopie/pim
Unidiff
Diffstat (limited to 'libopie/pim') (more/less context) (ignore whitespace changes)
-rw-r--r--libopie/pim/ocontactaccessbackend_xml.h9
1 files changed, 6 insertions, 3 deletions
diff --git a/libopie/pim/ocontactaccessbackend_xml.h b/libopie/pim/ocontactaccessbackend_xml.h
index 8b95102..adc8dc3 100644
--- a/libopie/pim/ocontactaccessbackend_xml.h
+++ b/libopie/pim/ocontactaccessbackend_xml.h
@@ -1,67 +1,70 @@
1/* 1/*
2 * XML Backend for the OPIE-Contact Database. 2 * XML Backend for the OPIE-Contact Database.
3 * 3 *
4 * Copyright (c) 2002 by Stefan Eilers (Eilers.Stefan@epost.de) 4 * Copyright (c) 2002 by Stefan Eilers (Eilers.Stefan@epost.de)
5 * 5 *
6 * ===================================================================== 6 * =====================================================================
7 *This program is free software; you can redistribute it and/or 7 *This program is free software; you can redistribute it and/or
8 *modify it under the terms of the GNU Library General Public 8 *modify it under the terms of the GNU Library General Public
9 * License as published by the Free Software Foundation; either 9 * License as published by the Free Software Foundation; either
10 * version 2 of the License, or (at your option) any later version. 10 * version 2 of the License, or (at your option) any later version.
11 * ===================================================================== 11 * =====================================================================
12 * ToDo: XML-Backend: Automatic reload if something was changed... 12 * ToDo: XML-Backend: Automatic reload if something was changed...
13 * 13 *
14 * 14 *
15 * ===================================================================== 15 * =====================================================================
16 * Version: $Id$ 16 * Version: $Id$
17 * ===================================================================== 17 * =====================================================================
18 * History: 18 * History:
19 * $Log$ 19 * $Log$
20 * Revision 1.7 2002/11/13 15:02:46 eilers
21 * Small Bug in sorted fixed
22 *
20 * Revision 1.6 2002/11/13 14:14:51 eilers 23 * Revision 1.6 2002/11/13 14:14:51 eilers
21 * Added sorted for Contacts.. 24 * Added sorted for Contacts..
22 * 25 *
23 * Revision 1.5 2002/11/01 15:10:42 eilers 26 * Revision 1.5 2002/11/01 15:10:42 eilers
24 * Added regExp-search in database for all fields in a contact. 27 * Added regExp-search in database for all fields in a contact.
25 * 28 *
26 * Revision 1.4 2002/10/16 10:52:40 eilers 29 * Revision 1.4 2002/10/16 10:52:40 eilers
27 * Added some docu to the interface and now using the cache infrastucture by zecke.. :) 30 * Added some docu to the interface and now using the cache infrastucture by zecke.. :)
28 * 31 *
29 * Revision 1.3 2002/10/14 16:21:54 eilers 32 * Revision 1.3 2002/10/14 16:21:54 eilers
30 * Some minor interface updates 33 * Some minor interface updates
31 * 34 *
32 * Revision 1.2 2002/10/07 17:34:24 eilers 35 * Revision 1.2 2002/10/07 17:34:24 eilers
33 * added OBackendFactory for advanced backend access 36 * added OBackendFactory for advanced backend access
34 * 37 *
35 * Revision 1.1 2002/09/27 17:11:44 eilers 38 * Revision 1.1 2002/09/27 17:11:44 eilers
36 * Added API for accessing the Contact-Database ! It is compiling, but 39 * Added API for accessing the Contact-Database ! It is compiling, but
37 * please do not expect that anything is working ! 40 * please do not expect that anything is working !
38 * I will debug that stuff in the next time .. 41 * I will debug that stuff in the next time ..
39 * Please read README_COMPILE for compiling ! 42 * Please read README_COMPILE for compiling !
40 * 43 *
41 * 44 *
42 */ 45 */
43 46
44#ifndef _OContactAccessBackend_XML_ 47#ifndef _OContactAccessBackend_XML_
45#define _OContactAccessBackend_XML_ 48#define _OContactAccessBackend_XML_
46 49
47#include <qasciidict.h> 50#include <qasciidict.h>
48#include <qdatetime.h> 51#include <qdatetime.h>
49#include <qfile.h> 52#include <qfile.h>
50#include <qfileinfo.h> 53#include <qfileinfo.h>
51#include <qregexp.h> 54#include <qregexp.h>
52#include <qarray.h> 55#include <qarray.h>
53#include <qmap.h> 56#include <qmap.h>
54 57
55#include <qpe/global.h> 58#include <qpe/global.h>
56 59
57#include <opie/xmltree.h> 60#include <opie/xmltree.h>
58#include "ocontactaccessbackend.h" 61#include "ocontactaccessbackend.h"
59#include "ocontactaccess.h" 62#include "ocontactaccess.h"
60 63
61#include <stdlib.h> 64#include <stdlib.h>
62#include <errno.h> 65#include <errno.h>
63 66
64using namespace Opie; 67using namespace Opie;
65 68
66/* the default xml implementation */ 69/* the default xml implementation */
67class OContactAccessBackend_XML : public OContactAccessBackend { 70class OContactAccessBackend_XML : public OContactAccessBackend {
@@ -267,102 +270,102 @@ class OContactAccessBackend_XML : public OContactAccessBackend {
267 QValueListConstIterator<OContact> it; 270 QValueListConstIterator<OContact> it;
268 uint arraycounter = 0; 271 uint arraycounter = 0;
269 272
270 for( it = m_contactList.begin(); it != m_contactList.end(); ++it ){ 273 for( it = m_contactList.begin(); it != m_contactList.end(); ++it ){
271 if ( (*it).match( r ) ){ 274 if ( (*it).match( r ) ){
272 m_currentQuery[arraycounter++] = (*it).uid(); 275 m_currentQuery[arraycounter++] = (*it).uid();
273 } 276 }
274 277
275 } 278 }
276 // Shrink to fit.. 279 // Shrink to fit..
277 m_currentQuery.resize(arraycounter); 280 m_currentQuery.resize(arraycounter);
278 281
279 return m_currentQuery; 282 return m_currentQuery;
280 } 283 }
281 284
282 const uint querySettings() 285 const uint querySettings()
283 { 286 {
284 return ( OContactAccess::WildCards 287 return ( OContactAccess::WildCards
285 & OContactAccess::IgnoreCase 288 & OContactAccess::IgnoreCase
286 & OContactAccess::RegExp 289 & OContactAccess::RegExp
287 & OContactAccess::ExactMatch ); 290 & OContactAccess::ExactMatch );
288 } 291 }
289 292
290 bool hasQuerySettings (uint querySettings) const 293 bool hasQuerySettings (uint querySettings) const
291 { 294 {
292 /* OContactAccess::IgnoreCase may be added with one 295 /* OContactAccess::IgnoreCase may be added with one
293 * of the other settings, but never used alone. 296 * of the other settings, but never used alone.
294 * The other settings are just valid alone... 297 * The other settings are just valid alone...
295 */ 298 */
296 switch ( querySettings & ~OContactAccess::IgnoreCase ){ 299 switch ( querySettings & ~OContactAccess::IgnoreCase ){
297 case OContactAccess::RegExp: 300 case OContactAccess::RegExp:
298 return ( true ); 301 return ( true );
299 case OContactAccess::WildCards: 302 case OContactAccess::WildCards:
300 return ( true ); 303 return ( true );
301 case OContactAccess::ExactMatch: 304 case OContactAccess::ExactMatch:
302 return ( true ); 305 return ( true );
303 default: 306 default:
304 return ( false ); 307 return ( false );
305 } 308 }
306 } 309 }
307 310
308 // Currently only asc implemented.. 311 // Currently only asc implemented..
309 QArray<int> sorted( bool asc, int , int , int ) 312 QArray<int> sorted( bool asc, int , int , int )
310 { 313 {
311 QMap<QString, int> nameToUid; 314 QMap<QString, int> nameToUid;
312 QStringList names; 315 QStringList names;
313 QArray<int> m_currentQuery( m_contactList.count() ); 316 QArray<int> m_currentQuery( m_contactList.count() );
314 317
315 // First fill map and StringList with all Names ( better LastNames ? ) 318 // First fill map and StringList with all Names
316 // Afterwards sort namelist and use map to fill array to return.. 319 // Afterwards sort namelist and use map to fill array to return..
317 QValueListConstIterator<OContact> it; 320 QValueListConstIterator<OContact> it;
318 for( it = m_contactList.begin(); it != m_contactList.end(); ++it ){ 321 for( it = m_contactList.begin(); it != m_contactList.end(); ++it ){
319 names.append( (*it).lastName() ); 322 names.append( (*it).fileAs() );
320 nameToUid.insert( (*it).lastName(), (*it).uid() ); 323 nameToUid.insert( (*it).fileAs(), (*it).uid() );
321 } 324 }
322 names.sort(); 325 names.sort();
323 326
324 int i = 0; 327 int i = 0;
325 if ( asc ){ 328 if ( asc ){
326 for ( QStringList::Iterator it = names.begin(); it != names.end(); ++it ) 329 for ( QStringList::Iterator it = names.begin(); it != names.end(); ++it )
327 m_currentQuery[i++] = nameToUid[ (*it) ]; 330 m_currentQuery[i++] = nameToUid[ (*it) ];
328 }else{ 331 }else{
329 for ( QStringList::Iterator it = names.end(); it != names.begin(); --it ) 332 for ( QStringList::Iterator it = names.end(); it != names.begin(); --it )
330 m_currentQuery[i++] = nameToUid[ (*it) ]; 333 m_currentQuery[i++] = nameToUid[ (*it) ];
331 } 334 }
332 335
333 return m_currentQuery; 336 return m_currentQuery;
334 337
335 } 338 }
336 bool add ( const OContact &newcontact ) 339 bool add ( const OContact &newcontact )
337 { 340 {
338 //qWarning("odefaultbackend: ACTION::ADD"); 341 //qWarning("odefaultbackend: ACTION::ADD");
339 updateJournal (newcontact, OContact::ACTION_ADD); 342 updateJournal (newcontact, OContact::ACTION_ADD);
340 addContact_p( newcontact ); 343 addContact_p( newcontact );
341 344
342 m_changed = true; 345 m_changed = true;
343 346
344 return true; 347 return true;
345 } 348 }
346 349
347 bool replace ( const OContact &contact ) 350 bool replace ( const OContact &contact )
348 { 351 {
349 m_changed = true; 352 m_changed = true;
350 353
351 bool found = false; 354 bool found = false;
352 355
353 QValueListIterator<OContact> it; 356 QValueListIterator<OContact> it;
354 for( it = m_contactList.begin(); it != m_contactList.end(); ++it ){ 357 for( it = m_contactList.begin(); it != m_contactList.end(); ++it ){
355 if ( (*it).uid() == contact.uid() ){ 358 if ( (*it).uid() == contact.uid() ){
356 found = true; 359 found = true;
357 break; 360 break;
358 } 361 }
359 } 362 }
360 if (found) { 363 if (found) {
361 updateJournal (contact, OContact::ACTION_REPLACE); 364 updateJournal (contact, OContact::ACTION_REPLACE);
362 m_contactList.remove (it); 365 m_contactList.remove (it);
363 m_contactList.append (contact); 366 m_contactList.append (contact);
364 return true; 367 return true;
365 } else 368 } else
366 return false; 369 return false;
367 } 370 }
368 371