1 karl 1.26 //%2005////////////////////////////////////////////////////////////////////////
|
2 mike 1.5 //
|
3 karl 1.25 // Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development
4 // Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems.
5 // Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.;
|
6 karl 1.24 // IBM Corp.; EMC Corporation, The Open Group.
|
7 karl 1.25 // Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.;
8 // IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group.
|
9 karl 1.26 // Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.;
10 // EMC Corporation; VERITAS Software Corporation; The Open Group.
|
11 mike 1.5 //
12 // Permission is hereby granted, free of charge, to any person obtaining a copy
|
13 kumpf 1.14 // of this software and associated documentation files (the "Software"), to
14 // deal in the Software without restriction, including without limitation the
15 // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
16 mike 1.5 // sell copies of the Software, and to permit persons to whom the Software is
17 // furnished to do so, subject to the following conditions:
18 //
|
19 kumpf 1.14 // THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN
|
20 mike 1.5 // ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED
21 // "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
|
22 kumpf 1.14 // LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
23 // PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
24 // HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
|
25 mike 1.5 // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
26 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
27 //
28 //==============================================================================
29 //
30 // Author: Mike Brasher (mbrasher@bmc.com)
31 //
|
32 kumpf 1.10 // Modified By: Roger Kumpf, Hewlett-Packard Company (roger_kumpf@hp.com)
|
33 mike 1.27 // Mike Brasher, Inova Europe (mike-brasher@austin.rr.com)
|
34 mike 1.5 //
35 //%/////////////////////////////////////////////////////////////////////////////
36
|
37 kumpf 1.13 // Only include if not included as general template or if explicit instantiation
38 #if !defined(Pegasus_ArrayImpl_h) || defined(PEGASUS_ARRAY_T)
39 #if !defined(PEGASUS_ARRAY_T)
40 #define Pegasus_ArrayImpl_h
41 #endif
42
43 PEGASUS_NAMESPACE_END
44
45 #include <Pegasus/Common/Memory.h>
46 #include <Pegasus/Common/ArrayRep.h>
|
47 kumpf 1.23 #include <Pegasus/Common/InternalException.h>
|
48 mike 1.27 #include <Pegasus/Common/Linkage.h>
|
49 kumpf 1.13
50 PEGASUS_NAMESPACE_BEGIN
|
51 mike 1.5
|
52 mike 1.27 PEGASUS_COMMON_LINKAGE void ArrayThrowIndexOutOfBoundsException();
53
|
54 mike 1.5 #ifndef PEGASUS_ARRAY_T
55 template<class PEGASUS_ARRAY_T>
56 #endif
57 Array<PEGASUS_ARRAY_T>::Array()
58 {
|
59 mike 1.27 _rep = &ArrayRepBase::_empty_rep;
|
60 mike 1.5 }
61
62 #ifndef PEGASUS_ARRAY_T
63 template<class PEGASUS_ARRAY_T>
64 #endif
65 Array<PEGASUS_ARRAY_T>::Array(const Array<PEGASUS_ARRAY_T>& x)
66 {
|
67 mike 1.27 _rep = x._rep;
68 ArrayRep<PEGASUS_ARRAY_T>::ref(Array_rep);
|
69 mike 1.5 }
70
71 #ifndef PEGASUS_ARRAY_T
72 template<class PEGASUS_ARRAY_T>
73 #endif
74 Array<PEGASUS_ARRAY_T>::Array(Uint32 size)
75 {
|
76 mike 1.27 Array_rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size);
|
77 kumpf 1.23
|
78 mike 1.27 if (!_rep)
|
79 kumpf 1.23 throw NullPointer();
80
|
81 mike 1.27 InitializeRaw(Array_data, size);
|
82 mike 1.5 }
83
84 #ifndef PEGASUS_ARRAY_T
85 template<class PEGASUS_ARRAY_T>
86 #endif
87 Array<PEGASUS_ARRAY_T>::Array(Uint32 size, const PEGASUS_ARRAY_T& x)
88 {
|
89 mike 1.27 _rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size);
|
90 mike 1.5
|
91 mike 1.27 if (!_rep)
|
92 kumpf 1.23 throw NullPointer();
93
|
94 mike 1.27 PEGASUS_ARRAY_T* data = Array_data;
95
96 // Note: we could use template specialization (by adding functions to
97 // Memory.h) so that this loop becomes a memset() for single byte raw
98 // types, but this function is rarely called.
|
99 mike 1.5
100 while (size--)
|
101 kumpf 1.13 new(data++) PEGASUS_ARRAY_T(x);
|
102 mike 1.5 }
103
104 #ifndef PEGASUS_ARRAY_T
105 template<class PEGASUS_ARRAY_T>
106 #endif
107 Array<PEGASUS_ARRAY_T>::Array(const PEGASUS_ARRAY_T* items, Uint32 size)
108 {
|
109 mike 1.27 _rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size);
|
110 kumpf 1.23
|
111 mike 1.27 if (!_rep)
|
112 kumpf 1.23 throw NullPointer();
113
|
114 mike 1.27 CopyToRaw(Array_data, items, size);
|
115 mike 1.5 }
116
117 #ifndef PEGASUS_ARRAY_T
118 template<class PEGASUS_ARRAY_T>
119 #endif
120 Array<PEGASUS_ARRAY_T>::~Array()
121 {
|
122 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
|
123 mike 1.5 }
124
125 #ifndef PEGASUS_ARRAY_T
126 template<class PEGASUS_ARRAY_T>
127 #endif
128 Array<PEGASUS_ARRAY_T>& Array<PEGASUS_ARRAY_T>::operator=(
129 const Array<PEGASUS_ARRAY_T>& x)
130 {
|
131 mike 1.27 if (x._rep != Array_rep)
|
132 mike 1.5 {
|
133 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
134 ArrayRep<PEGASUS_ARRAY_T>::ref(Array_rep = x._rep);
|
135 mike 1.5 }
|
136 mike 1.27
|
137 mike 1.5 return *this;
138 }
139
140 #ifndef PEGASUS_ARRAY_T
141 template<class PEGASUS_ARRAY_T>
142 #endif
143 void Array<PEGASUS_ARRAY_T>::clear()
144 {
|
145 mike 1.27 if (Array_size)
146 {
147 if (Array_refs.get() == 1)
148 Array_size = 0;
149 else
150 {
151 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
152 _rep = &ArrayRepBase::_empty_rep;
153 }
154 }
|
155 mike 1.5 }
156
157 #ifndef PEGASUS_ARRAY_T
158 template<class PEGASUS_ARRAY_T>
159 #endif
|
160 kumpf 1.18 void Array<PEGASUS_ARRAY_T>::reserveCapacity(Uint32 capacity)
|
161 mike 1.5 {
|
162 mike 1.27 if (capacity > Array_capacity || Array_refs.get() != 1)
|
163 kumpf 1.10 {
|
164 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>* rep =
165 ArrayRep<PEGASUS_ARRAY_T>::alloc(capacity);
166
167 if (!rep)
168 return;
169
170 rep->size = Array_size;
171
172 if (Array_refs.get() == 1)
173 {
174 memcpy(rep->data(), Array_data, Array_size*sizeof(PEGASUS_ARRAY_T));
175 Array_size = 0;
176 }
177 else
178 CopyToRaw(rep->data(), Array_data, Array_size);
179
180 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
181 _rep = rep;
|
182 mike 1.5 }
183 }
184
185 #ifndef PEGASUS_ARRAY_T
186 template<class PEGASUS_ARRAY_T>
187 #endif
188 void Array<PEGASUS_ARRAY_T>::grow(Uint32 size, const PEGASUS_ARRAY_T& x)
189 {
|
190 mike 1.27 reserveCapacity(Array_size + size);
191 PEGASUS_ARRAY_T* p = Array_data + Array_size;
|
192 mike 1.5 Uint32 n = size;
193
194 while (n--)
|
195 kumpf 1.13 new(p++) PEGASUS_ARRAY_T(x);
|
196 mike 1.5
|
197 mike 1.27 Array_size += size;
|
198 mike 1.5 }
199
200 #ifndef PEGASUS_ARRAY_T
201 template<class PEGASUS_ARRAY_T>
202 #endif
203 void Array<PEGASUS_ARRAY_T>::swap(Array<PEGASUS_ARRAY_T>& x)
204 {
|
205 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>* tmp = Array_rep;
206 Array_rep = x._rep;
|
207 mike 1.5 x._rep = tmp;
208 }
209
210 #ifndef PEGASUS_ARRAY_T
211 template<class PEGASUS_ARRAY_T>
212 #endif
|
213 mike 1.27 void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T& x)
|
214 kumpf 1.10 {
|
215 mike 1.27 Uint32 n = Array_size + 1;
216
217 if (n > Array_capacity || Array_refs.get() != 1)
218 reserveCapacity(n);
219
220 new (Array_data + Array_size) PEGASUS_ARRAY_T(x);
221 Array_size++;
|
222 kumpf 1.10 }
223
224 #ifndef PEGASUS_ARRAY_T
225 template<class PEGASUS_ARRAY_T>
226 #endif
|
227 mike 1.27 void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T* x, Uint32 size)
|
228 kumpf 1.10 {
|
229 mike 1.27 Uint32 n = Array_size + size;
230 reserveCapacity(n);
231 CopyToRaw(Array_data + Array_size, x, size);
232 Array_size = n;
|
233 kumpf 1.10 }
234
235 #ifndef PEGASUS_ARRAY_T
236 template<class PEGASUS_ARRAY_T>
237 #endif
|
238 mike 1.27 void Array<PEGASUS_ARRAY_T>::appendArray(const Array<PEGASUS_ARRAY_T>& x)
|
239 kumpf 1.10 {
|
240 mike 1.27 append(x.getData(), x.size());
|
241 kumpf 1.13 }
242
243 #ifndef PEGASUS_ARRAY_T
244 template<class PEGASUS_ARRAY_T>
245 #endif
|
246 mike 1.27 void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T& x)
|
247 kumpf 1.13 {
|
248 mike 1.27 prepend(&x, 1);
|
249 kumpf 1.13 }
250
251 #ifndef PEGASUS_ARRAY_T
252 template<class PEGASUS_ARRAY_T>
253 #endif
|
254 mike 1.27 void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T* x, Uint32 size)
|
255 kumpf 1.13 {
|
256 mike 1.27 reserveCapacity(Array_size + size);
257 memmove(
258 Array_data + size,
259 Array_data,
260 sizeof(PEGASUS_ARRAY_T) * Array_size);
261 CopyToRaw(Array_data, x, size);
262 Array_size += size;
|
263 kumpf 1.10 }
264
265 #ifndef PEGASUS_ARRAY_T
266 template<class PEGASUS_ARRAY_T>
267 #endif
|
268 mike 1.27 void Array<PEGASUS_ARRAY_T>::insert(Uint32 index, const PEGASUS_ARRAY_T& x)
|
269 mike 1.5 {
|
270 mike 1.27 insert(index, &x, 1);
|
271 mike 1.5 }
272
273 #ifndef PEGASUS_ARRAY_T
274 template<class PEGASUS_ARRAY_T>
275 #endif
|
276 mike 1.27 void Array<PEGASUS_ARRAY_T>::insert(
277 Uint32 index, const PEGASUS_ARRAY_T* x, Uint32 size)
|
278 mike 1.5 {
|
279 mike 1.27 if (index > Array_size)
280 throw IndexOutOfBoundsException();
281
282 reserveCapacity(Array_size + size);
283
284 Uint32 n = Array_size - index;
285
286 if (n)
287 {
288 memmove(
289 Array_data + index + size,
290 Array_data + index,
291 sizeof(PEGASUS_ARRAY_T) * n);
292 }
293
294 CopyToRaw(Array_data + index, x, size);
295 Array_size += size;
|
296 mike 1.5 }
297
298 #ifndef PEGASUS_ARRAY_T
299 template<class PEGASUS_ARRAY_T>
300 #endif
|
301 mike 1.27 void Array<PEGASUS_ARRAY_T>::remove(Uint32 index)
|
302 kumpf 1.10 {
|
303 mike 1.27 remove(index, 1);
|
304 kumpf 1.10 }
305
306 #ifndef PEGASUS_ARRAY_T
307 template<class PEGASUS_ARRAY_T>
308 #endif
|
309 mike 1.27 void Array<PEGASUS_ARRAY_T>::remove(Uint32 index, Uint32 size)
|
310 mike 1.5 {
|
311 mike 1.27 if (Array_refs.get() != 1)
312 Array_rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep);
313
314 // Case 1: attempting to remove last element (this is an optimization
315 // for when the array is used as a stack; see Stack class).
316
317 if (index + 1 == Array_size)
318 {
319 Destroy(Array_data + index, 1);
320 Array_size--;
321 return;
322 }
323
324 // Case 2: not attempting to remove last element:
325
326 if (index + size - 1 > Array_size)
327 throw IndexOutOfBoundsException();
328
329 Destroy(Array_data + index, size);
330 Uint32 rem = Array_size - (index + size);
331
332 mike 1.27 if (rem)
333 {
334 memmove(
335 Array_data + index,
336 Array_data + index + size,
337 sizeof(PEGASUS_ARRAY_T) * rem);
338 }
339
340 Array_size -= size;
|
341 mike 1.5 }
342
343 #ifndef PEGASUS_ARRAY_T
344 template<class PEGASUS_ARRAY_T>
345 #endif
|
346 mike 1.27 Uint32 Array<PEGASUS_ARRAY_T>::size() const
|
347 mike 1.5 {
|
348 mike 1.27 return Array_size;
|
349 mike 1.5 }
350
351 #ifndef PEGASUS_ARRAY_T
352 template<class PEGASUS_ARRAY_T>
353 #endif
|
354 mike 1.27 PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](
355 Uint32 index)
|
356 mike 1.5 {
|
357 mike 1.27 #ifndef PEGASUS_ARRAY_NO_THROW
358 if (index >= Array_size)
359 ArrayThrowIndexOutOfBoundsException();
360 #endif
361
362 if (Array_refs.get() != 1)
363 Array_rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep);
364
365 return Array_data[index];
|
366 mike 1.5 }
367
368 #ifndef PEGASUS_ARRAY_T
369 template<class PEGASUS_ARRAY_T>
370 #endif
|
371 mike 1.27 const PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](
372 Uint32 index) const
|
373 mike 1.5 {
|
374 mike 1.27 #ifndef PEGASUS_ARRAY_NO_THROW
375 if (index >= Array_size)
376 ArrayThrowIndexOutOfBoundsException();
377 #endif
|
378 mike 1.5
|
379 mike 1.27 return Array_data[index];
|
380 mike 1.5 }
381
382 #ifndef PEGASUS_ARRAY_T
383 template<class PEGASUS_ARRAY_T>
384 #endif
|
385 mike 1.27 Uint32 Array<PEGASUS_ARRAY_T>::getCapacity() const
|
386 mike 1.5 {
|
387 mike 1.27 return Array_capacity;
|
388 mike 1.5 }
389
390 #ifndef PEGASUS_ARRAY_T
391 template<class PEGASUS_ARRAY_T>
392 #endif
|
393 mike 1.27 const PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::getData() const
|
394 mike 1.5 {
|
395 mike 1.27 return Array_data;
|
396 mike 1.5 }
|
397 kumpf 1.10
398 #ifndef PEGASUS_ARRAY_T
399 template<class PEGASUS_ARRAY_T>
400 #endif
401 PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::_data() const
402 {
|
403 mike 1.27 return Array_data;
|
404 kumpf 1.10 }
|
405 mike 1.6
|
406 kumpf 1.13 #endif //!defined(Pegasus_ArrayImpl_h) || !defined(PEGASUS_ARRAY_T)
|
Return to
ArrayImpl.h
CVS log
Up to [Pegasus] / pegasus / src / Pegasus / Common