1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
|
/*
This file is part of KAddressBook.
Copyright (c) 2004 Tobias Koenig <tokoe@kde.org>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
As a special exception, permission is given to link this program
with any edition of Qt, and distribute the resulting executable,
without including the source code for Qt in the source distribution.
*/
#include <kabc/addresseelist.h>
#include <kdeversion.h>
#include "searchmanager.h"
using namespace KAB;
SearchManager::SearchManager( KABC::AddressBook *ab,
TQObject *parent, const char *name )
: TQObject( parent, name ), mAddressBook( ab )
{
}
void SearchManager::search( const TQString &pattern, const KABC::Field::List &fields, Type type )
{
mPattern = pattern;
mFields = fields;
mType = type;
KABC::Addressee::List allContacts;
mContacts.clear();
#if KDE_VERSION >= 319
KABC::AddresseeList list( mAddressBook->allAddressees() );
if ( !fields.isEmpty() )
list.sortByField( fields.first() );
allContacts = list;
#else
KABC::AddressBook::ConstIterator abIt( mAddressBook->begin() );
const KABC::AddressBook::ConstIterator abEndIt( mAddressBook->end() );
for ( ; abIt != abEndIt; ++abIt )
allContacts.append( *abIt );
#endif
#ifdef KDEPIM_NEW_DISTRLISTS
// Extract distribution lists from allContacts
mDistributionLists.clear();
KABC::Addressee::List::Iterator rmIt( allContacts.begin() );
const KABC::Addressee::List::Iterator rmEndIt( allContacts.end() );
while ( rmIt != rmEndIt ) {
if ( KPIM::DistributionList::isDistributionList( *rmIt ) ) {
mDistributionLists.append( static_cast<KPIM::DistributionList>( *rmIt ) );
rmIt = allContacts.remove( rmIt );
} else
++rmIt;
}
typedef KPIM::DistributionList::Entry Entry;
if ( !mSelectedDistributionList.isNull() ) {
const KPIM::DistributionList dl = KPIM::DistributionList::findByName( mAddressBook, mSelectedDistributionList );
if ( !dl.isEmpty() ) {
allContacts.clear();
const Entry::List entries = dl.entries( mAddressBook );
const Entry::List::ConstIterator end = entries.end();
for ( Entry::List::ConstIterator it = entries.begin(); it != end; ++it ) {
allContacts.append( (*it).addressee );
}
}
}
#endif
if ( mPattern.isEmpty() ) { // no pattern, return all
mContacts = allContacts;
emit contactsUpdated();
return;
}
const KABC::Field::List fieldList = !mFields.isEmpty() ? mFields : KABC::Field::allFields();
KABC::Addressee::List::ConstIterator it( allContacts.begin() );
const KABC::Addressee::List::ConstIterator endIt( allContacts.end() );
for ( ; it != endIt; ++it ) {
#ifdef KDEPIM_NEW_DISTRLISTS
if ( KPIM::DistributionList::isDistributionList( *it ) )
continue;
#endif
bool found = false;
// search over all fields
KABC::Field::List::ConstIterator fieldIt( fieldList.begin() );
const KABC::Field::List::ConstIterator fieldEndIt( fieldList.end() );
for ( ; fieldIt != fieldEndIt; ++fieldIt ) {
if ( type == StartsWith && (*fieldIt)->value( *it ).startsWith( pattern, false ) ) {
mContacts.append( *it );
found = true;
break;
} else if ( type == EndsWith && (*fieldIt)->value( *it ).endsWith( pattern, false ) ) {
mContacts.append( *it );
found = true;
break;
} else if ( type == Contains && (*fieldIt)->value( *it ).find( pattern, 0, false ) != -1 ) {
mContacts.append( *it );
found = true;
break;
} else if ( type == Equals && (*fieldIt)->value( *it ).localeAwareCompare( pattern ) == 0 ) {
mContacts.append( *it );
found = true;
break;
}
}
if ( !found ) {
// search over custom fields
const TQStringList customs = (*it).customs();
TQStringList::ConstIterator customIt( customs.begin() );
const TQStringList::ConstIterator customEndIt( customs.end() );
for ( ; customIt != customEndIt; ++customIt ) {
int pos = (*customIt).find( ':' );
if ( pos != -1 ) {
const TQString value = (*customIt).mid( pos + 1 );
if ( type == StartsWith && value.startsWith( pattern, false ) ) {
mContacts.append( *it );
break;
} else if ( type == EndsWith && value.endsWith( pattern, false ) ) {
mContacts.append( *it );
break;
} else if ( type == Contains && value.find( pattern, 0, false ) != -1 ) {
mContacts.append( *it );
break;
} else if ( type == Equals && value.localeAwareCompare( pattern ) == 0 ) {
mContacts.append( *it );
break;
}
}
}
}
}
emit contactsUpdated();
}
KABC::Addressee::List SearchManager::contacts() const
{
return mContacts;
}
void SearchManager::reload()
{
search( mPattern, mFields, mType );
}
#ifdef KDEPIM_NEW_DISTRLISTS
void KAB::SearchManager::setSelectedDistributionList( const TQString &name )
{
if ( mSelectedDistributionList == name )
return;
mSelectedDistributionList = name;
reload();
}
KPIM::DistributionList::List KAB::SearchManager::distributionLists() const
{
return mDistributionLists;
}
TQStringList KAB::SearchManager::distributionListNames() const
{
TQStringList lst;
KPIM::DistributionList::List::ConstIterator it( mDistributionLists.begin() );
const KPIM::DistributionList::List::ConstIterator endIt( mDistributionLists.end() );
for ( ; it != endIt; ++it ) {
lst.append( (*it).formattedName() );
}
return lst;
}
#endif
#include "searchmanager.moc"
|
