const T * const_iterator

The simplest possible const_iterator type (a raw pointer).

const T * const_pointer

STL style typedefs that mark us as being a random access container.

const T & const_reference

STL style typedefs that mark us as being a random access container.

T * iterator

The simplest possible iterator type (a raw pointer).

std::random_access_iterator_tag iterator_category

STL style typedefs that mark us as being a random access container.

T * pointer

STL style typedefs that mark us as being a random access container.

T & reference

STL style typedefs that mark us as being a random access container.

s32 size_type

STL style typedefs that mark us as being a random access container.

T value_type

STL style typedefs that mark us as being a random access container.

T ValueType

Alias for our storage type.

~GeoArray()

Destructor calls destructor on all elements in the array and frees the memory.

back()

Forwarding functions with Stl naming convention.

back()

Forwarding functions with Stl naming convention.

Back()

Non constant access to final entry.

Back()

Constant access to final entry.

begin()

Forwarding functions with Stl naming convention.

begin()

Forwarding functions with Stl naming convention.

Begin()

Return iterator similar to vector::begin()

Begin()

Return iterator similar to vector::begin()

Clear()

Remove all elements from the array.

Contains(const T &)

Returns true if the array contains x.

Emplace(s32, U &&)

Insert an element at the specified index, elements already in the array at that index and above are shuffled up.

EmplaceBack(U &&)

Add the specified element to the end of the array.

EmplaceBackFast(U &&)

Fast version of push that doesn't do any checking in release.

EmplaceFast(s32, U &&)

Inserts elem at index, and moves whatever is currently at the index to the end of the array, thus not preserving order or existing indices.

empty()

Forwarding functions with Stl naming convention.

end()

Forwarding functions with Stl naming convention.

end()

Forwarding functions with Stl naming convention.

End()

Return iterator similar to vector::end()

End()

Return iterator similar to vector::end()

front()

Forwarding functions with Stl naming convention.

front()

Forwarding functions with Stl naming convention.

Front()

Non constant access to final entry.

Front()

Constant access to final entry.

GeoArray(s32)

Construct an empty array with the default capacity.

GeoArray(const GeoArray &)

Construct a copy of the specified array.

GeoArray(s32, const T &)

Construct with the specified value replicated numCopies times.

GeoArray(GeoArray &&)

Move constructor.

GeoArray(const CompatT *, s32)

Construct a copy of the specified array - The compiler must be able to resolve T = CompatT.

GeoArray(const GeoArray< CompatT > &)

Construct a copy of the specified array - The compiler must be able to resolve T = CompatT.

GetArray()

Give access to the internal array.

GetArray()

Remove all elements from the array.

GetArrayConst()

Remove all elements from the array.

GetCapacity()

Returns the number of array entries available at the moment.

GetMemoryUsage()

Memory used for array storage.

GetSize()

Return the number of array entries currently in use.

Init(s32)

Common initialisation code called by all constructors.

Insert(s32, const T &)

Insert an element at the specified index, elements already in the array at that index and above are shuffled up.

Insert(s32, T &&)

Insert an element at the specified index, elements already in the array at that index and above are shuffled up.

InsertFast(s32, T &&)

Inserts elem at index, and moves whatever is currently at the index to the end of the array, thus not preserving order or existing indices.

InsertFast(s32, const T &)

Inserts elem at index, and moves whatever is currently at the index to the end of the array, thus not preserving order or existing indices.

IsEmpty()

Returns true if the array is empty.

IsFull()

Returns true if the array is full.

operator[](s32)

Constant array access.

operator[](s32)

Non constant array access.

operator=(GeoArray &&)

Move assignment operator.

operator=(const GeoArray< CompatT > &)

Assignment operator - The compiler must be able to resolve T = CompatT.

operator=(const GeoArray &)

Assignment operator.

Pop()

Remove the element with the highest index (if there is one)

pop_back()

Forwarding functions with Stl naming convention.

PopFast()

Fast version of pop that doesn't do any checking in release.

Push(const T &)

Add the specified element to the end of the array.

Push(T &&)

Add the specified element to the end of the array.

push_back(const_reference)

Forwarding functions with Stl naming convention.

PushFast(T &&)

Fast version of push that doesn't do any checking in release.

PushFast(const T &)

Fast version of push that doesn't do any checking in release.

Remove(s32)

Remove the element at the specified index, elements at higher indices are shuffled down.

RemoveFast(s32)

Moves the end of the array into the element to be removed, thus not preserving order or existing indices.

Resize(s32, const T &)

Resize the array.

Resize(s32)

Resize the array.

ResizeCapacity(s32)

Ensure sufficient capacity for Resize operations.

SetCapacity(s32)

Change the array's capacity, reallocating memory if the new capacity is different to the current capacity.

Swap(GeoArray &)

Swap the contents of two arrays.

ValueType * m_Data

Pointer to start of array memory.

ValueType * m_DataEnd

Pointer to 1 after end of array memory.

ValueType * m_End

Pointer to next free slot.