|
using | AllocatorType = DefaultAllocator |
|
using | Iterator = BaseIterator< BaseArray, false > |
|
using | ConstIterator = BaseIterator< const BaseArray, false > |
|
using | Super = ArrayBase< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, BaseArrayData< KDTreeNode *, DefaultAllocator, STD_IS_REPLACEMENT(empty, DefaultAllocator)>, DefaultCompare > |
|
using | Super = BaseCollection< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, BaseArrayData< KDTreeNode *, DefaultAllocator, STD_IS_REPLACEMENT(empty, DefaultAllocator)> > |
|
using | ValueType = KDTreeNode * |
|
using | IsCollection = std::true_type |
|
| PerformanceBaseArray () |
|
KDTreeNode * * | UnsafeAppend () |
|
KDTreeNode * * | UnsafeAppend (const KDTreeNode * &x) |
|
KDTreeNode * * | UnsafeAppend (KDTreeNode * &&x) |
|
MAXON_ATTRIBUTE_FORCE_INLINE | BaseArray () |
|
MAXON_ATTRIBUTE_FORCE_INLINE | BaseArray (const DefaultAllocator &a) |
|
MAXON_ATTRIBUTE_FORCE_INLINE | BaseArray (DefaultAllocator &&a) |
|
MAXON_ATTRIBUTE_FORCE_INLINE | BaseArray (BaseArray &&src) |
|
MAXON_ATTRIBUTE_FORCE_INLINE | ~BaseArray () |
|
| MAXON_OPERATOR_MOVE_ASSIGNMENT (BaseArray) |
|
const Block< const KDTreeNode * > & | ToBlock () const |
|
const Block< KDTreeNode * > & | ToBlock () |
|
| operator const Block< const KDTreeNode * > & () const |
|
| operator const Block< KDTreeNode * > & () |
|
| operator StridedBlock< const KDTreeNode * > () const |
|
| operator StridedBlock< KDTreeNode * > () |
|
| operator Block< const Byte > () const |
|
| operator Block< Byte > () |
|
void | Reset () |
|
void | Flush () |
|
MAXON_ATTRIBUTE_FORCE_INLINE Int | GetCount () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Int | GetCapacityCount () const |
|
const MAXON_ATTRIBUTE_FORCE_INLINE KDTreeNode * & | operator[] (Int idx) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE KDTreeNode * & | operator[] (Int idx) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultRef< KDTreeNode * > | Append () |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultRef< KDTreeNode * > | Append (const KDTreeNode * &x) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultRef< KDTreeNode * > | Append (KDTreeNode * &&x) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultPtr< KDTreeNode * > | Append (const Block< const KDTreeNode * > &values) |
|
ResultPtr< KDTreeNode * > | Append (const MoveBlock< KDTreeNode * > &values) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultPtr< KDTreeNode * > | Append (const std::initializer_list< KDTreeNode * > &values) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultRef< KDTreeNode * > | Insert (Int position) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultMemT< Iterator > | Insert (Iterator position) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultRef< KDTreeNode * > | Insert (Int position, const KDTreeNode * &x) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultMemT< Iterator > | Insert (Iterator position, const KDTreeNode * &x) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultRef< KDTreeNode * > | Insert (Int position, KDTreeNode * &&x) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ResultMemT< Iterator > | Insert (Iterator position, KDTreeNode * &&x) |
|
ResultPtr< KDTreeNode * > | Insert (Int position, const Block< const KDTreeNode * > &values) |
|
ResultPtr< KDTreeNode * > | Insert (Int position, const std::initializer_list< KDTreeNode * > &values) |
|
ResultPtr< KDTreeNode * > | Insert (Int position, const MoveBlock< KDTreeNode * > &values) |
|
ResultMemT< Iterator > | Insert (Iterator position, const Block< const KDTreeNode * > &values) |
|
ResultMemT< Iterator > | Insert (Iterator position, const std::initializer_list< KDTreeNode * > &values) |
|
ResultPtr< KDTreeNode * > | Erase (Int position, Int eraseCnt=1) |
|
Iterator | Erase (Iterator position, Int eraseCnt=1) |
|
ResultMem | SwapErase (Int position, Int eraseCnt=1) |
|
Iterator | SwapErase (Iterator position, Int eraseCnt=1) |
|
MAXON_ATTRIBUTE_FORCE_INLINE Int | GetBlock (Int position, Block< const KDTreeNode *, STRIDED > &block) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Int | GetBlock (Int position, Block< KDTreeNode *, STRIDED > &block) |
|
MAXON_ATTRIBUTE_FORCE_INLINE ConstIterator | GetBlock (ConstIterator position, Block< const KDTreeNode *, STRIDED > &block) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Iterator | GetBlock (Iterator position, Block< KDTreeNode *, STRIDED > &block) |
|
const MAXON_ATTRIBUTE_FORCE_INLINE KDTreeNode * * | GetFirst () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE KDTreeNode * * | GetFirst () |
|
const MAXON_ATTRIBUTE_FORCE_INLINE KDTreeNode * * | GetLast () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE KDTreeNode * * | GetLast () |
|
ResultMem | Resize (Int newCnt, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::DEFAULT) |
|
MAXON_ATTRIBUTE_FORCE_INLINE Bool | Pop (KDTreeNode * *dst=nullptr) |
|
MAXON_ATTRIBUTE_FORCE_INLINE Int | GetIndex (const KDTreeNode * &x) const |
|
ResultMem | EnsureCapacity (Int requestedCapacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) |
|
ResultMem | SetCapacityHint (Int requestedCapacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) |
|
MAXON_ATTRIBUTE_FORCE_INLINE void | Swap (Iterator a, Iterator b) |
|
Int | GetMemorySize () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE ConstIterator | Begin () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Iterator | Begin () |
|
MAXON_ATTRIBUTE_FORCE_INLINE ConstIterator | End () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Iterator | End () |
|
ResultMem | MoveAndShrink (BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > &dst, Int position, Int moveCnt) |
|
MAXON_ATTRIBUTE_FORCE_INLINE Block< KDTreeNode * > | Disconnect () |
|
MAXON_ATTRIBUTE_FORCE_INLINE void | Connect (const Block< KDTreeNode * > &block, Int capacity=0) |
|
MAXON_ATTRIBUTE_FORCE_INLINE DefaultAllocator & | GetAllocator () |
|
const MAXON_ATTRIBUTE_FORCE_INLINE DefaultAllocator & | GetAllocator () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE | ArrayBase (ARGS &&... args) |
|
ArrayImpl< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > & > | ToArray () |
|
ArrayImpl< const BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > & > | ToArray () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE | operator ArrayImpl< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > & > () |
|
MAXON_ATTRIBUTE_FORCE_INLINE | operator ArrayImpl< const BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > & > () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE | ArrayBase0 (ARGS &&... args) |
|
Bool | IsValidIndex (Int index) const |
|
Result< void > | CheckValidIndex (Int index) const |
|
Int | FindIndex (typename ByValueParam< KDTreeNode * >::type v, Int start) const |
|
Int | FindLastIndex (typename ByValueParam< KDTreeNode * >::type v) const |
|
Int | FindLastIndex (typename ByValueParam< KDTreeNode * >::type v, Int start) const |
|
Bool | EraseFirst (typename ByValueParam< KDTreeNode * >::type v) |
|
Int | EraseAll (typename ByValueParam< KDTreeNode * >::type v) |
|
Result< void > | AppendAllImpl (COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0) |
|
Result< void > | InsertAll (Int index, COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) |
|
Result< void > | Add (COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) |
|
Result< void > | SubtractImpl (COLLECTION2 &&other, OverloadRank0) |
|
Bool | IsEqualImpl (const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) const |
|
HashInt | GetHashCode () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE AutoIterator< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > > | Slice (Int start) |
|
MAXON_ATTRIBUTE_FORCE_INLINE AutoIterator< const BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > > | Slice (Int start) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE AutoIterator< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > > | Slice (Int start, Int end) |
|
MAXON_ATTRIBUTE_FORCE_INLINE AutoIterator< const BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator > > | Slice (Int start, Int end) const |
|
BlockIterator< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, false, false > | GetBlocks () |
|
BlockIterator< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, true, false > | GetBlocks () const |
|
BlockIterator< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, false, true > | GetStridedBlocks () |
|
BlockIterator< BaseArray< KDTreeNode *, MINCHUNKSIZE, MEMFLAGS, DefaultAllocator >, KDTreeNode *, true, true > | GetStridedBlocks () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE | Collection (ARGS &&... args) |
|
ResultOk< void > | VariadicAppend () |
|
Result< void > | VariadicAppend (V &&value, VALUES &&... rest) |
|
| operator ValueReceiver< const KDTreeNode * & > () |
|
| operator ValueReceiver< KDTreeNode * && > () |
|
| operator ValueReceiver< typename std::conditional< STD_IS_REPLACEMENT (scalar, KDTreeNode *) |
|
DummyParamType & | type () |
|
Result< Bool > | ForEach (FN &&callback) const |
|
Result< Bool > | ForEach (FN &&callback) |
|
H::Iterator | Find (typename ByValueParam< KDTreeNode * >::type v) |
|
H::ConstIterator | Find (typename ByValueParam< KDTreeNode * >::type v) const |
|
Int | FindIndex (typename ByValueParam< KDTreeNode * >::type v) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Bool | Contains (typename ByValueParam< KDTreeNode * >::type v) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE | BaseCollection (ARGS &&... args) |
|
MAXON_ATTRIBUTE_FORCE_INLINE std::enable_if< maxon::IsCollection< COLLECTION2 >::value, Bool >::type | operator== (const COLLECTION2 &other) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE std::enable_if< maxon::IsCollection< COLLECTION2 >::value, Bool >::type | operator!= (const COLLECTION2 &other) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE std::enable_if< maxon::IsCollection< COLLECTION2 >::value &&!STD_IS_REPLACEMENT(same, typename std::decay< COMPARE >::type, EQUALITY), Bool >::type | IsEqual (const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Result< void > | AppendAll (COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) |
|
MAXON_ATTRIBUTE_FORCE_INLINE Result< void > | CopyFrom (COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE) |
|
MAXON_ATTRIBUTE_FORCE_INLINE Result< void > | Subtract (COLLECTION2 &&other) |
|
MAXON_ATTRIBUTE_FORCE_INLINE Result< void > | Intersect (const COLLECTION2 &other) |
|
Bool | Intersects (const COLLECTION2 &other) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Result< void > | CopyFromImpl (COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0) |
|
Result< void > | AppendAllImpl (COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0) |
|
Result< void > | IntersectImpl (COLLECTION2 &&other, OverloadRank0) |
|
MAXON_ATTRIBUTE_FORCE_INLINE Bool | IsEmpty () const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Bool | IsPopulated () const |
|
String | ToString (const FormatStatement *formatStatement=nullptr) const |
|
MAXON_ATTRIBUTE_FORCE_INLINE Bool | ContainsAll (COLLECTION2 &&other) const |
|
Bool | ContainsAllImpl (COLLECTION2 &&other, OverloadRank0) const |
|
static const KDTreeNode * & | GetMapKey (const KDTreeNode * &key) |
|
static const COLLECTION_KIND | KIND |
|