version 1.19, 2002/07/23 21:39:31
|
version 1.32, 2006/05/10 19:40:38
|
|
|
//%///////////////////////////////////////////////////////////////////////////// |
//%2006//////////////////////////////////////////////////////////////////////// |
// | // |
// Copyright (c) 2000, 2001, 2002 BMC Software, Hewlett-Packard Company, IBM, |
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
// The Open Group, Tivoli Systems |
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
|
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation, The Open Group. |
|
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; Symantec Corporation; The Open Group. |
// | // |
// Permission is hereby granted, free of charge, to any person obtaining a copy | // Permission is hereby granted, free of charge, to any person obtaining a copy |
// of this software and associated documentation files (the "Software"), to | // of this software and associated documentation files (the "Software"), to |
|
|
// Author: Mike Brasher (mbrasher@bmc.com) | // Author: Mike Brasher (mbrasher@bmc.com) |
// | // |
// Modified By: Roger Kumpf, Hewlett-Packard Company (roger_kumpf@hp.com) | // Modified By: Roger Kumpf, Hewlett-Packard Company (roger_kumpf@hp.com) |
|
// Mike Brasher, Inova Europe (mike-brasher@austin.rr.com) |
// | // |
//%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
| |
|
|
| |
#include <Pegasus/Common/Memory.h> | #include <Pegasus/Common/Memory.h> |
#include <Pegasus/Common/ArrayRep.h> | #include <Pegasus/Common/ArrayRep.h> |
#include <Pegasus/Common/Exception.h> |
#include <Pegasus/Common/InternalException.h> |
|
#include <Pegasus/Common/Linkage.h> |
| |
PEGASUS_NAMESPACE_BEGIN | PEGASUS_NAMESPACE_BEGIN |
| |
|
PEGASUS_COMMON_LINKAGE void ArrayThrowIndexOutOfBoundsException(); |
|
|
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
Array<PEGASUS_ARRAY_T>::Array() | Array<PEGASUS_ARRAY_T>::Array() |
{ | { |
_rep = ArrayRep<PEGASUS_ARRAY_T>::create(0); |
_rep = &ArrayRepBase::_empty_rep; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
|
|
#endif | #endif |
Array<PEGASUS_ARRAY_T>::Array(const Array<PEGASUS_ARRAY_T>& x) | Array<PEGASUS_ARRAY_T>::Array(const Array<PEGASUS_ARRAY_T>& x) |
{ | { |
_rep = static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(x._rep)->clone(); |
_rep = x._rep; |
|
ArrayRep<PEGASUS_ARRAY_T>::ref(Array_rep); |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
|
|
#endif | #endif |
Array<PEGASUS_ARRAY_T>::Array(Uint32 size) | Array<PEGASUS_ARRAY_T>::Array(Uint32 size) |
{ | { |
_rep = ArrayRep<PEGASUS_ARRAY_T>::create(size); |
_rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size); |
InitializeRaw(static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data(), size); |
|
|
// ArrayRep<PEGASUS_ARRAY_T>::alloc() throws a bad_alloc exception if |
|
// storage could not be obtained. |
|
|
|
InitializeRaw(Array_data, size); |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
|
|
#endif | #endif |
Array<PEGASUS_ARRAY_T>::Array(Uint32 size, const PEGASUS_ARRAY_T& x) | Array<PEGASUS_ARRAY_T>::Array(Uint32 size, const PEGASUS_ARRAY_T& x) |
{ | { |
_rep = ArrayRep<PEGASUS_ARRAY_T>::create(size); |
_rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size); |
|
|
|
// ArrayRep<PEGASUS_ARRAY_T>::alloc() throws a bad_alloc exception if |
|
// storage could not be obtained. |
|
|
|
PEGASUS_ARRAY_T* data = Array_data; |
| |
PEGASUS_ARRAY_T* data = static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data(); |
// Note: we could use template specialization (by adding functions to |
|
// Memory.h) so that this loop becomes a memset() for single byte raw |
|
// types, but this function is rarely called. |
| |
while (size--) | while (size--) |
new(data++) PEGASUS_ARRAY_T(x); | new(data++) PEGASUS_ARRAY_T(x); |
|
|
#endif | #endif |
Array<PEGASUS_ARRAY_T>::Array(const PEGASUS_ARRAY_T* items, Uint32 size) | Array<PEGASUS_ARRAY_T>::Array(const PEGASUS_ARRAY_T* items, Uint32 size) |
{ | { |
_rep = ArrayRep<PEGASUS_ARRAY_T>::create(size); |
_rep = ArrayRep<PEGASUS_ARRAY_T>::alloc(size); |
CopyToRaw(static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data(), items, size); |
|
|
// ArrayRep<PEGASUS_ARRAY_T>::alloc() throws a bad_alloc exception if |
|
// storage could not be obtained. |
|
|
|
CopyToRaw(Array_data, items, size); |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
|
|
#endif | #endif |
Array<PEGASUS_ARRAY_T>::~Array() | Array<PEGASUS_ARRAY_T>::~Array() |
{ | { |
ArrayRep<PEGASUS_ARRAY_T>::destroy(static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)); |
ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep); |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
|
|
Array<PEGASUS_ARRAY_T>& Array<PEGASUS_ARRAY_T>::operator=( | Array<PEGASUS_ARRAY_T>& Array<PEGASUS_ARRAY_T>::operator=( |
const Array<PEGASUS_ARRAY_T>& x) | const Array<PEGASUS_ARRAY_T>& x) |
{ | { |
if (static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(x._rep) != |
if (x._rep != Array_rep) |
static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)) |
|
{ | { |
ArrayRep<PEGASUS_ARRAY_T>::destroy(static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)); |
ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep); |
_rep = static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(x._rep)->clone(); |
_rep = x._rep; |
|
ArrayRep<PEGASUS_ARRAY_T>::ref(Array_rep); |
} | } |
|
|
return *this; | return *this; |
} | } |
| |
|
|
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::clear() | void Array<PEGASUS_ARRAY_T>::clear() |
{ | { |
ArrayRep<PEGASUS_ARRAY_T>::destroy(static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)); |
if (Array_size) |
_rep = ArrayRep<PEGASUS_ARRAY_T>::create(0); |
{ |
|
if (Array_refs.get() == 1) |
|
{ |
|
Destroy(Array_data, Array_size); |
|
Array_size = 0; |
|
} |
|
else |
|
{ |
|
ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep); |
|
_rep = &ArrayRepBase::_empty_rep; |
|
} |
|
} |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
|
|
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::reserveCapacity(Uint32 capacity) | void Array<PEGASUS_ARRAY_T>::reserveCapacity(Uint32 capacity) |
{ | { |
if (capacity > static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->capacity) |
if (capacity > Array_capacity || Array_refs.get() != 1) |
|
{ |
|
ArrayRep<PEGASUS_ARRAY_T>* rep = |
|
ArrayRep<PEGASUS_ARRAY_T>::alloc(capacity); |
|
|
|
// ArrayRep<PEGASUS_ARRAY_T>::alloc() throws a bad_alloc exception if |
|
// storage could not be obtained. |
|
|
|
rep->size = Array_size; |
|
|
|
if (Array_refs.get() == 1) |
{ | { |
Uint32 size = this->size(); |
memcpy(rep->data(), Array_data, Array_size*sizeof(PEGASUS_ARRAY_T)); |
ArrayRep<PEGASUS_ARRAY_T>* rep = ArrayRep<PEGASUS_ARRAY_T>::create(capacity); |
Array_size = 0; |
rep->size = size; |
} |
CopyToRaw(rep->data(), static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data(), size); |
else |
ArrayRep<PEGASUS_ARRAY_T>::destroy(static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)); |
CopyToRaw(rep->data(), Array_data, Array_size); |
|
|
|
ArrayRep<PEGASUS_ARRAY_T>::unref(Array_rep); |
_rep = rep; | _rep = rep; |
} | } |
} | } |
|
|
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::grow(Uint32 size, const PEGASUS_ARRAY_T& x) | void Array<PEGASUS_ARRAY_T>::grow(Uint32 size, const PEGASUS_ARRAY_T& x) |
{ | { |
Uint32 oldSize = static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->size; |
reserveCapacity(Array_size + size); |
reserveCapacity(oldSize + size); |
PEGASUS_ARRAY_T* p = Array_data + Array_size; |
|
|
PEGASUS_ARRAY_T* p = static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data() + oldSize; |
|
Uint32 n = size; | Uint32 n = size; |
| |
while (n--) | while (n--) |
new(p++) PEGASUS_ARRAY_T(x); | new(p++) PEGASUS_ARRAY_T(x); |
| |
static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->size += size; |
Array_size += size; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
|
|
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::swap(Array<PEGASUS_ARRAY_T>& x) | void Array<PEGASUS_ARRAY_T>::swap(Array<PEGASUS_ARRAY_T>& x) |
{ | { |
ArrayRep<PEGASUS_ARRAY_T>* tmp = static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep); |
ArrayRep<PEGASUS_ARRAY_T>* tmp = Array_rep; |
_rep = static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(x._rep); |
_rep = x._rep; |
x._rep = tmp; | x._rep = tmp; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
Uint32 Array<PEGASUS_ARRAY_T>::size() const |
void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T& x) |
{ | { |
return static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->size; |
Uint32 n = Array_size + 1; |
|
|
|
if (n > Array_capacity || Array_refs.get() != 1) |
|
reserveCapacity(n); |
|
|
|
new (Array_data + Array_size) PEGASUS_ARRAY_T(x); |
|
Array_size++; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
Uint32 Array<PEGASUS_ARRAY_T>::getCapacity() const |
void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T* x, Uint32 size) |
{ | { |
return static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->capacity; |
Uint32 n = Array_size + size; |
|
reserveCapacity(n); |
|
CopyToRaw(Array_data + Array_size, x, size); |
|
Array_size = n; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
const PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::getData() const |
void Array<PEGASUS_ARRAY_T>::appendArray(const Array<PEGASUS_ARRAY_T>& x) |
{ | { |
return static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data(); |
append(x.getData(), x.size()); |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](Uint32 pos) |
void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T& x) |
{ | { |
if (pos >= size()) |
prepend(&x, 1); |
throw OutOfBounds(); |
|
|
|
return static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data()[pos]; |
|
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
const PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[](Uint32 pos) const |
void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T* x, Uint32 size) |
{ | { |
if (pos >= size()) |
reserveCapacity(Array_size + size); |
throw OutOfBounds(); |
memmove( |
|
Array_data + size, |
return static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data()[pos]; |
Array_data, |
|
sizeof(PEGASUS_ARRAY_T) * Array_size); |
|
CopyToRaw(Array_data, x, size); |
|
Array_size += size; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T& x) |
void Array<PEGASUS_ARRAY_T>::insert(Uint32 index, const PEGASUS_ARRAY_T& x) |
{ | { |
reserveCapacity(size() + 1); |
insert(index, &x, 1); |
new (_data() + size()) PEGASUS_ARRAY_T(x); |
|
static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->size++; |
|
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::append(const PEGASUS_ARRAY_T* x, Uint32 size) |
void Array<PEGASUS_ARRAY_T>::insert( |
|
Uint32 index, const PEGASUS_ARRAY_T* x, Uint32 size) |
|
{ |
|
if (index > Array_size) |
{ | { |
reserveCapacity(this->size() + size); |
throw IndexOutOfBoundsException(); |
CopyToRaw(_data() + this->size(), x, size); |
|
static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->size += size; |
|
} | } |
| |
#ifndef PEGASUS_ARRAY_T |
reserveCapacity(Array_size + size); |
template<class PEGASUS_ARRAY_T> |
|
#endif |
Uint32 n = Array_size - index; |
void Array<PEGASUS_ARRAY_T>::appendArray(const Array<PEGASUS_ARRAY_T>& x) |
|
|
if (n) |
{ | { |
append(x.getData(), x.size()); |
memmove( |
|
Array_data + index + size, |
|
Array_data + index, |
|
sizeof(PEGASUS_ARRAY_T) * n); |
} | } |
| |
#ifndef PEGASUS_ARRAY_T |
CopyToRaw(Array_data + index, x, size); |
template<class PEGASUS_ARRAY_T> |
Array_size += size; |
#endif |
|
void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T& x) |
|
{ |
|
prepend(&x, 1); |
|
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::prepend(const PEGASUS_ARRAY_T* x, Uint32 size) |
void Array<PEGASUS_ARRAY_T>::remove(Uint32 index) |
{ | { |
reserveCapacity(this->size() + size); |
remove(index, 1); |
memmove(_data() + size, _data(), sizeof(PEGASUS_ARRAY_T) * this->size()); |
|
CopyToRaw(_data(), x, size); |
|
static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->size += size; |
|
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::insert(Uint32 pos, const PEGASUS_ARRAY_T& x) |
void Array<PEGASUS_ARRAY_T>::remove(Uint32 index, Uint32 size) |
{ | { |
insert(pos, &x, 1); |
if (Array_refs.get() != 1) |
} |
_rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep); |
| |
#ifndef PEGASUS_ARRAY_T |
// Case 1: attempting to remove last element (this is an optimization |
template<class PEGASUS_ARRAY_T> |
// for when the array is used as a stack; see Stack class). |
#endif |
|
void Array<PEGASUS_ARRAY_T>::insert(Uint32 pos, const PEGASUS_ARRAY_T* x, Uint32 size) |
if (index + 1 == Array_size) |
{ | { |
if (pos > this->size()) |
Destroy(Array_data + index, 1); |
throw OutOfBounds(); |
Array_size--; |
|
return; |
|
} |
| |
reserveCapacity(this->size() + size); |
// Case 2: not attempting to remove last element: |
| |
Uint32 n = this->size() - pos; |
if (index + size - 1 > Array_size) |
|
{ |
|
throw IndexOutOfBoundsException(); |
|
} |
| |
if (n) |
Destroy(Array_data + index, size); |
|
Uint32 rem = Array_size - (index + size); |
|
|
|
if (rem) |
|
{ |
memmove( | memmove( |
_data() + pos + size, _data() + pos, sizeof(PEGASUS_ARRAY_T) * n); |
Array_data + index, |
|
Array_data + index + size, |
|
sizeof(PEGASUS_ARRAY_T) * rem); |
|
} |
| |
CopyToRaw(_data() + pos, x, size); |
Array_size -= size; |
static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->size += size; |
|
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::remove(Uint32 pos) |
Uint32 Array<PEGASUS_ARRAY_T>::size() const |
{ | { |
remove(pos, 1); |
return Array_size; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
void Array<PEGASUS_ARRAY_T>::remove(Uint32 pos, Uint32 size) |
PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[]( |
|
Uint32 index) |
{ | { |
if (pos + size - 1 > this->size()) |
#ifndef PEGASUS_ARRAY_NO_THROW |
throw OutOfBounds(); |
if (index >= Array_size) |
|
ArrayThrowIndexOutOfBoundsException(); |
Destroy(_data() + pos, size); |
#endif |
|
|
Uint32 rem = this->size() - (pos + size); |
|
| |
if (rem) |
if (Array_refs.get() != 1) |
memmove( |
_rep = ArrayRep<PEGASUS_ARRAY_T>::copy_on_write(Array_rep); |
_data() + pos, _data() + pos + size, sizeof(PEGASUS_ARRAY_T) * rem); |
|
| |
static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->size -= size; |
return Array_data[index]; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::begin() |
const PEGASUS_ARRAY_T& Array<PEGASUS_ARRAY_T>::operator[]( |
|
Uint32 index) const |
{ | { |
return static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data(); |
#ifndef PEGASUS_ARRAY_NO_THROW |
} |
if (index >= Array_size) |
|
ArrayThrowIndexOutOfBoundsException(); |
#ifndef PEGASUS_ARRAY_T |
|
template<class PEGASUS_ARRAY_T> |
|
#endif | #endif |
PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::end() |
|
{ |
return Array_data[index]; |
return static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data() + size(); |
|
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
const PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::begin() const |
Uint32 Array<PEGASUS_ARRAY_T>::getCapacity() const |
{ | { |
return getData(); |
return Array_capacity; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
template<class PEGASUS_ARRAY_T> | template<class PEGASUS_ARRAY_T> |
#endif | #endif |
const PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::end() const |
const PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::getData() const |
{ | { |
return getData() + size(); |
return Array_data; |
} | } |
| |
#ifndef PEGASUS_ARRAY_T | #ifndef PEGASUS_ARRAY_T |
|
|
#endif | #endif |
PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::_data() const | PEGASUS_ARRAY_T* Array<PEGASUS_ARRAY_T>::_data() const |
{ | { |
return static_cast<ArrayRep<PEGASUS_ARRAY_T>*>(_rep)->data(); |
return Array_data; |
} | } |
| |
#endif //!defined(Pegasus_ArrayImpl_h) || !defined(PEGASUS_ARRAY_T) | #endif //!defined(Pegasus_ArrayImpl_h) || !defined(PEGASUS_ARRAY_T) |