KDStackArray Member List

This is the complete list of members for KDStackArray, including all inherited members.

Add(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
AllocatorType typedefBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(ARG &&x)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(ARGS &&... args)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(Block< typename std::remove_const< T >::type > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(Block< const T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(const Block< typename std::remove_const< T >::type > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(const Block< const T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(Block< typename std::remove_const< T >::type > &&values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(Block< const T > &&values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(MoveBlock< T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(const MoveBlock< T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(MoveBlock< T > &&values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(typename std::remove_const< T >::type(&array)[N])BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(const T(&array)[N])BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(BaseArray< T, CS, MF, A > &a)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(const BaseArray< T, CS, MF, A > &a)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(BaseArray< T, CS, MF, A > &&a)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Append(const std::initializer_list< T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
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)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >private
AppendAllImpl(BASEARRAY &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank1)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
AppendAllImpl(BLOCK &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank2)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
AppendBlock(const Block< const T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
AppendBlock(const MoveBlock< T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
ArrayBase(ARGS &&... args)ArrayBase< BaseArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >, T, BaseArrayData< T, DefaultAllocator, STD_IS_REPLACEMENT(empty, DefaultAllocator)>, DefaultCompare >explicit
ArrayBase0(ARGS &&... args)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >explicit
avoidMpCachelineInterferenceKDStackArray
BaseArray()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
BaseArray(const ALLOCATOR &a)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >explicit
BaseArray(ALLOCATOR &&a)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >explicit
BaseArray(BaseArray &&src)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
BaseArray(const Block< T > &block, Int capacity)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >private
BaseCollection(ARGS &&... args)BaseCollection< COLLECTION, SUPER >explicit
Begin() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Begin()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
CheckValidIndex(Int index) constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Collection(ARGS &&... args)Collection< COLLECTION, VALUETYPE, SUPER >explicit
Connect(const Block< T > &block, Int capacity=0)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
ConstIterator typedefBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Contains(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
ContainsAll(COLLECTION2 &&other) constBaseCollection< COLLECTION, SUPER >
ContainsAllImpl(COLLECTION2 &&other, OverloadRank0) constBaseCollection< COLLECTION, SUPER >
CopyFrom(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE)BaseCollection< COLLECTION, SUPER >
CopyFromImpl(BASEARRAY &&src, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank4)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >private
CopyFromImpl(BLOCK &&src, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank3)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >private
ArrayBase< BaseArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >, T, BaseArrayData< T, DefaultAllocator, STD_IS_REPLACEMENT(empty, DefaultAllocator)>, DefaultCompare >::CopyFromImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0)BaseCollection< COLLECTION, SUPER >
Disconnect()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
End() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
End()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
EnsureCapacity(Int requestedCapacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Erase(Int position, Int eraseCnt=1)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Erase(Iterator position, Int eraseCnt=1)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
EraseAll(typename ByValueParam< VALUETYPE >::type v)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
EraseFirst(typename ByValueParam< VALUETYPE >::type v)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Find(typename ByValueParam< VALUETYPE >::type v)Collection< COLLECTION, VALUETYPE, SUPER >
Find(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
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 >
FitToSize(Int newCapacity)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >private
Flush()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
ForEach(FN &&callback) constCollection< COLLECTION, VALUETYPE, SUPER >
ForEach(FN &&callback)Collection< COLLECTION, VALUETYPE, SUPER >
GetAllocator()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetAllocator() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetBlock(Int position, Block< const T, STRIDED > &block) constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetBlock(Int position, Block< T, STRIDED > &block)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetBlock(ConstIterator position, Block< const T, STRIDED > &block) constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetBlock(Iterator position, Block< T, STRIDED > &block)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetBlocks()ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetBlocks() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetCapacityCount() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetCount() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetFirst() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetFirst()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetHashCode() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetIndex(const T &x) constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetLast() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetLast()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetMapKey(const VALUETYPE &key)Collection< COLLECTION, VALUETYPE, SUPER >static
GetMemorySize() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
GetStridedBlocks()ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetStridedBlocks() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
GetUniqueHashCode() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
IncreaseCapacity(Int increment=1, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >private
Insert(Int position, ARG &&x)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, ARGS &&... args)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, Block< typename std::remove_const< T >::type > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, Block< const T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, const Block< typename std::remove_const< T >::type > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, const Block< const T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, Block< typename std::remove_const< T >::type > &&values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, Block< const T > &&values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, MoveBlock< T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, const MoveBlock< T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, MoveBlock< T > &&values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, BaseArray< T, CS, MF, A > &a)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, const BaseArray< T, CS, MF, A > &a)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, BaseArray< T, CS, MF, A > &&a)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Int position, const std::initializer_list< T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Insert(Iterator position, ARGS &&... args)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
InsertAll(Int index, COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
InsertBlock(Int position, const Block< const T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
InsertBlock(Int position, const MoveBlock< T > &values)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
InsertBlock(Iterator position, ARGS &&... args)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
InsertWithoutConstructor(Int idx, Int increment=1)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >private
Intersect(const COLLECTION2 &other)BaseCollection< COLLECTION, SUPER >
IntersectImpl(COLLECTION2 &&other, OverloadRank0)BaseCollection< COLLECTION, SUPER >
Intersects(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
IsBaseArray typedefBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
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 typedefBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
KINDArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >static
MAXON_DISALLOW_COPY_AND_ASSIGN(PerformanceBaseArray)PerformanceBaseArray< KDTreeNode * >private
MAXON_OPERATOR_MOVE_ASSIGNMENT(BaseArray)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
MoveAndShrink(BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR > &dst, Int position, Int moveCnt)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
operator ArrayImpl< BaseArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator > & >()ArrayBase< BaseArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >, T, BaseArrayData< T, DefaultAllocator, STD_IS_REPLACEMENT(empty, DefaultAllocator)>, DefaultCompare >
operator ArrayImpl< const BaseArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator > & >() constArrayBase< BaseArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >, T, BaseArrayData< T, DefaultAllocator, STD_IS_REPLACEMENT(empty, DefaultAllocator)>, DefaultCompare >
operator Block< Byte >()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
operator Block< const Byte >() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
operator const Block< const T > &() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
operator const Block< T > &()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
operator StridedBlock< const T >() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
operator StridedBlock< T >()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
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) constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
operator[](Int idx)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
PerformanceBaseArray()PerformanceBaseArray< KDTreeNode * >
Pop(T *dst=nullptr)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Reset()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Resize(Int newCnt, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::DEFAULT)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
SetCapacityHint(Int requestedCapacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
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 >
Subtract(COLLECTION2 &&other)BaseCollection< COLLECTION, SUPER >
SubtractImpl(COLLECTION2 &&other, OverloadRank0)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Super typedefBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
Swap(Iterator a, Iterator b)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
SwapErase(Int position, Int eraseCnt=1)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
SwapErase(Iterator position, Int eraseCnt=1)BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
ToArray()ArrayBase< BaseArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >, T, BaseArrayData< T, DefaultAllocator, STD_IS_REPLACEMENT(empty, DefaultAllocator)>, DefaultCompare >
ToArray() constArrayBase< BaseArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >, T, BaseArrayData< T, DefaultAllocator, STD_IS_REPLACEMENT(empty, DefaultAllocator)>, DefaultCompare >
ToBlock() constBaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
ToBlock()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >
ToString(const FormatStatement *formatStatement=nullptr) constBaseCollection< COLLECTION, SUPER >
type()Collection< COLLECTION, VALUETYPE, SUPER >
UnsafeAppend()PerformanceBaseArray< KDTreeNode * >
UnsafeAppend(const KDTreeNode * &x)PerformanceBaseArray< KDTreeNode * >
UnsafeAppend(KDTreeNode * &&x)PerformanceBaseArray< KDTreeNode * >
VALUETYPECollection< COLLECTION, VALUETYPE, SUPER >
ValueType typedefCollection< COLLECTION, VALUETYPE, SUPER >
VariadicAppend()Collection< COLLECTION, VALUETYPE, SUPER >
VariadicAppend(V &&value, VALUES &&... rest)Collection< COLLECTION, VALUETYPE, SUPER >
~BaseArray()BaseArray< T, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >