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
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef ARY_SCI_IMPL_HXX
#define ARY_SCI_IMPL_HXX
// USED SERVICES
// BASE CLASSES
#include <ary/stdconstiter.hxx>
// COMPONENTS
// PARAMETERS
namespace ary
{
//************************* SCI_Vector **********************************//
template <class ELEM>
class SCI_Vector : public StdConstIterator<ELEM>
{
public:
typedef std::vector<ELEM> source;
typedef typename source::const_iterator source_iterator;
SCI_Vector(
const source & i_rSource );
virtual ~SCI_Vector();
private:
// Interface StdConstIterator<>:
virtual void do_Advance();
virtual const ELEM *
inq_CurElement() const;
virtual bool inq_IsSorted() const;
// DATA
source_iterator itRun;
source_iterator itEnd;
};
//************************* SCI_Map **********************************//
template <class KEY, class VALUE>
class SCI_Map : public StdConstIterator< typename std::map<KEY,VALUE>::value_type >
{
public:
typedef std::map<KEY,VALUE> source;
typedef typename source::const_iterator source_iterator;
SCI_Map(
const source & i_rSource );
virtual ~SCI_Map();
private:
// Interface StdConstIterator<>:
virtual void do_Advance();
virtual const typename std::map<KEY,VALUE>::value_type *
inq_CurElement() const;
virtual bool inq_IsSorted() const;
// DATA
source_iterator itRun;
source_iterator itEnd;
};
//************************* SCI_MultiMap **********************************//
template <class KEY, class VALUE>
class SCI_MultiMap : public StdConstIterator< typename std::multimap<KEY,VALUE>::value_type >
{
public:
typedef std::multimap<KEY,VALUE> source;
typedef typename source::const_iterator source_iterator;
SCI_MultiMap(
const source & i_rSource );
SCI_MultiMap(
source_iterator i_begin,
source_iterator i_end );
virtual ~SCI_MultiMap();
private:
// Interface StdConstIterator<>:
virtual void do_Advance();
virtual const typename std::multimap<KEY,VALUE>::value_type *
inq_CurElement() const;
virtual bool inq_IsSorted() const;
// DATA
source_iterator itRun;
source_iterator itEnd;
};
//************************* SCI_Set **********************************//
template <class TYPES>
class SCI_Set : public StdConstIterator<typename TYPES::element_type>
{
public:
typedef typename TYPES::element_type element;
typedef typename TYPES::sort_type sorter;
typedef std::set<element, sorter> source;
typedef typename source::const_iterator source_iterator;
SCI_Set(
const source & i_rSource );
virtual ~SCI_Set();
private:
// Interface StdConstIterator<>:
virtual void do_Advance();
virtual const element *
inq_CurElement() const;
virtual bool inq_IsSorted() const;
// DATA
source_iterator itRun;
source_iterator itEnd;
};
//************************* SCI_DataInMap **********************************//
template <class KEY, class VALUE>
class SCI_DataInMap : public StdConstIterator<VALUE>
{
public:
typedef std::map<KEY,VALUE> source;
typedef typename source::const_iterator source_iterator;
SCI_DataInMap(
const source & i_rSource );
virtual ~SCI_DataInMap();
private:
// Interface StdConstIterator<>:
virtual void do_Advance();
virtual const VALUE *
inq_CurElement() const;
virtual bool inq_IsSorted() const;
// DATA
source_iterator itRun;
source_iterator itEnd;
};
//********************************************************************//
// IMPLEMENTATION
template <class ELEM>
SCI_Vector<ELEM>::SCI_Vector( const source & i_rSource )
: itRun(i_rSource.begin()),
itEnd(i_rSource.end())
{
}
template <class ELEM>
SCI_Vector<ELEM>::~SCI_Vector()
{
}
template <class ELEM>
void
SCI_Vector<ELEM>::do_Advance()
{
if (itRun != itEnd)
++itRun;
}
template <class ELEM>
const ELEM *
SCI_Vector<ELEM>::inq_CurElement() const
{
if (itRun != itEnd)
return &(*itRun);
return 0;
}
template <class ELEM>
bool
SCI_Vector<ELEM>::inq_IsSorted() const
{
return false;
}
template <class KEY, class VALUE>
SCI_Map<KEY,VALUE>::SCI_Map( const source & i_rSource )
: itRun(i_rSource.begin()),
itEnd(i_rSource.end())
{
}
template <class KEY, class VALUE>
SCI_Map<KEY,VALUE>::~SCI_Map()
{
}
template <class KEY, class VALUE>
void
SCI_Map<KEY,VALUE>::do_Advance()
{
if (itRun != itEnd)
++itRun;
}
template <class KEY, class VALUE>
const typename std::map<KEY,VALUE>::value_type *
SCI_Map<KEY,VALUE>::inq_CurElement() const
{
if (itRun != itEnd)
return &(*itRun);
return 0;
}
template <class KEY, class VALUE>
bool
SCI_Map<KEY,VALUE>::inq_IsSorted() const
{
return true;
}
template <class KEY, class VALUE>
SCI_MultiMap<KEY,VALUE>::SCI_MultiMap( const source & i_rSource )
: itRun(i_rSource.begin()),
itEnd(i_rSource.end())
{
}
template <class KEY, class VALUE>
SCI_MultiMap<KEY,VALUE>::SCI_MultiMap( source_iterator i_begin,
source_iterator i_end )
: itRun(i_begin),
itEnd(i_end)
{
}
template <class KEY, class VALUE>
SCI_MultiMap<KEY,VALUE>::~SCI_MultiMap()
{
}
template <class KEY, class VALUE>
void
SCI_MultiMap<KEY,VALUE>::do_Advance()
{
if (itRun != itEnd)
++itRun;
}
template <class KEY, class VALUE>
const typename std::multimap<KEY,VALUE>::value_type *
SCI_MultiMap<KEY,VALUE>::inq_CurElement() const
{
if (itRun != itEnd)
return &(*itRun);
return 0;
}
template <class KEY, class VALUE>
bool
SCI_MultiMap<KEY,VALUE>::inq_IsSorted() const
{
return true;
}
template <class ELEM>
SCI_Set<ELEM>::SCI_Set( const source & i_rSource )
: itRun(i_rSource.begin()),
itEnd(i_rSource.end())
{
}
template <class ELEM>
SCI_Set<ELEM>::~SCI_Set()
{
}
template <class ELEM>
void
SCI_Set<ELEM>::do_Advance()
{
if (itRun != itEnd)
++itRun;
}
template <class ELEM>
const typename SCI_Set<ELEM>::element *
SCI_Set<ELEM>::inq_CurElement() const
{
if (itRun != itEnd)
return &(*itRun);
return 0;
}
template <class ELEM>
bool
SCI_Set<ELEM>::inq_IsSorted() const
{
return true;
}
template <class KEY, class VALUE>
SCI_DataInMap<KEY,VALUE>::SCI_DataInMap( const source & i_rSource )
: itRun(i_rSource.begin()),
itEnd(i_rSource.end())
{
}
template <class KEY, class VALUE>
SCI_DataInMap<KEY,VALUE>::~SCI_DataInMap()
{
}
template <class KEY, class VALUE>
void
SCI_DataInMap<KEY,VALUE>::do_Advance()
{
if (itRun != itEnd)
++itRun;
}
template <class KEY, class VALUE>
const VALUE *
SCI_DataInMap<KEY,VALUE>::inq_CurElement() const
{
if (itRun != itEnd)
return &(*itRun).second;
return 0;
}
template <class KEY, class VALUE>
bool
SCI_DataInMap<KEY,VALUE>::inq_IsSorted() const
{
return true;
}
} // namespace ary
#endif
|
