author | mickeyl <mickeyl> | 2004-02-23 13:15:42 (UTC) |
---|---|---|
committer | mickeyl <mickeyl> | 2004-02-23 13:15:42 (UTC) |
commit | f9f0c26d9ac94586ffc36efa1b582ece3dbc43cf (patch) (unidiff) | |
tree | 4044006e676c78370fdeccf960ea4214f13eabd2 /libopie2/opiepim/orecordlist.h | |
parent | 2d37d653310da0a9d6e2e2e6c9f5bf092e54cbbb (diff) | |
download | opie-f9f0c26d9ac94586ffc36efa1b582ece3dbc43cf.zip opie-f9f0c26d9ac94586ffc36efa1b582ece3dbc43cf.tar.gz opie-f9f0c26d9ac94586ffc36efa1b582ece3dbc43cf.tar.bz2 |
cosmetics
Diffstat (limited to 'libopie2/opiepim/orecordlist.h') (more/less context) (ignore whitespace changes)
-rw-r--r-- | libopie2/opiepim/orecordlist.h | 230 |
1 files changed, 148 insertions, 82 deletions
diff --git a/libopie2/opiepim/orecordlist.h b/libopie2/opiepim/orecordlist.h index 8f0011b..1742dcc 100644 --- a/libopie2/opiepim/orecordlist.h +++ b/libopie2/opiepim/orecordlist.h | |||
@@ -6,331 +6,397 @@ | |||
6 | .>+-= | 6 | .>+-= |
7 | _;:, .> :=|. This program is free software; you can | 7 | _;:, .> :=|. This program is free software; you can |
8 | .> <`_, > . <= redistribute it and/or modify it under | 8 | .> <`_, > . <= redistribute it and/or modify it under |
9 | :`=1 )Y*s>-.-- : the terms of the GNU Library General Public | 9 | :`=1 )Y*s>-.-- : the terms of the GNU Library General Public |
10 | .="- .-=="i, .._ License as published by the Free Software | 10 | .="- .-=="i, .._ License as published by the Free Software |
11 | - . .-<_> .<> Foundation; either version 2 of the License, | 11 | - . .-<_> .<> Foundation; either version 2 of the License, |
12 | ._= =} : or (at your option) any later version. | 12 | ._= =} : or (at your option) any later version. |
13 | .%`+i> _;_. | 13 | .%`+i> _;_. |
14 | .i_,=:_. -<s. This program is distributed in the hope that | 14 | .i_,=:_. -<s. This program is distributed in the hope that |
15 | + . -:. = it will be useful, but WITHOUT ANY WARRANTY; | 15 | + . -:. = it will be useful, but WITHOUT ANY WARRANTY; |
16 | : .. .:, . . . without even the implied warranty of | 16 | : .. .:, . . . without even the implied warranty of |
17 | =_ + =;=|` MERCHANTABILITY or FITNESS FOR A | 17 | =_ + =;=|` MERCHANTABILITY or FITNESS FOR A |
18 | _.=:. : :=>`: PARTICULAR PURPOSE. See the GNU | 18 | _.=:. : :=>`: PARTICULAR PURPOSE. See the GNU |
19 | ..}^=.= = ; Library General Public License for more | 19 | ..}^=.= = ; Library General Public License for more |
20 | ++= -. .` .: details. | 20 | ++= -. .` .: details. |
21 | : = ...= . :.=- | 21 | : = ...= . :.=- |
22 | -. .:....=;==+<; You should have received a copy of the GNU | 22 | -. .:....=;==+<; You should have received a copy of the GNU |
23 | -_. . . )=. = Library General Public License along with | 23 | -_. . . )=. = Library General Public License along with |
24 | -- :-=` this library; see the file COPYING.LIB. | 24 | -- :-=` this library; see the file COPYING.LIB. |
25 | If not, write to the Free Software Foundation, | 25 | If not, write to the Free Software Foundation, |
26 | Inc., 59 Temple Place - Suite 330, | 26 | Inc., 59 Temple Place - Suite 330, |
27 | Boston, MA 02111-1307, USA. | 27 | Boston, MA 02111-1307, USA. |
28 | */ | 28 | */ |
29 | 29 | ||
30 | #ifndef OPIE_RECORD_LIST_H | 30 | #ifndef ORECORDLIST_H |
31 | #define OPIE_RECORD_LIST_H | 31 | #define ORECORDLIST_H |
32 | |||
33 | #include <qarray.h> | ||
34 | 32 | ||
33 | /* OPIE */ | ||
35 | #include <opie2/otemplatebase.h> | 34 | #include <opie2/otemplatebase.h> |
36 | #include <opie2/opimrecord.h> | 35 | #include <opie2/opimrecord.h> |
37 | 36 | ||
38 | namespace Opie { | 37 | /* QT */ |
38 | #include <qarray.h> | ||
39 | |||
40 | namespace Opie | ||
41 | { | ||
39 | 42 | ||
40 | class ORecordListIteratorPrivate; | 43 | class ORecordListIteratorPrivate; |
41 | /** | 44 | /** |
42 | * Our List Iterator | 45 | * Our List Iterator |
43 | * it behaves like STL or Qt | 46 | * it behaves like STL or Qt |
44 | * | 47 | * |
45 | * for(it = list.begin(); it != list.end(); ++it ) | 48 | * for(it = list.begin(); it != list.end(); ++it ) |
46 | * doSomeCoolStuff( (*it) ); | 49 | * doSomeCoolStuff( (*it) ); |
47 | */ | 50 | */ |
48 | template <class T> class ORecordList; | 51 | template <class T> class ORecordList; |
49 | template <class T = OPimRecord> | 52 | template <class T = OPimRecord> |
50 | class ORecordListIterator { | 53 | class ORecordListIterator |
54 | { | ||
51 | friend class ORecordList<T>; | 55 | friend class ORecordList<T>; |
52 | public: | 56 | |
57 | public: | ||
53 | typedef OTemplateBase<T> Base; | 58 | typedef OTemplateBase<T> Base; |
54 | 59 | ||
55 | /** | 60 | /** |
56 | * The c'tor used internally from | 61 | * The c'tor used internally from |
57 | * ORecordList | 62 | * ORecordList |
58 | */ | 63 | */ |
59 | ORecordListIterator( const QArray<int>, const Base* ); | 64 | ORecordListIterator( const QArray<int>, const Base* ); |
60 | 65 | ||
61 | /** | 66 | /** |
62 | * The standard c'tor | 67 | * The standard c'tor |
63 | */ | 68 | */ |
64 | ORecordListIterator(); | 69 | ORecordListIterator(); |
65 | ~ORecordListIterator(); | 70 | ~ORecordListIterator(); |
66 | 71 | ||
67 | ORecordListIterator( const ORecordListIterator& ); | 72 | ORecordListIterator( const ORecordListIterator& ); |
68 | ORecordListIterator &operator=(const ORecordListIterator& ); | 73 | ORecordListIterator &operator=( const ORecordListIterator& ); |
69 | 74 | ||
70 | /** | 75 | /** |
71 | * a * operator ;) | 76 | * a * operator ;) |
72 | * use it like this T = (*it); | 77 | * use it like this T = (*it); |
73 | */ | 78 | */ |
74 | T operator*(); | 79 | T operator*(); |
75 | ORecordListIterator &operator++(); | 80 | ORecordListIterator &operator++(); |
76 | ORecordListIterator &operator--(); | 81 | ORecordListIterator &operator--(); |
77 | 82 | ||
78 | bool operator==( const ORecordListIterator& it ); | 83 | bool operator==( const ORecordListIterator& it ); |
79 | bool operator!=( const ORecordListIterator& it ); | 84 | bool operator!=( const ORecordListIterator& it ); |
80 | 85 | ||
81 | /** | 86 | /** |
82 | * the current item | 87 | * the current item |
83 | */ | 88 | */ |
84 | uint current()const; | 89 | uint current() const; |
85 | 90 | ||
86 | /** | 91 | /** |
87 | * the number of items | 92 | * the number of items |
88 | */ | 93 | */ |
89 | uint count()const; | 94 | uint count() const; |
90 | 95 | ||
91 | /** | 96 | /** |
92 | * sets the current item | 97 | * sets the current item |
93 | */ | 98 | */ |
94 | void setCurrent( uint cur ); | 99 | void setCurrent( uint cur ); |
95 | 100 | ||
96 | private: | 101 | private: |
97 | QArray<int> m_uids; | 102 | QArray<int> m_uids; |
98 | uint m_current; | 103 | uint m_current; |
99 | const Base* m_temp; | 104 | const Base* m_temp; |
100 | bool m_end : 1; | 105 | bool m_end : 1; |
101 | T m_record; | 106 | T m_record; |
102 | bool m_direction :1; | 107 | bool m_direction : 1; |
103 | 108 | ||
104 | /* d pointer for future versions */ | 109 | /* d pointer for future versions */ |
105 | ORecordListIteratorPrivate *d; | 110 | ORecordListIteratorPrivate *d; |
106 | }; | 111 | }; |
107 | 112 | ||
113 | |||
108 | class ORecordListPrivate; | 114 | class ORecordListPrivate; |
109 | /** | 115 | /** |
110 | * The recordlist used as a return type | 116 | * The recordlist used as a return type |
111 | * from OPimAccessTemplate | 117 | * from OPimAccessTemplate |
112 | */ | 118 | */ |
113 | template <class T = OPimRecord > | 119 | template <class T = OPimRecord > |
114 | class ORecordList { | 120 | class ORecordList |
115 | public: | 121 | { |
122 | public: | ||
116 | typedef OTemplateBase<T> Base; | 123 | typedef OTemplateBase<T> Base; |
117 | typedef ORecordListIterator<T> Iterator; | 124 | typedef ORecordListIterator<T> Iterator; |
118 | 125 | ||
119 | /** | 126 | /** |
120 | * c'tor | 127 | * c'tor |
121 | */ | 128 | */ |
122 | ORecordList () { | 129 | ORecordList () |
123 | } | 130 | {} |
124 | ORecordList( const QArray<int>& ids, | 131 | ORecordList( const QArray<int>& ids, |
125 | const Base* ); | 132 | const Base* ); |
126 | ~ORecordList(); | 133 | ~ORecordList(); |
127 | 134 | ||
128 | /** | 135 | /** |
129 | * the first iterator | 136 | * the first iterator |
130 | */ | 137 | */ |
131 | Iterator begin(); | 138 | Iterator begin(); |
132 | 139 | ||
133 | /** | 140 | /** |
134 | * the end | 141 | * the end |
135 | */ | 142 | */ |
136 | Iterator end(); | 143 | Iterator end(); |
137 | 144 | ||
138 | /** | 145 | /** |
139 | * the number of items in the list | 146 | * the number of items in the list |
140 | */ | 147 | */ |
141 | uint count()const; | 148 | uint count() const; |
142 | 149 | ||
143 | T operator[]( uint i ); | 150 | T operator[] ( uint i ); |
144 | int uidAt(uint i ); | 151 | int uidAt( uint i ); |
145 | 152 | ||
146 | /** | 153 | /** |
147 | * Remove the contact with given uid | 154 | * Remove the contact with given uid |
148 | */ | 155 | */ |
149 | bool remove( int uid ); | 156 | bool remove( int uid ); |
150 | 157 | ||
151 | /* | 158 | /* |
152 | ConstIterator begin()const; | 159 | ConstIterator begin()const; |
153 | ConstIterator end()const; | 160 | ConstIterator end()const; |
154 | */ | 161 | */ |
155 | private: | 162 | private: |
156 | QArray<int> m_ids; | 163 | QArray<int> m_ids; |
157 | const Base* m_acc; | 164 | const Base* m_acc; |
158 | ORecordListPrivate *d; | 165 | ORecordListPrivate *d; |
159 | }; | 166 | }; |
160 | 167 | ||
168 | |||
161 | /* ok now implement it */ | 169 | /* ok now implement it */ |
162 | template <class T> | 170 | template <class T> |
163 | ORecordListIterator<T>::ORecordListIterator() { | 171 | ORecordListIterator<T>::ORecordListIterator() |
172 | { | ||
164 | m_current = 0; | 173 | m_current = 0; |
165 | m_temp = 0l; | 174 | m_temp = 0l; |
166 | m_end = true; | 175 | m_end = true; |
167 | m_record = T(); | 176 | m_record = T(); |
168 | /* forward */ | 177 | /* forward */ |
169 | m_direction = TRUE; | 178 | m_direction = TRUE; |
170 | } | 179 | } |
180 | |||
181 | |||
171 | template <class T> | 182 | template <class T> |
172 | ORecordListIterator<T>::~ORecordListIterator() { | 183 | ORecordListIterator<T>::~ORecordListIterator() |
173 | /* nothing to delete */ | 184 | { |
185 | /* nothing to delete */ | ||
174 | } | 186 | } |
175 | 187 | ||
188 | |||
176 | template <class T> | 189 | template <class T> |
177 | ORecordListIterator<T>::ORecordListIterator( const ORecordListIterator<T>& it) { | 190 | ORecordListIterator<T>::ORecordListIterator( const ORecordListIterator<T>& it ) |
178 | // qWarning("ORecordListIterator copy c'tor"); | 191 | { |
192 | // qWarning("ORecordListIterator copy c'tor"); | ||
179 | m_uids = it.m_uids; | 193 | m_uids = it.m_uids; |
180 | m_current = it.m_current; | 194 | m_current = it.m_current; |
181 | m_temp = it.m_temp; | 195 | m_temp = it.m_temp; |
182 | m_end = it.m_end; | 196 | m_end = it.m_end; |
183 | m_record = it.m_record; | 197 | m_record = it.m_record; |
184 | m_direction = it.m_direction; | 198 | m_direction = it.m_direction; |
185 | } | 199 | } |
186 | 200 | ||
201 | |||
187 | template <class T> | 202 | template <class T> |
188 | ORecordListIterator<T> &ORecordListIterator<T>::operator=( const ORecordListIterator<T>& it) { | 203 | ORecordListIterator<T> &ORecordListIterator<T>::operator=( const ORecordListIterator<T>& it ) |
204 | { | ||
189 | m_uids = it.m_uids; | 205 | m_uids = it.m_uids; |
190 | m_current = it.m_current; | 206 | m_current = it.m_current; |
191 | m_temp = it.m_temp; | 207 | m_temp = it.m_temp; |
192 | m_end = it.m_end; | 208 | m_end = it.m_end; |
193 | m_record = it.m_record; | 209 | m_record = it.m_record; |
194 | 210 | ||
195 | return *this; | 211 | return *this; |
196 | } | 212 | } |
197 | 213 | ||
214 | |||
198 | template <class T> | 215 | template <class T> |
199 | T ORecordListIterator<T>::operator*() { | 216 | T ORecordListIterator<T>::operator*() |
200 | //qWarning("operator* %d %d", m_current, m_uids[m_current] ); | 217 | { |
201 | if (!m_end ) | 218 | //qWarning("operator* %d %d", m_current, m_uids[m_current] ); |
202 | m_record = m_temp->find( m_uids[m_current], m_uids, m_current, | 219 | if ( !m_end ) |
220 | m_record = m_temp->find( m_uids[ m_current ], m_uids, m_current, | ||
203 | m_direction ? Base::Forward : | 221 | m_direction ? Base::Forward : |
204 | Base::Reverse ); | 222 | Base::Reverse ); |
205 | else | 223 | else |
206 | m_record = T(); | 224 | m_record = T(); |
207 | 225 | ||
208 | return m_record; | 226 | return m_record; |
209 | } | 227 | } |
210 | 228 | ||
229 | |||
211 | template <class T> | 230 | template <class T> |
212 | ORecordListIterator<T> &ORecordListIterator<T>::operator++() { | 231 | ORecordListIterator<T> &ORecordListIterator<T>::operator++() |
232 | { | ||
213 | m_direction = true; | 233 | m_direction = true; |
214 | if (m_current < m_uids.count() ) { | 234 | if ( m_current < m_uids.count() ) |
235 | { | ||
215 | m_end = false; | 236 | m_end = false; |
216 | ++m_current; | 237 | ++m_current; |
217 | }else | 238 | } |
239 | else | ||
218 | m_end = true; | 240 | m_end = true; |
219 | 241 | ||
220 | return *this; | 242 | return *this; |
221 | } | 243 | } |
244 | |||
245 | |||
222 | template <class T> | 246 | template <class T> |
223 | ORecordListIterator<T> &ORecordListIterator<T>::operator--() { | 247 | ORecordListIterator<T> &ORecordListIterator<T>::operator--() |
248 | { | ||
224 | m_direction = false; | 249 | m_direction = false; |
225 | if ( m_current > 0 ) { | 250 | if ( m_current > 0 ) |
251 | { | ||
226 | --m_current; | 252 | --m_current; |
227 | m_end = false; | 253 | m_end = false; |
228 | } else | 254 | } |
255 | else | ||
229 | m_end = true; | 256 | m_end = true; |
230 | 257 | ||
231 | return *this; | 258 | return *this; |
232 | } | 259 | } |
233 | 260 | ||
261 | |||
234 | template <class T> | 262 | template <class T> |
235 | bool ORecordListIterator<T>::operator==( const ORecordListIterator<T>& it ) { | 263 | bool ORecordListIterator<T>::operator==( const ORecordListIterator<T>& it ) |
264 | { | ||
236 | 265 | ||
237 | /* if both are at we're the same.... */ | 266 | /* if both are at we're the same.... */ |
238 | if ( m_end == it.m_end ) return true; | 267 | if ( m_end == it.m_end ) return true; |
239 | 268 | ||
240 | if ( m_uids != it.m_uids ) return false; | 269 | if ( m_uids != it.m_uids ) return false; |
241 | if ( m_current != it.m_current ) return false; | 270 | if ( m_current != it.m_current ) return false; |
242 | if ( m_temp != it.m_temp ) return false; | 271 | if ( m_temp != it.m_temp ) return false; |
243 | 272 | ||
244 | return true; | 273 | return true; |
245 | } | 274 | } |
275 | |||
276 | |||
246 | template <class T> | 277 | template <class T> |
247 | bool ORecordListIterator<T>::operator!=( const ORecordListIterator<T>& it ) { | 278 | bool ORecordListIterator<T>::operator!=( const ORecordListIterator<T>& it ) |
248 | return !(*this == it ); | 279 | { |
280 | return !( *this == it ); | ||
249 | } | 281 | } |
282 | |||
283 | |||
250 | template <class T> | 284 | template <class T> |
251 | ORecordListIterator<T>::ORecordListIterator( const QArray<int> uids, | 285 | ORecordListIterator<T>::ORecordListIterator( const QArray<int> uids, |
252 | const Base* t ) | 286 | const Base* t ) |
253 | : m_uids( uids ), m_current( 0 ), m_temp( t ), m_end( false ), | 287 | : m_uids( uids ), m_current( 0 ), m_temp( t ), m_end( false ), |
254 | m_direction( false ) | 288 | m_direction( false ) |
255 | { | 289 | { |
256 | /* if the list is empty we're already at the end of the list */ | 290 | /* if the list is empty we're already at the end of the list */ |
257 | if (uids.count() == 0 ) | 291 | if ( uids.count() == 0 ) |
258 | m_end = true; | 292 | m_end = true; |
259 | } | 293 | } |
294 | |||
295 | |||
260 | template <class T> | 296 | template <class T> |
261 | uint ORecordListIterator<T>::current()const { | 297 | uint ORecordListIterator<T>::current() const |
298 | { | ||
262 | return m_current; | 299 | return m_current; |
263 | } | 300 | } |
301 | |||
302 | |||
264 | template <class T> | 303 | template <class T> |
265 | void ORecordListIterator<T>::setCurrent( uint cur ) { | 304 | void ORecordListIterator<T>::setCurrent( uint cur ) |
266 | if( cur < m_uids.count() ) { | 305 | { |
267 | m_end = false; | 306 | if ( cur < m_uids.count() ) |
268 | m_current= cur; | 307 | { |
308 | m_end = false; | ||
309 | m_current = cur; | ||
269 | } | 310 | } |
270 | } | 311 | } |
271 | template <class T> | 312 | template <class T> |
272 | uint ORecordListIterator<T>::count()const { | 313 | uint ORecordListIterator<T>::count() const |
314 | { | ||
273 | return m_uids.count(); | 315 | return m_uids.count(); |
274 | } | 316 | } |
317 | |||
318 | |||
275 | template <class T> | 319 | template <class T> |
276 | ORecordList<T>::ORecordList( const QArray<int>& ids, | 320 | ORecordList<T>::ORecordList( const QArray<int>& ids, |
277 | const Base* acc ) | 321 | const Base* acc ) |
278 | : m_ids( ids ), m_acc( acc ) | 322 | : m_ids( ids ), m_acc( acc ) |
279 | { | 323 | {} |
280 | } | 324 | |
325 | |||
281 | template <class T> | 326 | template <class T> |
282 | ORecordList<T>::~ORecordList() { | 327 | ORecordList<T>::~ORecordList() |
283 | /* nothing to do here */ | 328 | { |
329 | /* nothing to do here */ | ||
284 | } | 330 | } |
331 | |||
332 | |||
285 | template <class T> | 333 | template <class T> |
286 | typename ORecordList<T>::Iterator ORecordList<T>::begin() { | 334 | typename ORecordList<T>::Iterator ORecordList<T>::begin() |
335 | { | ||
287 | Iterator it( m_ids, m_acc ); | 336 | Iterator it( m_ids, m_acc ); |
288 | return it; | 337 | return it; |
289 | } | 338 | } |
339 | |||
340 | |||
290 | template <class T> | 341 | template <class T> |
291 | typename ORecordList<T>::Iterator ORecordList<T>::end() { | 342 | typename ORecordList<T>::Iterator ORecordList<T>::end() |
343 | { | ||
292 | Iterator it( m_ids, m_acc ); | 344 | Iterator it( m_ids, m_acc ); |
293 | it.m_end = true; | 345 | it.m_end = true; |
294 | it.m_current = m_ids.count(); | 346 | it.m_current = m_ids.count(); |
295 | 347 | ||
296 | return it; | 348 | return it; |
297 | } | 349 | } |
350 | |||
351 | |||
298 | template <class T> | 352 | template <class T> |
299 | uint ORecordList<T>::count()const { | 353 | uint ORecordList<T>::count() const |
300 | return m_ids.count(); | 354 | { |
355 | return m_ids.count(); | ||
301 | } | 356 | } |
357 | |||
358 | |||
302 | template <class T> | 359 | template <class T> |
303 | T ORecordList<T>::operator[]( uint i ) { | 360 | T ORecordList<T>::operator[] ( uint i ) |
361 | { | ||
304 | if ( i >= m_ids.count() ) | 362 | if ( i >= m_ids.count() ) |
305 | return T(); | 363 | return T(); |
306 | /* forward */ | 364 | /* forward */ |
307 | return m_acc->find( m_ids[i], m_ids, i ); | 365 | return m_acc->find( m_ids[ i ], m_ids, i ); |
308 | } | ||
309 | template <class T> | ||
310 | int ORecordList<T>::uidAt( uint i ) { | ||
311 | return m_ids[i]; | ||
312 | } | 366 | } |
313 | 367 | ||
368 | |||
314 | template <class T> | 369 | template <class T> |
315 | bool ORecordList<T>::remove( int uid ) { | 370 | int ORecordList<T>::uidAt( uint i ) |
316 | QArray<int> copy( m_ids.count() ); | 371 | { |
317 | int counter = 0; | 372 | return m_ids[ i ]; |
318 | bool ret_val = false; | 373 | } |
319 | 374 | ||
320 | for (uint i = 0; i < m_ids.count(); i++){ | ||
321 | if ( m_ids[i] != uid ){ | ||
322 | copy[counter++] = m_ids[i]; | ||
323 | 375 | ||
324 | }else | 376 | template <class T> |
325 | ret_val = true; | 377 | bool ORecordList<T>::remove( int uid ) |
326 | } | 378 | { |
379 | QArray<int> copy( m_ids.count() ); | ||
380 | int counter = 0; | ||
381 | bool ret_val = false; | ||
382 | |||
383 | for ( uint i = 0; i < m_ids.count(); i++ ) | ||
384 | { | ||
385 | if ( m_ids[ i ] != uid ) | ||
386 | { | ||
387 | copy[ counter++ ] = m_ids[ i ]; | ||
388 | |||
389 | } | ||
390 | else | ||
391 | ret_val = true; | ||
392 | } | ||
327 | 393 | ||
328 | copy.resize( counter ); | 394 | copy.resize( counter ); |
329 | m_ids = copy; | 395 | m_ids = copy; |
330 | 396 | ||
331 | 397 | ||
332 | return ret_val; | 398 | return ret_val; |
333 | } | 399 | } |
334 | 400 | ||
335 | } | 401 | } |
336 | #endif | 402 | #endif |