## Public API Reference

- Main Page
- Modules
- Namespaces
- Classes
- Files
- Related Pages

- Alphabetical List
- Class List
- Class Hierarchy
- Class Members

# csPDelArray< T > Member List

This is the complete list of members for csPDelArray< T >, including all inherited members.

AllocatorType typedef | csArray< T *, csPDelArrayElementHandler< T * > > |
Capacity() const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
CapacityHandlerType typedef | csArray< T *, csPDelArrayElementHandler< T * > > |
Contains(T *const &which) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
csArray(size_t in_capacity=0, const csArrayCapacityDefault &ch=csArrayCapacityDefault()) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
csArray(size_t in_capacity, const CS::Memory::AllocatorMalloc &alloc, const csArrayCapacityDefault &ch) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
csArray(const csArray &source) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
csPDelArray(int ilimit=0, int ithreshold=0) | csPDelArray< T > | `[inline]`
DefaultCompare(T *const &r1, T *const &r2) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline, static]`
Delete(T *const &item) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
DeleteAll() | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
DeleteFast(T *const &item) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
DeleteIndex(size_t n) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
DeleteIndexFast(size_t n) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
DeleteRange(size_t start, size_t end) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
ElementHandlerType typedef | csArray< T *, csPDelArrayElementHandler< T * > > |
Empty() | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Extract(size_t n) | csPDelArray< T > | `[inline]`
Find(T *const &which) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
FindKey(csArrayCmp< T *, K > comparekey) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
FindSortedKey(csArrayCmp< T *, K > comparekey, size_t *candidate=0) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Get(size_t n) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Get(size_t n) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
GetAllocator() const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
GetAndClear(size_t n) | csPDelArray< T > | `[inline]`
GetExtend(size_t n) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
GetIndex(const T **which) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
GetIterator() | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
GetIterator() const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
GetSize() const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
InitRegion(size_t start, size_t count) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline, protected]`
Insert(size_t n, T *const &item) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
InsertSorted(const T *&item, int(*compare)(T *const &, T *const &)=DefaultCompare, size_t *equal_index=0) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
IsEmpty() const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Length() const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
operator!=(const csArray &other) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
csArray< T *, csPDelArrayElementHandler< T * > >::operator=(const csArray &other) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
operator==(const csArray &other) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
operator[](size_t n) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
operator[](size_t n) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Pop() | csPDelArray< T > | `[inline]`
Push(T *const &what) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
PushSmart(T *const &what) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Put(size_t n, T *const &what) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Section(size_t low, size_t high) const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
SetCapacity(size_t n) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
SetLength(size_t n, T const &what) | csPDelArray< T > | `[inline]`
SetLength(size_t n, T *const &w) | csPDelArray< T > | `[inline]`
SetLength(size_t n) | csPDelArray< T > | `[inline]`
SetMinimalCapacity(size_t n) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
SetSize(size_t n, T *const &what) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
SetSize(size_t n) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
ShrinkBestFit() | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Sort(int(*compare)(T *const &, T *const &)=DefaultCompare) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
ThisType typedef | csArray< T *, csPDelArrayElementHandler< T * > > |
Top() const | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Top() | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
TransferTo(csArray &destination) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
Truncate(size_t n) | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`
ValueType typedef | csArray< T *, csPDelArrayElementHandler< T * > > |
~csArray() | csArray< T *, csPDelArrayElementHandler< T * > > | `[inline]`