|
| TSortedObjectArray (int upper, int lower=0, int delta=0) |
|
| TSortedObjectArray () |
|
| ~TSortedObjectArray () |
|
| TSortedObjectArray (const TSortedObjectArray< T > &array) |
|
TSortedObjectArray< T > & | operator= (const TSortedObjectArray< T > &array) |
|
| TMSortedObjectArray (int upper, int lower=0, int delta=0) |
|
| TMSortedObjectArray () |
|
| TMSortedObjectArray (const TMSortedObjectArray< T, TStandardAllocator > &array) |
|
| ~TMSortedObjectArray () |
|
TMSortedObjectArray< T, TStandardAllocator > & | operator= (const TMSortedObjectArray< T, TStandardAllocator > &array) |
|
int | Add (const T &t) |
|
bool | DestroyItem (const T &t) |
|
bool | HasMember (const T &t) const |
|
int | Find (const T &t) const |
|
| TMObjectArray (int upper, int lower=0, int=0) |
|
| TMObjectArray () |
|
| ~TMObjectArray () |
|
| TMObjectArray (const TMObjectArray< T, A > &array) |
|
TMObjectArray< T, A > & | operator= (const TMObjectArray< T, A > &array) |
|
TMMemBlocks< A > & | GetAllocator () |
|
void | RemoveEntry (int loc) |
|
void | SqueezeEntry (unsigned loc) |
|
void | Grow (int index) |
|
int | Add (const T &t) |
|
void | AddAt (const T &t, uint index) |
|
bool | DestroyItem (const T &t) |
|
bool | Destroy (int loc) |
|
bool | HasMember (const T &t) const |
|
int | Find (const T &t) const |
|
T & | operator[] (int loc) |
|
const T & | operator[] (int loc) const |
|
void | ForEach (IterFunc iter, void *args) |
|
T * | FirstThat (CondFunc cond, void *args) const |
|
T * | LastThat (CondFunc cond, void *args) const |
|
void | Flush () |
|
| TArrayBase () |
|
uint | GetItemsInContainer () const |
|
int | LowerBound () const |
|
int | UpperBound () const |
|
uint | ArraySize () const |
|
bool | IsFull () const |
|
bool | IsEmpty () const |
|
uint | Size () const |
|
uint | Count () const |
|
bool | Empty () const |
|
uint | size () const |
|
bool | empty () const |
|
template<
class T>
class owl::TSortedObjectArray< T >
Definition at line 730 of file template.h.