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 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 mike 1.28 _rep = x._rep;
135 ArrayRep<PEGASUS_ARRAY_T>::ref(Array_rep);
|
136 mike 1.5 }
|
137 mike 1.27
|
138 mike 1.5 return *this;
139 }
140
141 #ifndef PEGASUS_ARRAY_T
142 template<class PEGASUS_ARRAY_T>
143 #endif
144 void Array<PEGASUS_ARRAY_T>::clear()
145 {
|
146 mike 1.27 if (Array_size)
147 {
148 if (Array_refs.get() == 1)
149 Array_size = 0;
150 else
151 {
152 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
153 _rep = &ArrayRepBase::_empty_rep;
154 }
155 }
|
156 mike 1.5 }
157
158 #ifndef PEGASUS_ARRAY_T
159 template<class PEGASUS_ARRAY_T>
160 #endif
|
161 kumpf 1.18 void Array<PEGASUS_ARRAY_T>::reserveCapacity(Uint32 capacity)
|
162 mike 1.5 {
|
163 mike 1.27 if (capacity > Array_capacity || Array_refs.get() != 1)
|
164 kumpf 1.10 {
|
165 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>* rep =
166 ArrayRep<PEGASUS_ARRAY_T>::alloc(capacity);
167
168 if (!rep)
169 return;
170
171 rep->size = Array_size;
172
173 if (Array_refs.get() == 1)
174 {
175 memcpy(rep->data(), Array_data, Array_size*sizeof(PEGASUS_ARRAY_T));
176 Array_size = 0;
177 }
178 else
179 CopyToRaw(rep->data(), Array_data, Array_size);
180
181 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
182 _rep = rep;
|
183 mike 1.5 }
184 }
185
186 #ifndef PEGASUS_ARRAY_T
187 template<class PEGASUS_ARRAY_T>
188 #endif
189 void Array<PEGASUS_ARRAY_T>::grow(Uint32 size, const PEGASUS_ARRAY_T& x)
190 {
|
191 mike 1.27 reserveCapacity(Array_size + size);
192 PEGASUS_ARRAY_T* p = Array_data + Array_size;
|
193 mike 1.5 Uint32 n = size;
194
195 while (n--)
|
196 kumpf 1.13 new(p++) PEGASUS_ARRAY_T(x);
|
197 mike 1.5
|
198 mike 1.27 Array_size += size;
|
199 mike 1.5 }
200
201 #ifndef PEGASUS_ARRAY_T
202 template<class PEGASUS_ARRAY_T>
203 #endif
204 void Array<PEGASUS_ARRAY_T>::swap(Array<PEGASUS_ARRAY_T>& x)
205 {
|
206 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>* tmp = Array_rep;
|
207 mike 1.28 _rep = x._rep;
|
208 mike 1.5 x._rep = tmp;
209 }
210
211 #ifndef PEGASUS_ARRAY_T
212 template<class PEGASUS_ARRAY_T>
213 #endif
|
214 mike 1.27 void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T& x)
|
215 kumpf 1.10 {
|
216 mike 1.27 Uint32 n = Array_size + 1;
217
218 if (n > Array_capacity || Array_refs.get() != 1)
219 reserveCapacity(n);
220
221 new (Array_data + Array_size) PEGASUS_ARRAY_T(x);
222 Array_size++;
|
223 kumpf 1.10 }
224
225 #ifndef PEGASUS_ARRAY_T
226 template<class PEGASUS_ARRAY_T>
227 #endif
|
228 mike 1.27 void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T* x, Uint32 size)
|
229 kumpf 1.10 {
|
230 mike 1.27 Uint32 n = Array_size + size;
231 reserveCapacity(n);
232 CopyToRaw(Array_data + Array_size, x, size);
233 Array_size = n;
|
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>::appendArray(const Array<PEGASUS_ARRAY_T>& x)
|
240 kumpf 1.10 {
|
241 mike 1.27 append(x.getData(), x.size());
|
242 kumpf 1.13 }
243
244 #ifndef PEGASUS_ARRAY_T
245 template<class PEGASUS_ARRAY_T>
246 #endif
|
247 mike 1.27 void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T& x)
|
248 kumpf 1.13 {
|
249 mike 1.27 prepend(&x, 1);
|
250 kumpf 1.13 }
251
252 #ifndef PEGASUS_ARRAY_T
253 template<class PEGASUS_ARRAY_T>
254 #endif
|
255 mike 1.27 void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T* x, Uint32 size)
|
256 kumpf 1.13 {
|
257 mike 1.27 reserveCapacity(Array_size + size);
258 memmove(
259 Array_data + size,
260 Array_data,
261 sizeof(PEGASUS_ARRAY_T) * Array_size);
262 CopyToRaw(Array_data, x, size);
263 Array_size += size;
|
264 kumpf 1.10 }
265
266 #ifndef PEGASUS_ARRAY_T
267 template<class PEGASUS_ARRAY_T>
268 #endif
|
269 mike 1.27 void Array<PEGASUS_ARRAY_T>::insert(Uint32 index, const PEGASUS_ARRAY_T& x)
|
270 mike 1.5 {
|
271 mike 1.27 insert(index, &x, 1);
|
272 mike 1.5 }
273
274 #ifndef PEGASUS_ARRAY_T
275 template<class PEGASUS_ARRAY_T>
276 #endif
|
277 mike 1.27 void Array<PEGASUS_ARRAY_T>::insert(
278 Uint32 index, const PEGASUS_ARRAY_T* x, Uint32 size)
|
279 mike 1.5 {
|
280 mike 1.27 if (index > Array_size)
281 throw IndexOutOfBoundsException();
282
283 reserveCapacity(Array_size + size);
284
285 Uint32 n = Array_size - index;
286
287 if (n)
288 {
289 memmove(
290 Array_data + index + size,
291 Array_data + index,
292 sizeof(PEGASUS_ARRAY_T) * n);
293 }
294
295 CopyToRaw(Array_data + index, x, size);
296 Array_size += size;
|
297 mike 1.5 }
298
299 #ifndef PEGASUS_ARRAY_T
300 template<class PEGASUS_ARRAY_T>
301 #endif
|
302 mike 1.27 void Array<PEGASUS_ARRAY_T>::remove(Uint32 index)
|
303 kumpf 1.10 {
|
304 mike 1.27 remove(index, 1);
|
305 kumpf 1.10 }
306
307 #ifndef PEGASUS_ARRAY_T
308 template<class PEGASUS_ARRAY_T>
309 #endif
|
310 mike 1.27 void Array<PEGASUS_ARRAY_T>::remove(Uint32 index, Uint32 size)
|
311 mike 1.5 {
|
312 mike 1.27 if (Array_refs.get() != 1)
|
313 mike 1.28 _rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep);
|
314 mike 1.27
315 // Case 1: attempting to remove last element (this is an optimization
316 // for when the array is used as a stack; see Stack class).
317
318 if (index + 1 == Array_size)
319 {
320 Destroy(Array_data + index, 1);
321 Array_size--;
322 return;
323 }
324
325 // Case 2: not attempting to remove last element:
326
327 if (index + size - 1 > Array_size)
328 throw IndexOutOfBoundsException();
329
330 Destroy(Array_data + index, size);
331 Uint32 rem = Array_size - (index + size);
332
333 if (rem)
334 {
335 mike 1.27 memmove(
336 Array_data + index,
337 Array_data + index + size,
338 sizeof(PEGASUS_ARRAY_T) * rem);
339 }
340
341 Array_size -= size;
|
342 mike 1.5 }
343
344 #ifndef PEGASUS_ARRAY_T
345 template<class PEGASUS_ARRAY_T>
346 #endif
|
347 mike 1.27 Uint32 Array<PEGASUS_ARRAY_T>::size() const
|
348 mike 1.5 {
|
349 mike 1.27 return Array_size;
|
350 mike 1.5 }
351
352 #ifndef PEGASUS_ARRAY_T
353 template<class PEGASUS_ARRAY_T>
354 #endif
|
355 mike 1.27 PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](
356 Uint32 index)
|
357 mike 1.5 {
|
358 mike 1.27 #ifndef PEGASUS_ARRAY_NO_THROW
359 if (index >= Array_size)
360 ArrayThrowIndexOutOfBoundsException();
361 #endif
362
363 if (Array_refs.get() != 1)
|
364 mike 1.28 _rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep);
|
365 mike 1.27
366 return Array_data[index];
|
367 mike 1.5 }
368
369 #ifndef PEGASUS_ARRAY_T
370 template<class PEGASUS_ARRAY_T>
371 #endif
|
372 mike 1.27 const PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](
373 Uint32 index) const
|
374 mike 1.5 {
|
375 mike 1.27 #ifndef PEGASUS_ARRAY_NO_THROW
376 if (index >= Array_size)
377 ArrayThrowIndexOutOfBoundsException();
378 #endif
|
379 mike 1.5
|
380 mike 1.27 return Array_data[index];
|
381 mike 1.5 }
382
383 #ifndef PEGASUS_ARRAY_T
384 template<class PEGASUS_ARRAY_T>
385 #endif
|
386 mike 1.27 Uint32 Array<PEGASUS_ARRAY_T>::getCapacity() const
|
387 mike 1.5 {
|
388 mike 1.27 return Array_capacity;
|
389 mike 1.5 }
390
391 #ifndef PEGASUS_ARRAY_T
392 template<class PEGASUS_ARRAY_T>
393 #endif
|
394 mike 1.27 const PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::getData() const
|
395 mike 1.5 {
|
396 mike 1.27 return Array_data;
|
397 mike 1.5 }
|
398 kumpf 1.10
399 #ifndef PEGASUS_ARRAY_T
400 template<class PEGASUS_ARRAY_T>
401 #endif
402 PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::_data() const
403 {
|
404 mike 1.27 return Array_data;
|
405 kumpf 1.10 }
|
406 mike 1.6
|
407 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