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.28 _rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size);
|
77 kumpf 1.23
|
78 mike 1.27 if (!_rep)
|
79 mike 1.29 {
|
80 kumpf 1.23 throw NullPointer();
|
81 mike 1.29 }
|
82 kumpf 1.23
|
83 mike 1.27 InitializeRaw(Array_data, size);
|
84 mike 1.5 }
85
86 #ifndef PEGASUS_ARRAY_T
87 template<class PEGASUS_ARRAY_T>
88 #endif
89 Array<PEGASUS_ARRAY_T>::Array(Uint32 size, const PEGASUS_ARRAY_T& x)
90 {
|
91 mike 1.27 _rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size);
|
92 mike 1.5
|
93 mike 1.27 if (!_rep)
|
94 mike 1.29 {
|
95 kumpf 1.23 throw NullPointer();
|
96 mike 1.29 }
|
97 kumpf 1.23
|
98 mike 1.27 PEGASUS_ARRAY_T* data = Array_data;
99
100 // Note: we could use template specialization (by adding functions to
101 // Memory.h) so that this loop becomes a memset() for single byte raw
102 // types, but this function is rarely called.
|
103 mike 1.5
104 while (size--)
|
105 kumpf 1.13 new(data++) PEGASUS_ARRAY_T(x);
|
106 mike 1.5 }
107
108 #ifndef PEGASUS_ARRAY_T
109 template<class PEGASUS_ARRAY_T>
110 #endif
111 Array<PEGASUS_ARRAY_T>::Array(const PEGASUS_ARRAY_T* items, Uint32 size)
112 {
|
113 mike 1.27 _rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size);
|
114 kumpf 1.23
|
115 mike 1.27 if (!_rep)
|
116 mike 1.29 {
|
117 kumpf 1.23 throw NullPointer();
|
118 mike 1.29 }
|
119 kumpf 1.23
|
120 mike 1.27 CopyToRaw(Array_data, items, size);
|
121 mike 1.5 }
122
123 #ifndef PEGASUS_ARRAY_T
124 template<class PEGASUS_ARRAY_T>
125 #endif
126 Array<PEGASUS_ARRAY_T>::~Array()
127 {
|
128 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
|
129 mike 1.5 }
130
131 #ifndef PEGASUS_ARRAY_T
132 template<class PEGASUS_ARRAY_T>
133 #endif
134 Array<PEGASUS_ARRAY_T>& Array<PEGASUS_ARRAY_T>::operator=(
135 const Array<PEGASUS_ARRAY_T>& x)
136 {
|
137 mike 1.27 if (x._rep != Array_rep)
|
138 mike 1.5 {
|
139 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
|
140 mike 1.28 _rep = x._rep;
141 ArrayRep<PEGASUS_ARRAY_T>::ref(Array_rep);
|
142 mike 1.5 }
|
143 mike 1.27
|
144 mike 1.5 return *this;
145 }
146
147 #ifndef PEGASUS_ARRAY_T
148 template<class PEGASUS_ARRAY_T>
149 #endif
150 void Array<PEGASUS_ARRAY_T>::clear()
151 {
|
152 mike 1.27 if (Array_size)
153 {
154 if (Array_refs.get() == 1)
|
155 mike 1.29 {
156 Destroy(Array_data, Array_size);
|
157 mike 1.27 Array_size = 0;
|
158 mike 1.29 }
|
159 mike 1.27 else
160 {
161 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
162 _rep = &ArrayRepBase::_empty_rep;
163 }
164 }
|
165 mike 1.5 }
166
167 #ifndef PEGASUS_ARRAY_T
168 template<class PEGASUS_ARRAY_T>
169 #endif
|
170 kumpf 1.18 void Array<PEGASUS_ARRAY_T>::reserveCapacity(Uint32 capacity)
|
171 mike 1.5 {
|
172 mike 1.27 if (capacity > Array_capacity || Array_refs.get() != 1)
|
173 kumpf 1.10 {
|
174 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>* rep =
175 ArrayRep<PEGASUS_ARRAY_T>::alloc(capacity);
176
177 if (!rep)
178 return;
179
180 rep->size = Array_size;
181
182 if (Array_refs.get() == 1)
183 {
184 memcpy(rep->data(), Array_data, Array_size*sizeof(PEGASUS_ARRAY_T));
185 Array_size = 0;
186 }
187 else
188 CopyToRaw(rep->data(), Array_data, Array_size);
189
190 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
191 _rep = rep;
|
192 mike 1.5 }
193 }
194
195 #ifndef PEGASUS_ARRAY_T
196 template<class PEGASUS_ARRAY_T>
197 #endif
198 void Array<PEGASUS_ARRAY_T>::grow(Uint32 size, const PEGASUS_ARRAY_T& x)
199 {
|
200 mike 1.27 reserveCapacity(Array_size + size);
201 PEGASUS_ARRAY_T* p = Array_data + Array_size;
|
202 mike 1.5 Uint32 n = size;
203
204 while (n--)
|
205 kumpf 1.13 new(p++) PEGASUS_ARRAY_T(x);
|
206 mike 1.5
|
207 mike 1.27 Array_size += size;
|
208 mike 1.5 }
209
210 #ifndef PEGASUS_ARRAY_T
211 template<class PEGASUS_ARRAY_T>
212 #endif
213 void Array<PEGASUS_ARRAY_T>::swap(Array<PEGASUS_ARRAY_T>& x)
214 {
|
215 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>* tmp = Array_rep;
|
216 mike 1.28 _rep = x._rep;
|
217 mike 1.5 x._rep = tmp;
218 }
219
220 #ifndef PEGASUS_ARRAY_T
221 template<class PEGASUS_ARRAY_T>
222 #endif
|
223 mike 1.27 void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T& x)
|
224 kumpf 1.10 {
|
225 mike 1.27 Uint32 n = Array_size + 1;
226
227 if (n > Array_capacity || Array_refs.get() != 1)
228 reserveCapacity(n);
229
230 new (Array_data + Array_size) PEGASUS_ARRAY_T(x);
231 Array_size++;
|
232 kumpf 1.10 }
233
234 #ifndef PEGASUS_ARRAY_T
235 template<class PEGASUS_ARRAY_T>
236 #endif
|
237 mike 1.27 void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T* x, Uint32 size)
|
238 kumpf 1.10 {
|
239 mike 1.27 Uint32 n = Array_size + size;
240 reserveCapacity(n);
241 CopyToRaw(Array_data + Array_size, x, size);
242 Array_size = n;
|
243 kumpf 1.10 }
244
245 #ifndef PEGASUS_ARRAY_T
246 template<class PEGASUS_ARRAY_T>
247 #endif
|
248 mike 1.27 void Array<PEGASUS_ARRAY_T>::appendArray(const Array<PEGASUS_ARRAY_T>& x)
|
249 kumpf 1.10 {
|
250 mike 1.27 append(x.getData(), x.size());
|
251 kumpf 1.13 }
252
253 #ifndef PEGASUS_ARRAY_T
254 template<class PEGASUS_ARRAY_T>
255 #endif
|
256 mike 1.27 void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T& x)
|
257 kumpf 1.13 {
|
258 mike 1.27 prepend(&x, 1);
|
259 kumpf 1.13 }
260
261 #ifndef PEGASUS_ARRAY_T
262 template<class PEGASUS_ARRAY_T>
263 #endif
|
264 mike 1.27 void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T* x, Uint32 size)
|
265 kumpf 1.13 {
|
266 mike 1.27 reserveCapacity(Array_size + size);
267 memmove(
268 Array_data + size,
269 Array_data,
270 sizeof(PEGASUS_ARRAY_T) * Array_size);
271 CopyToRaw(Array_data, x, size);
272 Array_size += size;
|
273 kumpf 1.10 }
274
275 #ifndef PEGASUS_ARRAY_T
276 template<class PEGASUS_ARRAY_T>
277 #endif
|
278 mike 1.27 void Array<PEGASUS_ARRAY_T>::insert(Uint32 index, const PEGASUS_ARRAY_T& x)
|
279 mike 1.5 {
|
280 mike 1.27 insert(index, &x, 1);
|
281 mike 1.5 }
282
283 #ifndef PEGASUS_ARRAY_T
284 template<class PEGASUS_ARRAY_T>
285 #endif
|
286 mike 1.27 void Array<PEGASUS_ARRAY_T>::insert(
287 Uint32 index, const PEGASUS_ARRAY_T* x, Uint32 size)
|
288 mike 1.5 {
|
289 mike 1.27 if (index > Array_size)
|
290 mike 1.29 {
|
291 mike 1.27 throw IndexOutOfBoundsException();
|
292 mike 1.29 }
|
293 mike 1.27
294 reserveCapacity(Array_size + size);
295
296 Uint32 n = Array_size - index;
297
298 if (n)
299 {
300 memmove(
301 Array_data + index + size,
302 Array_data + index,
303 sizeof(PEGASUS_ARRAY_T) * n);
304 }
305
306 CopyToRaw(Array_data + index, x, size);
307 Array_size += size;
|
308 mike 1.5 }
309
310 #ifndef PEGASUS_ARRAY_T
311 template<class PEGASUS_ARRAY_T>
312 #endif
|
313 mike 1.27 void Array<PEGASUS_ARRAY_T>::remove(Uint32 index)
|
314 kumpf 1.10 {
|
315 mike 1.27 remove(index, 1);
|
316 kumpf 1.10 }
317
318 #ifndef PEGASUS_ARRAY_T
319 template<class PEGASUS_ARRAY_T>
320 #endif
|
321 mike 1.27 void Array<PEGASUS_ARRAY_T>::remove(Uint32 index, Uint32 size)
|
322 mike 1.5 {
|
323 mike 1.27 if (Array_refs.get() != 1)
|
324 mike 1.28 _rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep);
|
325 mike 1.27
326 // Case 1: attempting to remove last element (this is an optimization
327 // for when the array is used as a stack; see Stack class).
328
329 if (index + 1 == Array_size)
330 {
331 Destroy(Array_data + index, 1);
332 Array_size--;
333 return;
334 }
335
336 // Case 2: not attempting to remove last element:
337
338 if (index + size - 1 > Array_size)
|
339 mike 1.29 {
|
340 mike 1.27 throw IndexOutOfBoundsException();
|
341 mike 1.29 }
|
342 mike 1.27
343 Destroy(Array_data + index, size);
344 Uint32 rem = Array_size - (index + size);
345
346 if (rem)
347 {
348 memmove(
349 Array_data + index,
350 Array_data + index + size,
351 sizeof(PEGASUS_ARRAY_T) * rem);
352 }
353
354 Array_size -= size;
|
355 mike 1.5 }
356
357 #ifndef PEGASUS_ARRAY_T
358 template<class PEGASUS_ARRAY_T>
359 #endif
|
360 mike 1.27 Uint32 Array<PEGASUS_ARRAY_T>::size() const
|
361 mike 1.5 {
|
362 mike 1.27 return Array_size;
|
363 mike 1.5 }
364
365 #ifndef PEGASUS_ARRAY_T
366 template<class PEGASUS_ARRAY_T>
367 #endif
|
368 mike 1.27 PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](
369 Uint32 index)
|
370 mike 1.5 {
|
371 mike 1.27 #ifndef PEGASUS_ARRAY_NO_THROW
372 if (index >= Array_size)
373 ArrayThrowIndexOutOfBoundsException();
374 #endif
375
376 if (Array_refs.get() != 1)
|
377 mike 1.28 _rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep);
|
378 mike 1.27
379 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 const PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](
386 Uint32 index) const
|
387 mike 1.5 {
|
388 mike 1.27 #ifndef PEGASUS_ARRAY_NO_THROW
389 if (index >= Array_size)
390 ArrayThrowIndexOutOfBoundsException();
391 #endif
|
392 mike 1.5
|
393 mike 1.27 return Array_data[index];
|
394 mike 1.5 }
395
396 #ifndef PEGASUS_ARRAY_T
397 template<class PEGASUS_ARRAY_T>
398 #endif
|
399 mike 1.27 Uint32 Array<PEGASUS_ARRAY_T>::getCapacity() const
|
400 mike 1.5 {
|
401 mike 1.27 return Array_capacity;
|
402 mike 1.5 }
403
404 #ifndef PEGASUS_ARRAY_T
405 template<class PEGASUS_ARRAY_T>
406 #endif
|
407 mike 1.27 const PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::getData() const
|
408 mike 1.5 {
|
409 mike 1.27 return Array_data;
|
410 mike 1.5 }
|
411 kumpf 1.10
412 #ifndef PEGASUS_ARRAY_T
413 template<class PEGASUS_ARRAY_T>
414 #endif
415 PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::_data() const
416 {
|
417 mike 1.27 return Array_data;
|
418 kumpf 1.10 }
|
419 mike 1.6
|
420 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