DefaultSortedArray< T > Member List

This is the complete list of members for DefaultSortedArray< T >, including all inherited members.

_arraySortedArray< DefaultSortedArray< T >, BaseArray< T > >mutableprivate
_sortedSortedArray< DefaultSortedArray< T >, BaseArray< T > >mutableprivate
Add(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Append(ARGS &&... args)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
AppendAll(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)BaseCollection< COLLECTION, SUPER >
AppendAllImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
AppendPtr(TYPE *x)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
ArrayBase(ARGS &&... args)ArrayBase< COLLECTION, VALUETYPE, SUPER, HASH >explicit
ArrayBase0(ARGS &&... args)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >explicit
BaseCollection(ARGS &&... args)BaseCollection< COLLECTION, SUPER >explicit
Begin() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
Begin()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
CheckSort() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >private
CheckValidIndex(Int index) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Collection(ARGS &&... args)Collection< COLLECTION, VALUETYPE, SUPER >explicit
ConstIterator typedefSortedArray< DefaultSortedArray< T >, BaseArray< T > >
Contains(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
ContainsAll(COLLECTION2 &&other) constBaseCollection< COLLECTION, SUPER >
ContainsAllImpl(COLLECTION2 &&other, OverloadRank0) constBaseCollection< COLLECTION, SUPER >
CopyFrom(const SortedArray &src)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
CopyFrom(COLLECTION2 &&other)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
maxon::ArrayBase::CopyFrom(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE)BaseCollection< COLLECTION, SUPER >
CopyFromImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0)BaseCollection< COLLECTION, SUPER >
DefaultSortedArray()DefaultSortedArray< T >
DefaultSortedArray(DefaultSortedArray &&src)DefaultSortedArray< T >
DoSort() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >private
End() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
End()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
Erase(Int position, Int eraseCnt=1)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
Erase(Iterator position, Int eraseCnt=1)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
EraseAll(typename ByValueParam< VALUETYPE >::type v)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
EraseFirst(typename ByValueParam< VALUETYPE >::type v)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
EraseKey(const SEARCH &key)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
ErasePtr(Int position, TYPE **dst)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
Find(typename ByValueParam< VALUETYPE >::type v)Collection< COLLECTION, VALUETYPE, SUPER >
Find(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
FindIndex(const SEARCH &key) constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
maxon::ArrayBase::FindIndex(typename ByValueParam< VALUETYPE >::type v, Int start) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
maxon::Collection::FindIndex(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
FindLastIndex(typename ByValueParam< VALUETYPE >::type v) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
FindLastIndex(typename ByValueParam< VALUETYPE >::type v, Int start) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
FindValue(const SEARCH &key)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
FindValue(const SEARCH &key) constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
Flush()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
ForEach(FN &&callback) constCollection< COLLECTION, VALUETYPE, SUPER >
ForEach(FN &&callback)Collection< COLLECTION, VALUETYPE, SUPER >
GetBlock(Int position, Block< TYPE, STRIDED > &block)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetBlock(Int position, Block< const TYPE, STRIDED > &block) constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetBlocks()ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetBlocks() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetCapacityCount() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetCount() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetFirst() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetFirst()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetHashCode() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetIndex(const TYPE &x) constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetLast() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetLast()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetMapKey(const VALUETYPE &key)Collection< COLLECTION, VALUETYPE, SUPER >static
GetMemorySize() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetStridedBlocks()ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetStridedBlocks() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetUnderlyingArray()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetUnderlyingArray() constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
GetUniqueHashCode() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
InitInsertData(T &initme, const SEARCH &key)DefaultSortedArray< T >static
Insert(Int position, ARGS &&... args)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
Insert(Iterator position, ARGS &&... args)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
InsertAll(Int index, COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
InsertBlock(Int position, ARGS &&... args)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
InsertBlock(Iterator position, ARGS &&... args)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
InsertPtr(Int position, TYPE *x)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
InsertValue(const SEARCH &key)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
InsertValue(const SEARCH &key, Bool &newElement, Int *index=nullptr)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
Intersect(const COLLECTION2 &other)BaseCollection< COLLECTION, SUPER >
IntersectImpl(COLLECTION2 &&other, OverloadRank0)BaseCollection< COLLECTION, SUPER >
Intersects(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
IsBaseArray typedefBaseCollection< COLLECTION, SUPER >
IsCollection typedefBaseCollection< COLLECTION, SUPER >
IsEmpty() constBaseCollection< COLLECTION, SUPER >
IsEqual(const T &a, const T &b)DefaultSortedArray< T >static
SortedArray< DefaultSortedArray< T >, BaseArray< T > >::IsEqual(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) constBaseCollection< COLLECTION, SUPER >
IsEqualImpl(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
IsPopulated() constBaseCollection< COLLECTION, SUPER >
IsValidIndex(Int index) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Iterator typedefSortedArray< DefaultSortedArray< T >, BaseArray< T > >
KINDArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >static
LessThan(const T &a, const T &b)DefaultSortedArray< T >static
MAXON_DISALLOW_COPY_AND_ASSIGN(SortedArray)SortedArray< DefaultSortedArray< T >, BaseArray< T > >private
MAXON_OPERATOR_MOVE_ASSIGNMENT(DefaultSortedArray)DefaultSortedArray< T >
SortedArray< DefaultSortedArray< T >, BaseArray< T > >::MAXON_OPERATOR_MOVE_ASSIGNMENT(SortedArray)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
operator ArrayImpl< COLLECTION & >()ArrayBase< COLLECTION, VALUETYPE, SUPER, HASH >
operator ArrayImpl< const COLLECTION & >() constArrayBase< COLLECTION, VALUETYPE, SUPER, HASH >
operator ValueReceiver< const VALUETYPE & >()Collection< COLLECTION, VALUETYPE, SUPER >
operator ValueReceiver< typename std::conditional< STD_IS_REPLACEMENT(scalar, VALUETYPE)Collection< COLLECTION, VALUETYPE, SUPER >
operator ValueReceiver< VALUETYPE && >()Collection< COLLECTION, VALUETYPE, SUPER >
operator!=(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
operator==(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
operator[](Int idx) constSortedArray< DefaultSortedArray< T >, BaseArray< T > >
Pop(TYPE *dst=nullptr)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
PopPtr(TYPE **dst)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
Reset()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
Resize(Int newCnt, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::DEFAULT)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
SetCapacityHint(Int requestedCapacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
Slice(Int start)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Slice(Int start) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Slice(Int start, Int end)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Slice(Int start, Int end) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Sort()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
SortChanged()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
SortedArray()SortedArray< DefaultSortedArray< T >, BaseArray< T > >
SortedArray(const typename ARRAY::AllocatorType &a)SortedArray< DefaultSortedArray< T >, BaseArray< T > >explicit
SortedArray(SortedArray &&src)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
Subtract(COLLECTION2 &&other)BaseCollection< COLLECTION, SUPER >
SubtractImpl(COLLECTION2 &&other, OverloadRank0)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Super typedefArrayBase< COLLECTION, VALUETYPE, SUPER, HASH >private
Swap(Iterator a, Iterator b)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
SwapErase(Int position, Int eraseCnt=1)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
SwapErase(Iterator position, Int eraseCnt=1)SortedArray< DefaultSortedArray< T >, BaseArray< T > >
ToArray()ArrayBase< COLLECTION, VALUETYPE, SUPER, HASH >
ToArray() constArrayBase< COLLECTION, VALUETYPE, SUPER, HASH >
ToString(const FormatStatement *formatStatement=nullptr) constBaseCollection< COLLECTION, SUPER >
type()Collection< COLLECTION, VALUETYPE, SUPER >
TYPE typedefSortedArray< DefaultSortedArray< T >, BaseArray< T > >
VALUETYPECollection< COLLECTION, VALUETYPE, SUPER >
ValueType typedefCollection< COLLECTION, VALUETYPE, SUPER >
VariadicAppend()Collection< COLLECTION, VALUETYPE, SUPER >
VariadicAppend(V &&value, VALUES &&... rest)Collection< COLLECTION, VALUETYPE, SUPER >
~SortedArray()SortedArray< DefaultSortedArray< T >, BaseArray< T > >