Public API Reference

csRefArray< T, Allocator > Member List

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

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

---