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