CrystalSpace

Public API Reference

csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > Member List

This is the complete list of members for csArray< T, ElementHandler, MemoryAllocator, CapacityHandler >, including all inherited members.
Capacity() const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Contains(T const &which) const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
csArray(size_t in_capacity=0, const CapacityHandler &ch=CapacityHandler())csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
csArray(size_t in_capacity, const MemoryAllocator &alloc, const CapacityHandler &ch)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
csArray(const csArray &source)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
DefaultCompare(T const &r1, T const &r2)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline, static]
Delete(T const &item)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
DeleteAll()csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
DeleteIndex(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
DeleteIndexFast(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
DeleteRange(size_t start, size_t end)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Empty()csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Find(T const &which) const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
FindKey(csArrayCmp< T, K > comparekey) const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
FindSortedKey(csArrayCmp< T, K > comparekey, size_t *candidate=0) const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Get(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Get(size_t n) const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
GetAllocator() const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
GetExtend(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
GetExtend(size_t n, T const &what)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
GetIndex(const T *which) const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
GetIterator()csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
GetIterator() const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
GetReverseIterator()csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
GetReverseIterator() const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
GetSize() const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
InitRegion(size_t start, size_t count)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline, protected]
Insert(size_t n, T const &item)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
InsertSorted(const T &item, int(*compare)(T const &, T const &)=DefaultCompare, size_t *equal_index=0)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
IsEmpty() const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Merge(const csArray &origin)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
MergeSmart(const csArray &origin)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
operator=(const csArray &other)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
operator==(const csArray &other) const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
operator[](size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
operator[](size_t n) const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Pop()csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Push(T const &what)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
PushSmart(T const &what)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Put(size_t n, T const &what)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Section(size_t low, size_t high) const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
SetCapacity(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
SetCapacityVeryUnsafe(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline, protected]
SetDataVeryUnsafe(T *data)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline, protected]
SetMinimalCapacity(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
SetSize(size_t n, T const &what)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
SetSize(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
SetSizeVeryUnsafe(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline, protected]
ShrinkBestFit()csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Sort(int(*compare)(T const &, T const &)=DefaultCompare)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Sort(Pred &pred)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
SortStable(Pred &pred)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Top() const csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Top()csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
TransferTo(csArray &destination)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
Truncate(size_t n)csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]
~csArray()csArray< T, ElementHandler, MemoryAllocator, CapacityHandler > [inline]

Generated for Crystal Space 2.0 by doxygen 1.6.1