template<typename>
class Geo::GeoArray

Basic templated dynamic array class.

This contains roughly the same functionality as the std::vector class, but gives more control over the internal memory it uses.

Functions

Typedefs

Variables

Geo::GeoArray< T >::~GeoArray

public: ~GeoArray()

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

ValueType& Geo::GeoArray< T >::Back

public: ValueType & Back()

Non constant access to final entry.

const ValueType& Geo::GeoArray< T >::Back

public: const ValueType & Back() const

Constant access to final entry.

const ValueType* Geo::GeoArray< T >::Begin

public: const ValueType * Begin() const

Return iterator similar to vector::begin()

ValueType* Geo::GeoArray< T >::Begin

public: ValueType * Begin()

Return iterator similar to vector::begin()

void Geo::GeoArray< T >::Clear

public: void Clear()

Remove all elements from the array.

The capacity of the array remains unchanged, which means that no memory is deallocated.

bool Geo::GeoArray< T >::Contains

public: bool Contains
(
    const T & x
) const

Returns true if the array contains x.

void Geo::GeoArray< T >::Emplace

public: void Emplace
(
    s32 index,
    U && elem
)

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

bool Geo::GeoArray< T >::EmplaceBack

public: bool EmplaceBack
(
    U && elem
)

Add the specified element to the end of the array.

void Geo::GeoArray< T >::EmplaceBackFast

protected: void EmplaceBackFast
(
    U && elem
)

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

void Geo::GeoArray< T >::EmplaceFast

public: void EmplaceFast
(
    s32 index,
    U && elem
)

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.

const ValueType* Geo::GeoArray< T >::End

public: const ValueType * End() const

Return iterator similar to vector::end()

ValueType* Geo::GeoArray< T >::End

public: ValueType * End()

Return iterator similar to vector::end()

ValueType& Geo::GeoArray< T >::Front

public: ValueType & Front()

Non constant access to final entry.

const ValueType& Geo::GeoArray< T >::Front

public: const ValueType & Front() const

Constant access to final entry.

Geo::GeoArray< T >::GeoArray

public: GeoArray
(
    GeoArray && srcArray
)

Move constructor.

Geo::GeoArray< T >::GeoArray

public: GeoArray
(
    const CompatT * srcArray,
    s32 length
)

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

Geo::GeoArray< T >::GeoArray

public: GeoArray
(
    s32 initCapacity
)

Construct an empty array with the default capacity.

Geo::GeoArray< T >::GeoArray

public: GeoArray
(
    s32 numCopies,
    const T & value
)

Construct with the specified value replicated numCopies times.

Geo::GeoArray< T >::GeoArray

public: GeoArray
(
    const GeoArray< CompatT > & srcArray
)

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

Geo::GeoArray< T >::GeoArray

public: GeoArray
(
    const GeoArray & srcArray
)

Construct a copy of the specified array.

ValueType* Geo::GeoArray< T >::GetArray

public: ValueType * GetArray()

Give access to the internal array.

const ValueType* Geo::GeoArray< T >::GetArray

public: const ValueType * GetArray() const

Remove all elements from the array.

The capacity of the array remains unchanged, which means that no memory is deallocated.

const ValueType* Geo::GeoArray< T >::GetArrayConst

public: const ValueType * GetArrayConst() const

Remove all elements from the array.

The capacity of the array remains unchanged, which means that no memory is deallocated.

s32 Geo::GeoArray< T >::GetCapacity

public: s32 GetCapacity() const

Returns the number of array entries available at the moment.

s32 Geo::GeoArray< T >::GetMemoryUsage

public: s32 GetMemoryUsage() const

Memory used for array storage.

s32 Geo::GeoArray< T >::GetSize

public: s32 GetSize() const

Return the number of array entries currently in use.

bool Geo::GeoArray< T >::Init

protected: bool Init
(
    s32 initCapacity
)

Common initialisation code called by all constructors.

void Geo::GeoArray< T >::Insert

public: void Insert
(
    s32 index,
    const T & elem
)

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

void Geo::GeoArray< T >::Insert

public: void Insert
(
    s32 index,
    T && elem
)

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

void Geo::GeoArray< T >::InsertFast

public: void InsertFast
(
    s32 index,
    T && elem
)

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.

void Geo::GeoArray< T >::InsertFast

public: void InsertFast
(
    s32 index,
    const T & elem
)

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.

bool Geo::GeoArray< T >::IsEmpty

public: bool IsEmpty() const

Returns true if the array is empty.

bool Geo::GeoArray< T >::IsFull

public: bool IsFull() const

Returns true if the array is full.

ValueType& Geo::GeoArray< T >::operator[]

public: ValueType & operator[]
(
    s32 i
)

Non constant array access.

const ValueType& Geo::GeoArray< T >::operator[]

public: const ValueType & operator[]
(
    s32 i
) const

Constant array access.

GeoArray& Geo::GeoArray< T >::operator=

public: GeoArray & operator=
(
    GeoArray && srcArray
)

Move assignment operator.

GeoArray& Geo::GeoArray< T >::operator=

public: GeoArray & operator=
(
    const GeoArray< CompatT > & srcArray
)

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

GeoArray& Geo::GeoArray< T >::operator=

public: GeoArray & operator=
(
    const GeoArray & srcArray
)

Assignment operator.

bool Geo::GeoArray< T >::Pop

public: bool Pop()

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

void Geo::GeoArray< T >::PopFast

protected: void PopFast()

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

bool Geo::GeoArray< T >::Push

public: bool Push
(
    const T & elem
)

Add the specified element to the end of the array.

bool Geo::GeoArray< T >::Push

public: bool Push
(
    T && elem
)

Add the specified element to the end of the array.

void Geo::GeoArray< T >::PushFast

protected: void PushFast
(
    T && elem
)

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

void Geo::GeoArray< T >::PushFast

protected: void PushFast
(
    const T & elem
)

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

void Geo::GeoArray< T >::Remove

public: void Remove
(
    s32 index
)

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

void Geo::GeoArray< T >::RemoveFast

public: void RemoveFast
(
    s32 index
)

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

bool Geo::GeoArray< T >::Resize

public: bool Resize
(
    s32 newSize,
    const T & elem
)

Resize the array.

If the new size is larger than the current size than new elements of value 'elem' are added. If the new size is smaller than the current size then the elements closest to the end of the array are deleted until the current size is equal to the new size. The memory for the array gets reallocated if the new size is larger than the current capacity. In the reallocation it is tried to grow the capacity by 50 %, or if the new size is larger than that then the new capacity is set to the new size.

Parameters

Return Value

bool Geo::GeoArray< T >::SetCapacity

public: bool SetCapacity
(
    s32 newCapacity
)

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

Parameters

Return Value

void Geo::GeoArray< T >::Swap

public: void Swap
(
    GeoArray & other
)

Swap the contents of two arrays.

This function does not re-allocate any memory. If A = {0, 1, 2} and B = {3, 4} then A.Swap(B) results in A = {3, 4} and B = {0, 1, 2}.

Parameters