SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL > Member List

This is the complete list of members for SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >, including all inherited members.

_arraySortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >mutableprivate
_sortedSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >mutableprivate
Add(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Append(ARGS &&... args)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
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< MYSELF, ARRAY, FLAGS, PARALLEL >
ArrayBase(ARGS &&... args)ArrayBase< SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false >, ARRAY::ValueType, EmptyClass, MYSELF >explicit
ArrayBase0(ARGS &&... args)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >explicit
BaseCollection(ARGS &&... args)BaseCollection< COLLECTION, SUPER >explicit
Begin() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
Begin()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
CheckSort() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >private
CheckValidIndex(Int index) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Collection(ARGS &&... args)Collection< COLLECTION, VALUETYPE, SUPER >explicit
Compare(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
CompareImpl(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
ConstIterator typedefSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
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< MYSELF, ARRAY, FLAGS, PARALLEL >
CopyFrom(COLLECTION2 &&other)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
ArrayBase< SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false >, ARRAY::ValueType, EmptyClass, MYSELF >::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 >
DoSort() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >private
End() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
End()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
Erase(Int position, Int eraseCnt=1)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
Erase(Iterator position, Int eraseCnt=1)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
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< MYSELF, ARRAY, FLAGS, PARALLEL >
ErasePtr(Int position, TYPE **dst)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
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< MYSELF, ARRAY, FLAGS, PARALLEL >
ArrayBase< SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false >, ARRAY::ValueType, EmptyClass, MYSELF >::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< MYSELF, ARRAY, FLAGS, PARALLEL >
FindValue(const SEARCH &key) constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
Flush()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
ForEach(FN &&callback) constCollection< COLLECTION, VALUETYPE, SUPER >
ForEach(FN &&callback)Collection< COLLECTION, VALUETYPE, SUPER >
GetBlock(Int position, Block< TYPE, STRIDED > &block)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetBlock(Int position, Block< const TYPE, STRIDED > &block) constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetBlocks()ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetBlocks() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetCapacityCount() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetCount() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetFirst() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetFirst()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetHashCode() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetIndex(const TYPE &x) constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetLast() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetLast()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetMapKey(const VALUETYPE &key)Collection< COLLECTION, VALUETYPE, SUPER >static
GetMemorySize() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetStridedBlocks()ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetStridedBlocks() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetUnderlyingArray()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetUnderlyingArray() constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
GetUniqueHashCode() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Insert(Int position, ARGS &&... args)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
Insert(Iterator position, ARGS &&... args)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
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< MYSELF, ARRAY, FLAGS, PARALLEL >
InsertBlock(Iterator position, ARGS &&... args)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
InsertPtr(Int position, TYPE *x)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
InsertValue(const SEARCH &key)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
InsertValue(const SEARCH &key, Bool &newElement, Int *index=nullptr)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
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 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< MYSELF, ARRAY, FLAGS, PARALLEL >
KINDArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >static
MAXON_DISALLOW_COPY_AND_ASSIGN(SortedArray)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >private
MAXON_OPERATOR_MOVE_ASSIGNMENT(SortedArray)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
operator ArrayImpl< const SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false > & >() constArrayBase< SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false >, ARRAY::ValueType, EmptyClass, MYSELF >
operator ArrayImpl< SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false > & >()ArrayBase< SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false >, ARRAY::ValueType, EmptyClass, MYSELF >
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) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
operator<=(const COLLECTION2 &other) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
operator==(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
operator>(const COLLECTION2 &other) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
operator>=(const COLLECTION2 &other) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
operator[](Int idx) constSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
Pop(TYPE *dst=nullptr)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
PopPtr(TYPE **dst)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
Reset()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
Resize(Int newCnt, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::DEFAULT)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
SetCapacityHint(Int requestedCapacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
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< MYSELF, ARRAY, FLAGS, PARALLEL >
SortChanged()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
SortedArray()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
SortedArray(const typename ARRAY::AllocatorType &a)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >explicit
SortedArray(SortedArray &&src)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
Subtract(COLLECTION2 &&other)BaseCollection< COLLECTION, SUPER >
SubtractImpl(COLLECTION2 &&other, OverloadRank0)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Super typedefArrayBase< SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false >, ARRAY::ValueType, EmptyClass, MYSELF >private
Swap(Iterator a, Iterator b)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
SwapErase(Int position, Int eraseCnt=1)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
SwapErase(Iterator position, Int eraseCnt=1)SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
ToArray()ArrayBase< SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false >, ARRAY::ValueType, EmptyClass, MYSELF >
ToArray() constArrayBase< SortedArray< MYSELF, ARRAY, BASESORTFLAGS::NONE, false >, ARRAY::ValueType, EmptyClass, MYSELF >
ToString(const FormatStatement *formatStatement=nullptr) constBaseCollection< COLLECTION, SUPER >
type()Collection< COLLECTION, VALUETYPE, SUPER >
TYPE typedefSortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >
ValueType typedefCollection< COLLECTION, VALUETYPE, SUPER >
VALUETYPECollection< COLLECTION, VALUETYPE, SUPER >
VariadicAppend()Collection< COLLECTION, VALUETYPE, SUPER >
VariadicAppend(V &&value, VALUES &&... rest)Collection< COLLECTION, VALUETYPE, SUPER >
~SortedArray()SortedArray< MYSELF, ARRAY, FLAGS, PARALLEL >