blob: 4d05240bbf85ff0a43e86eaa0645f2d5223d400e (
plain)
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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: swelist.hxx,v $
* $Revision: 1.3 $
*
* 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 CSV_SWELIST_HXX
#define CSV_SWELIST_HXX
// USED SERVICES
// BASE CLASSES
// COMPONENTS
// PARAMETERS
#include <cosv/tpl/dyn.hxx>
namespace csv
{
template <class XX>
class SweListElement
{
public:
typedef SweListElement<XX> self;
SweListElement(
const XX & in_aObj )
: aObj(in_aObj), pNext(0) {}
const XX & Obj() const { return aObj; }
XX & Obj() { return aObj; }
self * Next() const { return pNext; }
void SetNext(
self * i_pNext )
{ pNext = i_pNext; }
private:
XX aObj;
self * pNext;
};
template <class XX> class SweListIterator;
template <class XX> class SweListCIterator;
template <class XX>
class SweList
{
public:
// TYPES
typedef SweList<XX> self;
typedef XX value_type;
typedef SweListIterator<XX> iterator;
typedef SweListCIterator<XX> const_iterator;
private:
typedef SweListElement<XX> elem;
public:
// LIFECYCLE
SweList() : pTop(0), pTail(0) {}
~SweList() { erase_all(); }
// OPERATIONS
void push_front(
const XX & i_aObj );
void pop_front();
void push_back(
const XX & i_aObj );
void erase_all();
// INQUIRY
const_iterator begin() const { return pTop; }
iterator begin() { return pTop; }
const_iterator end() const { return (elem*)0; }
iterator end() { return (elem*)0; }
const XX & front() const { return pTop->Obj(); }
XX & front() { return pTop->Obj(); }
const XX & back() const { return pTail->Obj(); }
XX & back() { return pTail->Obj(); }
bool empty() const { return pTop == 0; }
uintt size() const;
private:
// Forbiddden methods.
SweList(
const self & i_rList );
self & operator=(
const self & i_rList );
// DATA
DYN elem * pTop;
elem * pTail;
};
template <class XX>
class SweList_dyn
{
public:
// TYPES
typedef SweList_dyn<XX> self;
typedef SweListElement< XX* > elem;
typedef SweListIterator< XX* > iterator;
// LIFECYCLE
SweList_dyn() : pTop(0), pTail(0) {}
~SweList_dyn() { erase_all(); }
// OPERATIONS
void push_front(
XX * i_pObj );
void push_back(
XX * i_pObj );
void pop_front();
void erase_all();
// INQUIRY
iterator begin() const { return pTop; }
iterator end() const { return (elem*)0; }
XX * front() const { return pTop->Obj(); }
XX * back() const { return pTail->Obj(); }
bool empty() const { return pTop == 0; }
uintt size() const;
private:
// Forbiddden methods.
SweList_dyn(
const self & i_rList );
self & operator=(
const self & i_rList );
DYN elem * pTop;
elem * pTail;
};
template<class XX>
class SweListIterator
{
public:
typedef SweListIterator<XX> self;
typedef SweListElement<XX> elem;
SweListIterator(
elem * i_pElem = 0)
: pElem(i_pElem) { }
// OPERATORS
XX & operator*() const { return pElem->Obj(); }
self & operator++() { if (pElem != 0) pElem = pElem->Next();
return *this; }
bool operator==(
const self & i_rIter ) const
{ return pElem == i_rIter.pElem; }
bool operator!=(
const self & i_rIter ) const
{ return pElem != i_rIter.pElem; }
private:
friend class SweListCIterator<XX>;
elem * pElem;
};
template<class XX>
class SweListCIterator
{
public:
typedef SweListCIterator<XX> self;
typedef SweListElement<XX> elem;
SweListCIterator(
const elem * i_pElem = 0)
: pElem(i_pElem) { }
// OPERATORS
self & operator=(
const SweListIterator<XX> &
i_rIter )
{ pElem = i_rIter.pElem; return *this; }
const XX & operator*() const { return pElem->Obj(); }
self & operator++() { if (pElem != 0) pElem = pElem->Next();
return *this; }
bool operator==(
const self & i_rIter ) const
{ return pElem == i_rIter.pElem; }
bool operator!=(
const self & i_rIter ) const
{ return pElem != i_rIter.pElem; }
private:
const elem * pElem;
};
// Implementierung
template <class XX>
void
SweList<XX>::push_front( const XX & i_aObj )
{
DYN elem * dpNew = new elem(i_aObj);
dpNew->SetNext(pTop);
pTop = dpNew;
if (pTail == 0)
pTail = pTop;
}
template <class XX>
void
SweList<XX>::push_back( const XX & i_aObj)
{
if (pTail != 0)
{
pTail->SetNext(new elem(i_aObj));
pTail = pTail->Next();
}
else
{
pTop = pTail = new elem(i_aObj);
}
}
template <class XX>
void
SweList<XX>::pop_front()
{
if (pTop != 0)
{
elem * pDel = pTop;
pTop = pTop->Next();
delete pDel;
if (pTop == 0)
pTail = 0;
}
}
template <class XX>
uintt
SweList<XX>::size() const
{
uintt ret = 0;
for ( const_iterator iter = begin();
iter != end();
++iter )
{
++ret;
}
return ret;
}
template <class XX>
void
SweList<XX>::erase_all()
{
for (pTail = pTop ; pTop != 0; pTail = pTop)
{
pTop = pTop->Next();
delete pTail;
}
pTop = pTail = 0;
}
template <class XX>
void
SweList_dyn<XX>::push_front( XX * i_pObj )
{
DYN elem * dpNew = new elem(i_pObj);
dpNew->SetNext(pTop);
pTop = dpNew;
if (pTail == 0)
pTail = pTop;
}
template <class XX>
void
SweList_dyn<XX>::push_back( XX * i_pObj )
{
if (pTail != 0)
{
pTail->SetNext(new elem(i_pObj));
pTail = pTail->Next();
}
else
{
pTop = pTail = new elem(i_pObj);
}
}
template <class XX>
void
SweList_dyn<XX>::pop_front()
{
if (pTop != 0)
{
elem * pDel = pTop;
pTop = pTop->Next();
if (pDel->Obj() != 0)
Delete_dyn(pDel->Obj());
delete pDel;
if (pTop == 0)
pTail = 0;
}
}
template <class XX>
void
SweList_dyn<XX>::erase_all()
{
for (pTail = pTop ; pTop != 0; pTail = pTop)
{
pTop = pTop->Next();
if (pTail->Obj() != 0)
{
delete pTail->Obj();
}
delete pTail;
}
pTop = pTail = 0;
}
template <class XX>
uintt
SweList_dyn<XX>::size() const
{
uintt ret = 0;
for ( iterator iter = begin();
iter != end();
++iter )
{
++ret;
}
return ret;
}
} // namespace csv
#endif
|