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 //%/////////////////////////////////////////////////////////////////////////////
33
|
34 kumpf 1.13 // Only include if not included as general template or if explicit instantiation
35 #if !defined(Pegasus_ArrayImpl_h) || defined(PEGASUS_ARRAY_T)
36 #if !defined(PEGASUS_ARRAY_T)
37 #define Pegasus_ArrayImpl_h
38 #endif
39
40 PEGASUS_NAMESPACE_END
41
42 #include <Pegasus/Common/Memory.h>
43 #include <Pegasus/Common/ArrayRep.h>
|
44 kumpf 1.23 #include <Pegasus/Common/InternalException.h>
|
45 mike 1.27 #include <Pegasus/Common/Linkage.h>
|
46 kumpf 1.13
47 PEGASUS_NAMESPACE_BEGIN
|
48 mike 1.5
|
49 mike 1.27 PEGASUS_COMMON_LINKAGE void ArrayThrowIndexOutOfBoundsException();
50
|
51 mike 1.5 #ifndef PEGASUS_ARRAY_T
52 template<class PEGASUS_ARRAY_T>
53 #endif
54 Array<PEGASUS_ARRAY_T>::Array()
55 {
|
56 mike 1.27 _rep = &ArrayRepBase::_empty_rep;
|
57 mike 1.5 }
58
59 #ifndef PEGASUS_ARRAY_T
60 template<class PEGASUS_ARRAY_T>
61 #endif
62 Array<PEGASUS_ARRAY_T>::Array(const Array<PEGASUS_ARRAY_T>& x)
63 {
|
64 mike 1.27 _rep = x._rep;
65 ArrayRep<PEGASUS_ARRAY_T>::ref(Array_rep);
|
66 mike 1.5 }
67
68 #ifndef PEGASUS_ARRAY_T
69 template<class PEGASUS_ARRAY_T>
70 #endif
71 Array<PEGASUS_ARRAY_T>::Array(Uint32 size)
72 {
|
73 mike 1.28 _rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size);
|
74 kumpf 1.23
|
75 dave.sudlik 1.32 // ArrayRep<PEGASUS_ARRAY_T>::alloc() throws a bad_alloc exception if
76 // storage could not be obtained.
|
77 kumpf 1.23
|
78 mike 1.27 InitializeRaw(Array_data, size);
|
79 mike 1.5 }
80
81 #ifndef PEGASUS_ARRAY_T
82 template<class PEGASUS_ARRAY_T>
83 #endif
84 Array<PEGASUS_ARRAY_T>::Array(Uint32 size, const PEGASUS_ARRAY_T& x)
85 {
|
86 mike 1.27 _rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size);
|
87 mike 1.5
|
88 dave.sudlik 1.32 // ArrayRep<PEGASUS_ARRAY_T>::alloc() throws a bad_alloc exception if
89 // storage could not be obtained.
|
90 kumpf 1.23
|
91 mike 1.27 PEGASUS_ARRAY_T* data = Array_data;
92
93 // Note: we could use template specialization (by adding functions to
94 // Memory.h) so that this loop becomes a memset() for single byte raw
95 // types, but this function is rarely called.
|
96 mike 1.5
97 while (size--)
|
98 kumpf 1.13 new(data++) PEGASUS_ARRAY_T(x);
|
99 mike 1.5 }
100
101 #ifndef PEGASUS_ARRAY_T
102 template<class PEGASUS_ARRAY_T>
103 #endif
104 Array<PEGASUS_ARRAY_T>::Array(const PEGASUS_ARRAY_T* items, Uint32 size)
105 {
|
106 mike 1.27 _rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size);
|
107 kumpf 1.23
|
108 dave.sudlik 1.32 // ArrayRep<PEGASUS_ARRAY_T>::alloc() throws a bad_alloc exception if
109 // storage could not be obtained.
|
110 kumpf 1.23
|
111 mike 1.27 CopyToRaw(Array_data, items, size);
|
112 mike 1.5 }
113
114 #ifndef PEGASUS_ARRAY_T
115 template<class PEGASUS_ARRAY_T>
116 #endif
117 Array<PEGASUS_ARRAY_T>::~Array()
118 {
|
119 mike 1.27 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
|
120 mike 1.5 }
121
122 #ifndef PEGASUS_ARRAY_T
123 template<class PEGASUS_ARRAY_T>
124 #endif
125 Array<PEGASUS_ARRAY_T>& Array<PEGASUS_ARRAY_T>::operator=(
126 const Array<PEGASUS_ARRAY_T>& x)
127 {
|
128 mike 1.27 if (x._rep != Array_rep)
|
129 mike 1.5 {
|
130 kumpf 1.34 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
131 _rep = x._rep;
132 ArrayRep<PEGASUS_ARRAY_T>::ref(Array_rep);
|
133 mike 1.5 }
|
134 mike 1.27
|
135 mike 1.5 return *this;
136 }
137
138 #ifndef PEGASUS_ARRAY_T
139 template<class PEGASUS_ARRAY_T>
140 #endif
141 void Array<PEGASUS_ARRAY_T>::clear()
142 {
|
143 mike 1.27 if (Array_size)
144 {
|
145 kumpf 1.34 if (Array_refs.get() == 1)
146 {
147 Destroy(Array_data, Array_size);
148 Array_size = 0;
149 }
150 else
151 {
152 ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep);
153 _rep = &ArrayRepBase::_empty_rep;
154 }
|
155 mike 1.27 }
|
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 kumpf 1.34 ArrayRep<PEGASUS_ARRAY_T>* rep =
166 ArrayRep<PEGASUS_ARRAY_T>::alloc(capacity);
|
167 mike 1.27
|
168 dave.sudlik 1.32 // ArrayRep<PEGASUS_ARRAY_T>::alloc() throws a bad_alloc exception if
169 // storage could not be obtained.
|
170 mike 1.27
|
171 kumpf 1.34 rep->size = Array_size;
|
172 mike 1.27
|
173 kumpf 1.34 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 mike 1.27
|
181 kumpf 1.34 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 kumpf 1.34 Array_data + size,
260 Array_data,
261 sizeof(PEGASUS_ARRAY_T) * Array_size);
|
262 mike 1.27 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 mike 1.29 {
|
282 mike 1.27 throw IndexOutOfBoundsException();
|
283 mike 1.29 }
|
284 mike 1.27
285 reserveCapacity(Array_size + size);
286
287 Uint32 n = Array_size - index;
288
289 if (n)
290 {
291 memmove(
|
292 kumpf 1.34 Array_data + index + size,
|
293 mike 1.27 Array_data + index,
294 sizeof(PEGASUS_ARRAY_T) * n);
295 }
296
297 CopyToRaw(Array_data + index, x, size);
298 Array_size += size;
|
299 mike 1.5 }
300
301 #ifndef PEGASUS_ARRAY_T
302 template<class PEGASUS_ARRAY_T>
303 #endif
|
304 mike 1.27 void Array<PEGASUS_ARRAY_T>::remove(Uint32 index)
|
305 kumpf 1.10 {
|
306 mike 1.27 remove(index, 1);
|
307 kumpf 1.10 }
308
309 #ifndef PEGASUS_ARRAY_T
310 template<class PEGASUS_ARRAY_T>
311 #endif
|
312 mike 1.27 void Array<PEGASUS_ARRAY_T>::remove(Uint32 index, Uint32 size)
|
313 mike 1.5 {
|
314 mike 1.27 if (Array_refs.get() != 1)
|
315 kumpf 1.34 _rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep);
|
316 mike 1.27
317 // Case 1: attempting to remove last element (this is an optimization
318 // for when the array is used as a stack; see Stack class).
319
320 if (index + 1 == Array_size)
321 {
|
322 kumpf 1.34 Destroy(Array_data + index, 1);
323 Array_size--;
324 return;
|
325 mike 1.27 }
326
327 // Case 2: not attempting to remove last element:
328
329 if (index + size - 1 > Array_size)
|
330 mike 1.29 {
|
331 mike 1.27 throw IndexOutOfBoundsException();
|
332 mike 1.29 }
|
333 mike 1.27
334 Destroy(Array_data + index, size);
335 Uint32 rem = Array_size - (index + size);
336
337 if (rem)
338 {
339 memmove(
|
340 kumpf 1.34 Array_data + index,
341 Array_data + index + size,
342 sizeof(PEGASUS_ARRAY_T) * rem);
|
343 mike 1.27 }
344
345 Array_size -= size;
|
346 mike 1.5 }
347
348 #ifndef PEGASUS_ARRAY_T
349 template<class PEGASUS_ARRAY_T>
350 #endif
|
351 mike 1.27 Uint32 Array<PEGASUS_ARRAY_T>::size() const
|
352 mike 1.5 {
|
353 mike 1.27 return Array_size;
|
354 mike 1.5 }
355
356 #ifndef PEGASUS_ARRAY_T
357 template<class PEGASUS_ARRAY_T>
358 #endif
|
359 mike 1.27 PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](
360 Uint32 index)
|
361 mike 1.5 {
|
362 mike 1.27 if (index >= Array_size)
363 ArrayThrowIndexOutOfBoundsException();
364
365 if (Array_refs.get() != 1)
|
366 kumpf 1.34 _rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep);
|
367 mike 1.27
368 return Array_data[index];
|
369 mike 1.5 }
370
371 #ifndef PEGASUS_ARRAY_T
372 template<class PEGASUS_ARRAY_T>
373 #endif
|
374 mike 1.27 const PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](
375 Uint32 index) const
|
376 mike 1.5 {
|
377 mike 1.27 if (index >= Array_size)
378 ArrayThrowIndexOutOfBoundsException();
|
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