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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
|
/*
This file is part of libkabc.
Copyright (c) 2002 Jost Schenck <jost@schenck.de>
2003 Tobias Koenig <tokoe@kde.org>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include <kdebug.h>
#include "addresseelist.h"
#include "field.h"
#include "sortmode.h"
using namespace KABC;
//
//
// Traits
//
//
bool SortingTraits::Uid::eq( const Addressee &a1, const Addressee &a2 )
{
// locale awareness doesn't make sense sorting ids
return ( TQString::compare( a1.uid(), a2.uid() ) == 0 );
}
bool SortingTraits::Uid::lt( const Addressee &a1, const Addressee &a2 )
{
// locale awareness doesn't make sense sorting ids
return ( TQString::compare( a1.uid(), a2.uid() ) < 0 );
}
bool SortingTraits::Name::eq( const Addressee &a1, const Addressee &a2 )
{
return ( TQString::localeAwareCompare( a1.name(), a2.name() ) == 0 );
}
bool SortingTraits::Name::lt( const Addressee &a1, const Addressee &a2 )
{
return ( TQString::localeAwareCompare( a1.name(), a2.name() ) < 0 );
}
bool SortingTraits::FormattedName::eq( const Addressee &a1, const Addressee &a2 )
{
return ( TQString::localeAwareCompare( a1.formattedName(), a2.formattedName() ) == 0 );
}
bool SortingTraits::FormattedName::lt( const Addressee &a1, const Addressee &a2 )
{
return ( TQString::localeAwareCompare( a1.formattedName(), a2.formattedName() ) < 0 );
}
bool SortingTraits::FamilyName::eq( const Addressee &a1, const Addressee &a2 )
{
return ( TQString::localeAwareCompare( a1.familyName(), a2.familyName() ) == 0
&& TQString::localeAwareCompare( a1.givenName(), a2.givenName() ) == 0 );
}
bool SortingTraits::FamilyName::lt( const Addressee &a1, const Addressee &a2 )
{
int family = TQString::localeAwareCompare( a1.familyName(), a2.familyName() );
if ( 0 == family ) {
return ( TQString::localeAwareCompare( a1.givenName(), a2.givenName() ) < 0 );
} else {
return family < 0;
}
}
bool SortingTraits::GivenName::eq( const Addressee &a1, const Addressee &a2 )
{
return ( TQString::localeAwareCompare( a1.givenName(), a2.givenName() ) == 0
&& TQString::localeAwareCompare( a1.familyName(), a2.familyName() ) == 0 );
}
bool SortingTraits::GivenName::lt( const Addressee &a1, const Addressee &a2 )
{
int given = TQString::localeAwareCompare( a1.givenName(), a2.givenName() );
if ( 0 == given ) {
return ( TQString::localeAwareCompare( a1.familyName(), a2.familyName() ) < 0 );
} else {
return given < 0;
}
}
//
//
// AddresseeList
//
//
static Field *sActiveField=0;
AddresseeList::AddresseeList()
: TQValueList<Addressee>()
{
mReverseSorting = false;
mActiveSortingCriterion = FormattedName;
}
AddresseeList::~AddresseeList()
{
}
AddresseeList::AddresseeList( const AddresseeList &l )
: TQValueList<Addressee>( l )
{
mReverseSorting = l.reverseSorting();
mActiveSortingCriterion = l.sortingCriterion();
}
AddresseeList::AddresseeList( const TQValueList<Addressee> &l )
: TQValueList<Addressee>( l )
{
mReverseSorting = false;
}
void AddresseeList::dump() const
{
kdDebug(5700) << "AddresseeList {" << endl;
kdDebug(5700) << "reverse order: " << ( mReverseSorting ? "true" : "false" ) << endl;
TQString crit;
if ( Uid == mActiveSortingCriterion ) {
crit = "Uid";
} else if ( Name == mActiveSortingCriterion ) {
crit = "Name";
} else if ( FormattedName == mActiveSortingCriterion ) {
crit = "FormattedName";
} else if ( FamilyName == mActiveSortingCriterion ) {
crit = "FamilyName";
} else if ( GivenName == mActiveSortingCriterion ) {
crit = "GivenName";
} else {
crit = "unknown -- update dump method";
}
kdDebug(5700) << "sorting criterion: " << crit << endl;
for ( const_iterator it = begin(); it != end(); ++it ) {
(*it).dump();
}
kdDebug(5700) << "}" << endl;
}
void AddresseeList::sortBy( SortingCriterion c )
{
mActiveSortingCriterion = c;
if ( Uid == c ) {
sortByTrait<SortingTraits::Uid>();
} else if ( Name == c ) {
sortByTrait<SortingTraits::Name>();
} else if ( FormattedName == c ) {
sortByTrait<SortingTraits::FormattedName>();
} else if ( FamilyName == c ) {
sortByTrait<SortingTraits::FamilyName>();
} else if ( GivenName==c ) {
sortByTrait<SortingTraits::GivenName>();
} else {
kdError(5700) << "AddresseeList sorting criterion passed for which a trait is not known. No sorting done." << endl;
}
}
void AddresseeList::sort()
{
sortBy( mActiveSortingCriterion );
}
template<class Trait>
void AddresseeList::sortByTrait()
{
// FIXME: better sorting algorithm, bubblesort is not acceptable for larger lists.
//
// for i := 1 to n - 1
// do for j := 1 to n - i
// do if A[j] > A[j+1]
// then temp := A[j]
// A[j] := A[j + 1]
// A[j + 1 ] := temp
iterator i1 = begin();
iterator endIt = end();
--endIt;
if ( i1 == endIt ) // don't need sorting
return;
iterator i2 = endIt;
while( i1 != endIt ) {
iterator j1 = begin();
iterator j2 = j1;
++j2;
while( j1 != i2 ) {
if ( !mReverseSorting && Trait::lt( *j2, *j1 )
|| mReverseSorting && Trait::lt( *j1, *j2 ) ) {
tqSwap( *j1, *j2 );
}
++j1;
++j2;
}
++i1;
--i2;
}
}
void AddresseeList::sortByField( Field *field )
{
if ( !field ) {
kdWarning(5700) << "sortByField called with no active sort field" << endl;
return;
}
sActiveField = field;
if ( count() == 0 )
return;
KABC::FieldSortMode *mode = new KABC::FieldSortMode( sActiveField, !mReverseSorting );
KABC::Addressee::setSortMode( mode );
qHeapSort( *this );
KABC::Addressee::setSortMode( 0 );
delete mode;
}
void AddresseeList::sortByMode( SortMode *mode )
{
if ( count() == 0 )
return;
KABC::Addressee::setSortMode( mode );
qHeapSort( *this );
KABC::Addressee::setSortMode( 0 );
}
Field*
AddresseeList::sortingField() const
{
return sActiveField;
}
|
