Nebula
Loading...
Searching...
No Matches
Util::PinnedArray< MAX_ALLOCS, TYPE > Member List

This is the complete list of members for Util::PinnedArray< MAX_ALLOCS, TYPE >, including all inherited members.

Append(const TYPE &first, const ELEM_TYPE &... elements)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Append(const TYPE &elm)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Append(const TYPE &&elm)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Util::Array::Append(TYPE &&elm)Util::Array< TYPE, SMALL_VECTOR_SIZE >
AppendArray(const PinnedArray< MAX_ALLOCS, TYPE > &src)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
AppendArray(const TYPE *arr, const SizeT count)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Util::Array::AppendArray(const Array< TYPE, SMALL_VECTOR_SIZE > &rhs)Util::Array< TYPE, SMALL_VECTOR_SIZE >
Array()Util::Array< TYPE, SMALL_VECTOR_SIZE >
Array(SizeT initialCapacity, SizeT initialGrow)Util::Array< TYPE, SMALL_VECTOR_SIZE >
Array(SizeT initialSize, SizeT initialGrow, const TYPE &initialValue)Util::Array< TYPE, SMALL_VECTOR_SIZE >
Array(const ArrayT &rhs)Util::Array< TYPE, SMALL_VECTOR_SIZE >
Array(ArrayT &&rhs) noexceptUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Array(std::initializer_list< TYPE > list)Util::Array< TYPE, SMALL_VECTOR_SIZE >
Array(std::nullptr_t)Util::Array< TYPE, SMALL_VECTOR_SIZE >
Array(const TYPE *const buf, SizeT num)Util::Array< TYPE, SMALL_VECTOR_SIZE >
ArrayT typedefUtil::Array< TYPE, SMALL_VECTOR_SIZE >
As() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Back() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Begin() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
begin() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
BinarySearchIndex(const TYPE &elm) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
BinarySearchIndex(typename std::enable_if< true, const KEYTYPE & >::type elm) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >inline
ByteSize() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Capacity() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
capacityUtil::Array< TYPE, SMALL_VECTOR_SIZE >protected
Clear()Util::Array< TYPE, SMALL_VECTOR_SIZE >
clear() noexceptUtil::Array< TYPE, SMALL_VECTOR_SIZE >
ConstBegin() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
ConstEnd() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
ConstIterator typedefUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Copy(const PinnedArray< MAX_ALLOCS, TYPE > &src)Util::PinnedArray< MAX_ALLOCS, TYPE >inlineprivate
Util::Array::Copy(const Array< TYPE, SMALL_VECTOR_SIZE > &src)Util::Array< TYPE, SMALL_VECTOR_SIZE >protected
CopyRange(TYPE *to, TYPE *from, SizeT num)Util::Array< TYPE, SMALL_VECTOR_SIZE >inlineprotected
countUtil::Array< TYPE, SMALL_VECTOR_SIZE >protected
Delete()Util::PinnedArray< MAX_ALLOCS, TYPE >inlineprivate
Destroy(TYPE *elm)Util::Array< TYPE, SMALL_VECTOR_SIZE >protected
DestroyRange(IndexT fromIndex, IndexT toIndex)Util::Array< TYPE, SMALL_VECTOR_SIZE >inlineprotected
Difference(const Array< TYPE, SMALL_VECTOR_SIZE > &rhs)Util::Array< TYPE, SMALL_VECTOR_SIZE >
elementsUtil::Array< TYPE, SMALL_VECTOR_SIZE >protected
Emplace()Util::PinnedArray< MAX_ALLOCS, TYPE >inline
EmplaceArray(const SizeT count)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
End() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
end() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Erase(Iterator iter)Util::Array< TYPE, SMALL_VECTOR_SIZE >
EraseBack()Util::Array< TYPE, SMALL_VECTOR_SIZE >
EraseFront()Util::Array< TYPE, SMALL_VECTOR_SIZE >
EraseIndex(IndexT index)Util::Array< TYPE, SMALL_VECTOR_SIZE >
EraseIndexSwap(IndexT index)Util::Array< TYPE, SMALL_VECTOR_SIZE >
EraseRange(IndexT start, IndexT end)Util::Array< TYPE, SMALL_VECTOR_SIZE >
EraseSwap(Iterator iter)Util::Array< TYPE, SMALL_VECTOR_SIZE >
Extend(SizeT num)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Fill(IndexT first, SizeT num, const TYPE &elm)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Find(const TYPE &elm, const IndexT start=0) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
FindIndex(const TYPE &elm, const IndexT start=0) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
FindIndex(typename std::enable_if< true, const KEYTYPE & >::type elm, const IndexT start=0) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >inline
Fit()Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Free()Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Front() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Get(IndexT index) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >inline
growUtil::Array< TYPE, SMALL_VECTOR_SIZE >protected
Grow()Util::PinnedArray< MAX_ALLOCS, TYPE >inlineprivate
GrowTo(SizeT newCapacity)Util::PinnedArray< MAX_ALLOCS, TYPE >inlineprivate
Insert(IndexT index, const TYPE &elm)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
InsertAtEndOfIdenticalRange(IndexT startIndex, const TYPE &elm)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
InsertSorted(const TYPE &elm)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
IsEmpty() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
IsSorted() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
IsValidIndex(IndexT index) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Iterator typedefUtil::Array< TYPE, SMALL_VECTOR_SIZE >
MaxGrowSizeUtil::Array< TYPE, SMALL_VECTOR_SIZE >protectedstatic
MinGrowSizeUtil::Array< TYPE, SMALL_VECTOR_SIZE >protectedstatic
Move(IndexT fromIndex, IndexT toIndex)Util::PinnedArray< MAX_ALLOCS, TYPE >inlineprivate
MoveRange(TYPE *to, TYPE *from, SizeT num)Util::Array< TYPE, SMALL_VECTOR_SIZE >inlineprotected
operator!=(const Array< TYPE, SMALL_VECTOR_SIZE > &rhs) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
operator=(const PinnedArray< MAX_ALLOCS, TYPE > &rhs)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
operator=(PinnedArray< MAX_ALLOCS, TYPE > &&rhs) noexceptUtil::PinnedArray< MAX_ALLOCS, TYPE >inline
Util::Array::operator=(const Array< TYPE, SMALL_VECTOR_SIZE > &rhs)Util::Array< TYPE, SMALL_VECTOR_SIZE >
Util::Array::operator=(Array< TYPE, SMALL_VECTOR_SIZE > &&rhs) noexceptUtil::Array< TYPE, SMALL_VECTOR_SIZE >
operator==(const Array< TYPE, SMALL_VECTOR_SIZE > &rhs) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
operator[](IndexT index) constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
operator[](IndexT index)Util::Array< TYPE, SMALL_VECTOR_SIZE >
PinnedArray()Util::PinnedArray< MAX_ALLOCS, TYPE >inline
PinnedArray(const PinnedArray< MAX_ALLOCS, TYPE > &rhs)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
PinnedArray(SizeT capacity, SizeT grow)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
PinnedArray(SizeT initialSize, SizeT grow, const TYPE &initialValue)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
PinnedArray(const TYPE *const buf, SizeT num)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
PinnedArray(std::initializer_list< TYPE > list)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
PopBack()Util::Array< TYPE, SMALL_VECTOR_SIZE >inline
PopFront()Util::Array< TYPE, SMALL_VECTOR_SIZE >inline
push_back(const TYPE &item)Util::Array< TYPE, SMALL_VECTOR_SIZE >
QuickSort()Util::Array< TYPE, SMALL_VECTOR_SIZE >
QuickSortWithFunc(int(*func)(const void *lhs, const void *rhs))Util::Array< TYPE, SMALL_VECTOR_SIZE >
Realloc(SizeT capacity, SizeT grow)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Reserve(const SizeT count)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Reset()Util::Array< TYPE, SMALL_VECTOR_SIZE >
Resize(SizeT num)Util::PinnedArray< MAX_ALLOCS, TYPE >inline
Util::Array::Resize(SizeT num, ARGS... args)Util::Array< TYPE, SMALL_VECTOR_SIZE >
resize(size_t size)Util::Array< TYPE, SMALL_VECTOR_SIZE >
size() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Size() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >
Sort()Util::Array< TYPE, SMALL_VECTOR_SIZE >
SortWithFunc(bool(*func)(const TYPE &lhs, const TYPE &rhs))Util::Array< TYPE, SMALL_VECTOR_SIZE >
stackElementsUtil::Array< TYPE, SMALL_VECTOR_SIZE >protected
TypeSize() constUtil::Array< TYPE, SMALL_VECTOR_SIZE >inline
~Array()Util::Array< TYPE, SMALL_VECTOR_SIZE >
~PinnedArray()Util::PinnedArray< MAX_ALLOCS, TYPE >inline