Open Search
    PointerArray< T, MINCHUNKSIZE, ALLOCATOR > Member List

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

    _ptrPointerArray< T, MINCHUNKSIZE, ALLOCATOR >private
    Add(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    Alloc()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >private
    AllocatorType typedefPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    AllocPointers(Int cnt)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >private
    Append(ARG &&x)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Append(ARGS &&... args)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Append(const std::initializer_list< T > &values)PointerArray< T, MINCHUNKSIZE, 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)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >private
    AppendBlock(const Block< const T > &values)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    AppendPtr(T *x)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Array typedefPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    ArrayBase(ARGS &&... args)ArrayBase< PointerArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, DefaultAllocator >, T, EmptyClass, DefaultCompare >explicit
    ArrayBase0(ARGS &&... args)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >explicit
    BaseCollection(ARGS &&... args)BaseCollection< COLLECTION, SUPER >explicit
    Begin() constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Begin()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    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 typedefPointerArray< T, MINCHUNKSIZE, 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(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0)BaseCollection< COLLECTION, SUPER >
    Disconnect()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    End() constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    End()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Erase(Int position, Int eraseCnt=1)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Erase(Iterator position, Int eraseCnt=1)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    EraseAll(typename ByValueParam< VALUETYPE >::type v)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    EraseFirst(typename ByValueParam< VALUETYPE >::type v)ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    ErasePtr(Int position, T **dst)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    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 >
    Flush()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    ForEach(FN &&callback) constCollection< COLLECTION, VALUETYPE, SUPER >
    ForEach(FN &&callback)Collection< COLLECTION, VALUETYPE, SUPER >
    Free(X *&p)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >private
    GetAllocator()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetBlock(Int position, Block< T, STRIDED > &block)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetBlock(Int position, Block< const T, STRIDED > &block) constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetBlock(Iterator position, Block< T, STRIDED > &block)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetBlock(Iterator position, Block< const T, STRIDED > &block) constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetBlocks()ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    GetBlocks() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    GetCapacityCount() constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetCount() constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetFirst() constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetFirst()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetHashCode() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    GetIndex(const T &x) constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetLast() constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetLast()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetMapKey(const VALUETYPE &key)Collection< COLLECTION, VALUETYPE, SUPER >static
    GetMemorySize() constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetStridedBlocks()ArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    GetStridedBlocks() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    GetUnderlyingArray()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetUnderlyingArray() constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    GetUniqueHashCode() constArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    Insert(Int position)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Insert(Iterator position)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Insert(Int position, const T &x)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Insert(Iterator position, const T &x)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Insert(Int position, T &&x)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Insert(Iterator position, T &&x)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Insert(Int position, const std::initializer_list< T > &values)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Insert(Iterator position, const std::initializer_list< T > &values)PointerArray< T, MINCHUNKSIZE, 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)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    InsertBlock(Iterator position, const Block< const T > &values)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    InsertPtr(Int position, T *x)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    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 typedefPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    KINDArrayBase0< COLLECTION, VALUETYPE, SUPER, HASH >static
    MAXON_DISALLOW_COPY_AND_ASSIGN(PointerArray)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >private
    MAXON_OPERATOR_MOVE_ASSIGNMENT(PointerArray)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    operator ArrayImpl< const PointerArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, DefaultAllocator > & >() constArrayBase< PointerArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, DefaultAllocator >, T, EmptyClass, DefaultCompare >
    operator ArrayImpl< PointerArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, DefaultAllocator > & >()ArrayBase< PointerArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, DefaultAllocator >, T, EmptyClass, DefaultCompare >
    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) constPointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    operator[](Int idx)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    PointerArray()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    PointerArray(const ALLOCATOR &a)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >explicit
    PointerArray(PointerArray &&src)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Pop(T *dst=nullptr)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    PopPtr(T **dst)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Reset()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    Resize(Int newCnt, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::DEFAULT)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    SetCapacityHint(Int requestedCapacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)PointerArray< T, MINCHUNKSIZE, 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 typedefArrayBase< PointerArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, DefaultAllocator >, T, EmptyClass, DefaultCompare >private
    Swap(Iterator a, Iterator b)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    SwapErase(Int position, Int eraseCnt=1)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    SwapErase(Iterator position, Int eraseCnt=1)PointerArray< T, MINCHUNKSIZE, ALLOCATOR >
    ToArray()ArrayBase< PointerArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, DefaultAllocator >, T, EmptyClass, DefaultCompare >
    ToArray() constArrayBase< PointerArray< T, BASEARRAY_DEFAULT_CHUNK_SIZE, DefaultAllocator >, T, EmptyClass, DefaultCompare >
    ToString(const FormatStatement *formatStatement=nullptr) constBaseCollection< COLLECTION, SUPER >
    type()Collection< COLLECTION, VALUETYPE, SUPER >
    ValueType typedefCollection< COLLECTION, VALUETYPE, SUPER >
    VALUETYPECollection< COLLECTION, VALUETYPE, SUPER >
    VariadicAppend()Collection< COLLECTION, VALUETYPE, SUPER >
    VariadicAppend(V &&value, VALUES &&... rest)Collection< COLLECTION, VALUETYPE, SUPER >
    ~PointerArray()PointerArray< T, MINCHUNKSIZE, ALLOCATOR >