#include <Reference.h>
Inheritance diagram for ReferenceList:
Public Member Functions | |
void | Append (ELEMENTTYPE *Element) |
Appends an element to the array. | |
void | AppendAll (const ArrayList< ELEMENTTYPE > *Elements) |
Appends all elements of another array list to this one. | |
bool | Contains (const ELEMENTTYPE *Element, int(*compare)(const ELEMENTTYPE *Element1, const ELEMENTTYPE *Element2)) const |
Returns whether a given element is contained in this array. | |
bool | Contains (const ELEMENTTYPE *Element) const |
Returns whether a given element is contained in this array. | |
int | Find (const ELEMENTTYPE *Element, int(*compare)(const ELEMENTTYPE *Element1, const ELEMENTTYPE *Element2)) const |
Returns the 0-indexed position of a given element within the array list. | |
int | Find (const ELEMENTTYPE *Element) const |
Returns the 0-indexed position of a given element within the array list. | |
ELEMENTTYPE * | Get (long nr) const |
Returns the element at a given position. | |
long | GetCount () const |
Returns the number of used array cells. | |
int | GetDesiredFillRatio () const |
Returns the fill ratio after an array resize. | |
int | GetFillRatio () const |
Returns the current fill ratio. | |
ELEMENTTYPE * | GetFirst () const |
Returns the first element of the array. | |
ELEMENTTYPE * | GetLast () const |
Returns the last element of the array. | |
int | GetMinimumFillRatio () const |
Returns the minimum fill ratio for the array. | |
void * | GetReferrer () const |
void | Insert (const ELEMENTTYPE *Element, long nr) |
Inserts an element before a given position. | |
void | InsertAll (const ArrayList< ELEMENTTYPE > *Elements, long nr) |
Inserts all elements of another array list before a given position. | |
bool | IsEmpty () const |
Returns, whether there are no elements in the array. | |
void | Prepend (const ELEMENTTYPE *Element) |
Prepends an element to the array. | |
void | PrependAll (const ArrayList< ELEMENTTYPE > *Elements) |
Prepends all elements of another array list to this one. | |
ReferenceList (long initSize, int minimumFillRatio, int desiredFillRatio) | |
Creates a new array. | |
ReferenceList (long initSize) | |
Creates a new array. | |
ReferenceList () | |
Creates a new array. | |
bool | Remove (ELEMENTTYPE *Element) |
Deletes a given element from the array. | |
bool | Remove (long from, long count) |
Deletes multiple elements at a given range. | |
bool | Remove (long nr) |
Deletes an element at a given position. | |
void | RemoveAll () |
Deletes all elements from the array. | |
bool | RemoveFirst () |
Deletes the first element from the array. | |
bool | RemoveLast () |
Deletes the last element from the array. | |
ELEMENTTYPE * | Replace (ELEMENTTYPE *NewElement, long nr) |
Replaces an element by another one. | |
void | Shuffle () |
Shuffles all entries randomly. | |
void | Sort (int(*compare)(const ELEMENTTYPE *Element1, const ELEMENTTYPE *Element2)) |
Sorts the elements in the array according to a given comparison function. | |
void | Sort () |
Sorts the elements in the array according to the Compare method. | |
~ReferenceList () | |
Destroys the array. | |
Protected Member Functions | |
virtual void | AddElement (AutoDeleting *Element) |
virtual ArrayList< AutoDeleting > * | GetElements () const |
virtual void | RemoveElement (AutoDeleting *Element) |
Private Attributes | |
ArrayList< ELEMENTTYPE > * | Elements |
Static Private Attributes | |
const AutoDeleting * | ParameterConstraint |
|
Creates a new array.
|
|
Creates a new array.
|
|
Creates a new array.
|
|
Destroys the array. When deleting the array, all contained elements are also freed. |
|
Reimplemented from Reference. |
|
Appends an element to the array.
|
|
Appends all elements of another array list to this one.
|
|
Returns whether a given element is contained in this array. This method uses a given compare method to compare the elements.
|
|
Returns whether a given element is contained in this array. This method uses the Compare method to compare the elements.
|
|
Returns the 0-indexed position of a given element within the array list. This method uses a given compare method to compare the elements.
|
|
Returns the 0-indexed position of a given element within the array list. This method uses the Compare method to compare the elements.
|
|
Returns the element at a given position.
|
|
Returns the number of used array cells. This is the number of added objects.
|
|
Returns the fill ratio after an array resize.
|
|
Reimplemented from Reference. |
|
Returns the current fill ratio.
|
|
Returns the first element of the array. If the array is empty, the method returns NULL.
|
|
Returns the last element of the array. If the array is empty, the method returns NULL.
|
|
Returns the minimum fill ratio for the array.
|
|
|
|
Inserts an element before a given position. All elements at and after the position are moved by one.
|
|
Inserts all elements of another array list before a given position. All elements at and after the position are moved.
|
|
Returns, whether there are no elements in the array.
|
|
Prepends an element to the array.
|
|
Prepends all elements of another array list to this one.
|
|
Deletes a given element from the array. The element is searched, removed from the array and freed. If the element is not contained, nothing happens. If the element is contained multiple times, only one instance is deleted.
|
|
Deletes multiple elements at a given range. The elements are removed from the array and freed.
|
|
Deletes an element at a given position. The element is removed from the array and freed.
|
|
Deletes all elements from the array. All elements are removed from the array and freed. |
|
Reimplemented from Reference. |
|
Deletes the first element from the array. The element is removed from the array and freed. If the array is empty, nothing happens.
|
|
Deletes the last element from the array. The element is removed from the array and freed. If the array is empty, nothing happens.
|
|
Replaces an element by another one. The replaced element is not freed, but returned.
|
|
Shuffles all entries randomly.
|
|
Sorts the elements in the array according to a given comparison function. The whole array has a sorted order afterwards, but is not harmed at all in any other way. All elements remain the same.
|
|
Sorts the elements in the array according to the Compare method. The whole array has a sorted order afterwards, but is not harmed at all in any other way. All elements remain the same. |
|
Definition at line 100 of file Reference.h. |
|
Definition at line 102 of file Reference.h. |