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