RakNet
4.0
|
Array based implementation of a list. More...
#include <DS_List.h>
Public Member Functions | |
List () | |
Default constructor. | |
List (const List &original_copy) | |
Copy constructor. | |
List & | operator= (const List &original_copy) |
Assign one list to another. | |
list_type & | operator[] (const unsigned int position) const |
Access an element by its index in the array. | |
list_type & | Get (const unsigned int position) const |
Access an element by its index in the array. | |
void | Push (const list_type &input, const char *file, unsigned int line) |
Push an element at the end of the stack. | |
list_type & | Pop (void) |
Pop an element from the end of the stack. | |
void | Insert (const list_type &input, const unsigned int position, const char *file, unsigned int line) |
Insert an element at position position in the list. | |
void | Insert (const list_type &input, const char *file, unsigned int line) |
Insert at the end of the list. | |
void | Replace (const list_type &input, const list_type filler, const unsigned int position, const char *file, unsigned int line) |
Replace the value at position by input. | |
void | Replace (const list_type &input) |
Replace the last element of the list by input. | |
void | RemoveAtIndex (const unsigned int position) |
Delete the element at position position. | |
void | RemoveAtIndexFast (const unsigned int position) |
Delete the element at position position. | |
void | RemoveFromEnd (const unsigned num=1) |
Delete the element at the end of the list. | |
unsigned int | GetIndexOf (const list_type &input) const |
Returns the index of the specified item or MAX_UNSIGNED_LONG if not found. | |
unsigned int | Size (void) const |
void | Clear (bool doNotDeallocateSmallBlocks, const char *file, unsigned int line) |
Clear the list. | |
void | Preallocate (unsigned countNeeded, const char *file, unsigned int line) |
Preallocate the list, so it needs fewer reallocations at runtime. | |
void | Compress (const char *file, unsigned int line) |
Frees overallocated members, to use the minimum memory necessary. | |
Array based implementation of a list.
DataStructures::List< list_type >::List | ( | const List< list_type > & | original_copy | ) |
Copy constructor.
[in] | original_copy | The list to duplicate |
void DataStructures::List< list_type >::Compress | ( | const char * | file, |
unsigned int | line | ||
) |
Frees overallocated members, to use the minimum memory necessary.
|
inline |
Access an element by its index in the array.
[in] | position | The index into the array. |
unsigned int DataStructures::List< list_type >::GetIndexOf | ( | const list_type & | input | ) | const |
Returns the index of the specified item or MAX_UNSIGNED_LONG if not found.
[in] | input | The element to check for |
MAX_UNSIGNED_LONG | The object is not in the list |
[Integer] | The index of the element in the list |
void DataStructures::List< list_type >::Insert | ( | const list_type & | input, |
const unsigned int | position, | ||
const char * | file, | ||
unsigned int | line | ||
) |
Insert an element at position position in the list.
[in] | input | The new element. |
[in] | position | The position of the new element. |
void DataStructures::List< list_type >::Insert | ( | const list_type & | input, |
const char * | file, | ||
unsigned int | line | ||
) |
Insert at the end of the list.
[in] | input | The new element. |
|
inline |
Access an element by its index in the array.
[in] | position | The index into the array. |
|
inline |
void DataStructures::List< list_type >::Push | ( | const list_type & | input, |
const char * | file, | ||
unsigned int | line | ||
) |
Push an element at the end of the stack.
[in] | input | The new element. |
void DataStructures::List< list_type >::RemoveAtIndex | ( | const unsigned int | position | ) |
Delete the element at position position.
[in] | position | The index of the element to delete |
void DataStructures::List< list_type >::RemoveAtIndexFast | ( | const unsigned int | position | ) |
Delete the element at position position.
[in] | position | The index of the element to delete |
|
inline |
Replace the value at position by input.
If the size of the list is less than position, it increase the capacity of the list and fill slot with filler.
[in] | input | The element to replace at position position. |
[in] | filler | The element use to fill new allocated capacity. |
[in] | position | The position of input in the list. |
|
inline |
Replace the last element of the list by input.
[in] | input | The element used to replace the last element. |
|
inline |