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< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
AllocatorType typedefBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Append()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Append(const KDTreeNode * &x)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Append(KDTreeNode * &&x)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Append(const Block< const KDTreeNode * > &values)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Append(const MoveBlock< KDTreeNode * > &values)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Append(const std::initializer_list< KDTreeNode * > &values)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
AppendAll(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)BaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
AppendAllImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >private
ArrayBase(ARGS &&... args)ArrayBase< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >explicit
ArrayBase0(ARGS &&... args)ArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >explicit
avoidMpCachelineInterferenceKDStackArray
BaseArray()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
BaseArray(const DefaultAllocator &a)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >explicit
BaseArray(DefaultAllocator &&a)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >explicit
BaseArray(BaseArray &&src)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
BaseArray(const Block< KDTreeNode * > &block, Int capacity)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >private
BaseCollection(ARGS &&... args)BaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >explicit
Begin() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Begin()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
CheckValidIndex(Int index) constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
Collection(ARGS &&... args)Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >explicit
Connect(const Block< KDTreeNode * > &block, Int capacity=0)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
ConstIterator typedefBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Contains(typename ByValueParam< KDTreeNode * >::type v) constCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
ContainsAll(COLLECTION2 &&other) constBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
ContainsAllImpl(COLLECTION2 &&other, OverloadRank0) constBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
CopyFrom(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE)BaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
CopyFromImpl(BASEARRAY &&src, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank4)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >private
CopyFromImpl(BLOCK &&src, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank3)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >private
ArrayBase< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >::CopyFromImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0)BaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
Disconnect()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
End() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
End()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
EnsureCapacity(Int requestedCapacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Erase(Int position, Int eraseCnt=1)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Erase(Iterator position, Int eraseCnt=1)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
EraseAll(typename ByValueParam< KDTreeNode * >::type v)ArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
EraseFirst(typename ByValueParam< KDTreeNode * >::type v)ArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
Find(typename ByValueParam< KDTreeNode * >::type v)Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
Find(typename ByValueParam< KDTreeNode * >::type v) constCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
FindIndex(typename ByValueParam< KDTreeNode * >::type v, Int start) constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >::FindIndex(typename ByValueParam< KDTreeNode * >::type v) constCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
FindLastIndex(typename ByValueParam< KDTreeNode * >::type v) constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
FindLastIndex(typename ByValueParam< KDTreeNode * >::type v, Int start) constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
FitToSize(Int newCapacity)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >private
Flush()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
ForEach(FN &&callback)Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
GetAllocator()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetAllocator() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetBlock(Int position, Block< const KDTreeNode *, STRIDED > &block) constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetBlock(Int position, Block< KDTreeNode *, STRIDED > &block)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetBlock(ConstIterator position, Block< const KDTreeNode *, STRIDED > &block) constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetBlock(Iterator position, Block< KDTreeNode *, STRIDED > &block)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetBlocks()ArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
GetBlocks() constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
GetCapacityCount() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetCount() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetFirst() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetFirst()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetHashCode() constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
GetIndex(const KDTreeNode * &x) constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetLast() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetLast()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetMapKey(const KDTreeNode * &key)Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >static
GetMemorySize() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
GetStridedBlocks()ArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
GetStridedBlocks() constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
IncreaseCapacity(Int increment=1, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >private
Insert(Int position)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Iterator position)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Int position, const KDTreeNode * &x)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Iterator position, const KDTreeNode * &x)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Int position, KDTreeNode * &&x)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Iterator position, KDTreeNode * &&x)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Int position, const Block< const KDTreeNode * > &values)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Int position, const std::initializer_list< KDTreeNode * > &values)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Int position, const MoveBlock< KDTreeNode * > &values)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Iterator position, const Block< const KDTreeNode * > &values)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Insert(Iterator position, const std::initializer_list< KDTreeNode * > &values)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
InsertAll(Int index, COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)ArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
InsertWithoutConstructor(Int idx, Int increment=1)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >private
Intersect(const COLLECTION2 &other)BaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
IntersectImpl(COLLECTION2 &&other, OverloadRank0)BaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
Intersects(const COLLECTION2 &other) constBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
IsCollection typedefBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
IsEmpty() constBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
IsEqual(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) constBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
IsEqualImpl(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
IsPopulated() constBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
IsValidIndex(Int index) constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
Iterator typedefBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
KINDArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >static
MAXON_DISALLOW_COPY_AND_ASSIGN(PerformanceBaseArray)PerformanceBaseArray< KDTreeNode * >private
MAXON_OPERATOR_MOVE_ASSIGNMENT(BaseArray)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
MoveAndShrink(BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > &dst, Int position, Int moveCnt)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
operator ArrayImpl< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > & >()ArrayBase< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
operator ArrayImpl< const BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > & >() constArrayBase< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
operator Block< Byte >()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
operator Block< const Byte >() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
operator const Block< const KDTreeNode * > &() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
operator const Block< KDTreeNode * > &()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
operator StridedBlock< const KDTreeNode * >() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
operator StridedBlock< KDTreeNode * >()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
operator ValueReceiver< const KDTreeNode * & >()Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
operator ValueReceiver< KDTreeNode * && >()Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
operator ValueReceiver< typename std::conditional< std::is_scalar< KDTreeNode * >::value, KDTreeNode *, DummyParamType & >::type >()Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
operator!=(const COLLECTION2 &other) constBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
operator==(const COLLECTION2 &other) constBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
operator[](Int idx) constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
operator[](Int idx)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
PerformanceBaseArray()PerformanceBaseArray< KDTreeNode * >
Pop(KDTreeNode * *dst=nullptr)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Reset()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Resize(Int newCnt, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::DEFAULT)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
SetCapacityHint(Int requestedCapacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Slice(Int start)ArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
Slice(Int start) constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
Slice(Int start, Int end)ArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
Slice(Int start, Int end) constArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
Subtract(COLLECTION2 &&other)BaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
SubtractImpl(COLLECTION2 &&other, OverloadRank0)ArrayBase0< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
Super typedefBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
Swap(Iterator a, Iterator b)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
SwapErase(Int position, Int eraseCnt=1)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
SwapErase(Iterator position, Int eraseCnt=1)BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
ToArray()ArrayBase< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
ToArray() constArrayBase< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value >, DefaultCompare >
ToBlock() constBaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
ToBlock()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >
ToString(const FormatStatement *formatStatement) constBaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
UnsafeAppend()PerformanceBaseArray< KDTreeNode * >
UnsafeAppend(const KDTreeNode * &x)PerformanceBaseArray< KDTreeNode * >
UnsafeAppend(KDTreeNode * &&x)PerformanceBaseArray< KDTreeNode * >
ValueType typedefCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
VariadicAppend()Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
VariadicAppend(V &&value, VALUES &&... rest)Collection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, std::is_empty< DefaultAllocator >::value > >
~BaseArray()BaseArray< KDTreeNode *, BASEARRAY_DEFAULT_CHUNK_SIZE, BASEARRAYFLAGS::NONE, DefaultAllocator >