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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef SOLTOOLS_ST_LIST_HXX
#define SOLTOOLS_ST_LIST_HXX
#include <string.h>
#include <iostream>
#include <stdlib.h>
template <class XX>
class ST_List /// Soltools-List.
{
public :
typedef XX * iterator;
typedef const XX * const_iterator;
// LIFECYCLE
ST_List();
ST_List(
const ST_List<XX> & i_rList );
virtual ~ST_List() { delete[] inhalt; }
// OPERATORS
ST_List<XX> & operator=(
const ST_List<XX> & i_rList );
const XX & operator[](
unsigned n) const
{ return elem(n); }
XX & operator[](
unsigned n)
{ return elem(n); }
// OPERATIONS
void reserve(
unsigned i_nSize )
{ alloc(i_nSize,true); }
void insert(
iterator i_aPos,
const XX & elem_ )
{ Insert((unsigned)(i_aPos-begin()), elem_); }
virtual void Insert(
unsigned pos,
const XX & elem );
void push_back(
const XX & elem_)
{ Insert(size(),elem_); }
void remove(
iterator i_aPos )
{ Remove((int)(i_aPos-begin())); }
virtual void Remove(
unsigned pos );
void pop_back() { Remove(size()-1); }
void erase_all() { while (size()) Remove(size()-1); }
// INQUIRY
const_iterator begin() const { return &inhalt[0]; }
const_iterator end() const { return &inhalt[len]; }
const XX & front() const { return elem(0); }
const XX & back() const { return elem(len-1); }
unsigned size() const { return len; }
unsigned space() const { return allocated; }
bool is_valid_index(
unsigned n) const
{ return n < len; }
// ACCESS
iterator begin() { return &inhalt[0]; }
iterator end() { return &inhalt[len]; }
XX & front() { return elem(0); }
XX & back() { return elem(len-1); }
protected:
void checkSize(
unsigned newLength);
void alloc(
unsigned newSpace,
bool re = false );
const XX & elem(
unsigned n ) const
{ return inhalt[n]; }
XX & elem(
unsigned n )
{ return inhalt[n]; }
// DATA
XX * inhalt;
unsigned len;
unsigned allocated;
};
template <class XY>
class DynamicList : public ST_List< XY* >
{
public:
DynamicList();
DynamicList(
const DynamicList<XY> &
i_rList );
virtual ~DynamicList(); /// Deletes all member pointers
DynamicList<XY> & operator=(
const DynamicList<XY> &
i_rList );
virtual void Insert(
unsigned pos,
XY * const & elem );
virtual void Remove(
unsigned pos );
};
template <class XX>
ST_List<XX>::ST_List()
: inhalt(0),
len(0),
allocated(0)
{
alloc(1);
}
template <class XX>
ST_List<XX>::ST_List( const ST_List<XX> & i_rList )
: inhalt(0),
len(0),
allocated(0)
{
alloc(i_rList.size());
for ( const_iterator it = i_rList.begin();
it != i_rList.end();
++it )
{
push_back(*it);
}
}
template <class XX>
ST_List<XX> &
ST_List<XX>::operator=( const ST_List<XX> & i_rList )
{
for ( const_iterator it = i_rList.begin();
it != i_rList.end();
++it )
{
push_back(*it);
}
return *this;
}
template <class XX>
void
ST_List<XX>::Insert(unsigned pos, const XX & elem_)
{
if ( pos > len )
return;
checkSize(len+2);
for ( unsigned p = len; p > pos; --p)
{
inhalt[p] = inhalt[p-1];
}
inhalt[pos] = elem_;
len++;
}
template <class XX>
void
ST_List<XX>::Remove(unsigned pos)
{
if ( pos >= len )
return;
len--;
for ( unsigned p = pos; p < len; ++p)
{
inhalt[p] = inhalt[p+1];
}
}
// Protected:
template <class XX>
void
ST_List<XX>::checkSize(unsigned newLength)
{
// neuen Platzbedarf pruefen:
unsigned newSpace = space();
if (newLength >= newSpace)
{
if (!newSpace)
newSpace = 1;
const unsigned nBorder = 2000000000;
while(newLength >= newSpace)
{
if (newSpace < nBorder)
newSpace <<= 1;
else
{
std::cerr << "List becomes too big" << std::endl;
exit(1);
}
}
}
// Veraenderung ?:
if (newSpace != space())
alloc(newSpace,true);
}
template <class XX>
void
ST_List<XX>::alloc( unsigned newSpace,
bool re )
{
XX * pNew = new XX[newSpace];
if (inhalt != 0)
{
if (re)
{
for (unsigned i = 0; i < len; ++i)
{
pNew[i] = inhalt[i];
} // end for
}
delete [] inhalt;
}
inhalt = pNew;
allocated = newSpace;
}
template <class XY>
DynamicList<XY>::DynamicList()
{
}
template <class XY>
DynamicList<XY>::DynamicList( const DynamicList<XY> & i_rList )
: ST_List< XY* >(i_rList)
{
for ( typename DynamicList<XY>::iterator it = this->begin();
it != DynamicList<XY>::end();
++it )
{
// Copying the contents the pointers point at:
(*it) = new XY( *(*it) );
}
}
template <class XY>
DynamicList<XY>::~DynamicList()
{
this->erase_all();
}
template <class XY>
DynamicList<XY> &
DynamicList<XY>::operator=( const DynamicList<XY> & i_rList )
{
for ( typename DynamicList<XY>::const_iterator it = i_rList.begin();
it != i_rList.end();
++it )
{
this->push_back( new XY(*(*it)) );
}
return *this;
}
template <class XY>
void
DynamicList<XY>::Insert(unsigned pos, XY * const & elem_)
{
if ( pos > this->len )
return;
this->checkSize(DynamicList<XY>::len+2);
memmove( DynamicList<XY>::inhalt+pos+1, DynamicList<XY>::inhalt+pos, (DynamicList<XY>::len-pos) * sizeof(XY*) );
this->inhalt[pos] = elem_;
this->len++;
}
template <class XY>
void
DynamicList<XY>::Remove( unsigned pos )
{
if (!this->is_valid_index(pos) )
return;
this->len--;
delete DynamicList<XY>::inhalt[pos];
memmove(DynamicList<XY>::inhalt+pos, DynamicList<XY>::inhalt+pos+1, (DynamicList<XY>::len-pos) * sizeof(XY*) );
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|