Open Search
    ArraySet< T, SORTED, COMPARE, ARRAY > Member List

    This is the complete list of members for ArraySet< T, SORTED, COMPARE, ARRAY >, including all inherited members.

    Add(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)SetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    Append(typename ByValueParam< VALUETYPE >::type v)SetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    AppendAll(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)SetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    AppendAllImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0)BaseCollection< COLLECTION, SUPER >
    ArraySet()ArraySet< T, SORTED, COMPARE, ARRAY >
    ArraySet(ArraySet &&src)ArraySet< T, SORTED, COMPARE, ARRAY >
    BaseCollection(ARGS &&... args)BaseCollection< COLLECTION, SUPER >explicit
    Begin() constArraySet< T, SORTED, COMPARE, ARRAY >
    Begin()ArraySet< T, SORTED, COMPARE, ARRAY >
    Collection(ARGS &&... args)Collection< COLLECTION, VALUETYPE, SUPER >explicit
    ConstIterator typedefArraySet< T, SORTED, COMPARE, ARRAY >
    Contains(typename ByValueParam< T >::type value) constArraySet< T, SORTED, COMPARE, ARRAY >
    SetBase< ArraySet< T, true, DefaultCompare, BaseArraySelector<> >, T, Protected< ArrayMap< T, UnitType, true, DefaultCompare, BaseArraySelector<> > >, DefaultCompare >::Contains(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
    ContainsAll(COLLECTION2 &&other) constBaseCollection< COLLECTION, SUPER >
    ContainsAllImpl(COLLECTION2 &&other, OverloadRank0) constSetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    CopyFrom(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE)SetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    CopyFromImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0)BaseCollection< COLLECTION, SUPER >
    End() constArraySet< T, SORTED, COMPARE, ARRAY >
    End()ArraySet< T, SORTED, COMPARE, ARRAY >
    Erase(const T &value)ArraySet< T, SORTED, COMPARE, ARRAY >
    Erase(const Iterator &it)ArraySet< T, SORTED, COMPARE, ARRAY >
    Find(const KEY &key)ArraySet< T, SORTED, COMPARE, ARRAY >
    Find(const KEY &key) constArraySet< T, SORTED, COMPARE, ARRAY >
    SetBase< ArraySet< T, true, DefaultCompare, BaseArraySelector<> >, T, Protected< ArrayMap< T, UnitType, true, DefaultCompare, BaseArraySelector<> > >, DefaultCompare >::Find(typename ByValueParam< VALUETYPE >::type v)Collection< COLLECTION, VALUETYPE, SUPER >
    SetBase< ArraySet< T, true, DefaultCompare, BaseArraySelector<> >, T, Protected< ArrayMap< T, UnitType, true, DefaultCompare, BaseArraySelector<> > >, DefaultCompare >::Find(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
    FindCeiling(const KEY &key)ArraySet< T, SORTED, COMPARE, ARRAY >
    FindCeiling(const KEY &key) constArraySet< T, SORTED, COMPARE, ARRAY >
    FindFloor(const KEY &key)ArraySet< T, SORTED, COMPARE, ARRAY >
    FindFloor(const KEY &key) constArraySet< T, SORTED, COMPARE, ARRAY >
    FindIndex(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
    ForEach(FN &&callback) constCollection< COLLECTION, VALUETYPE, SUPER >
    ForEach(FN &&callback)Collection< COLLECTION, VALUETYPE, SUPER >
    GetHashCode() constSetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    GetMap()ArraySet< T, SORTED, COMPARE, ARRAY >
    GetMap() constArraySet< T, SORTED, COMPARE, ARRAY >
    GetMapKey(const VALUETYPE &key)Collection< COLLECTION, VALUETYPE, SUPER >static
    GetOperationCountForSearch() constArraySet< T, SORTED, COMPARE, ARRAY >
    GetUnderlyingArray() constArraySet< T, SORTED, COMPARE, ARRAY >
    GetUnderlyingArray()ArraySet< T, SORTED, COMPARE, ARRAY >
    GetUniqueHashCode() constSetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    Insert(const T &value, Bool &added=BoolLValue())ArraySet< T, SORTED, COMPARE, ARRAY >
    Insert(T &&value, Bool &added=BoolLValue())ArraySet< T, SORTED, COMPARE, ARRAY >
    InsertKey(const T &value, Bool &added=BoolLValue())ArraySet< T, SORTED, COMPARE, ARRAY >
    InsertKey(T &&value, Bool &added=BoolLValue())ArraySet< T, SORTED, COMPARE, ARRAY >
    Intersect(const COLLECTION2 &other)BaseCollection< COLLECTION, SUPER >
    IntersectImpl(COLLECTION2 &&other, OverloadRank0)BaseCollection< COLLECTION, SUPER >
    Intersects(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
    IsArrayMap typedefArraySet< T, SORTED, COMPARE, ARRAY >
    IsArraySet typedefArraySet< T, SORTED, COMPARE, ARRAY >
    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) constSetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    IsPopulated() constBaseCollection< COLLECTION, SUPER >
    Iterator typedefArraySet< T, SORTED, COMPARE, ARRAY >
    KINDSetBase0< COLLECTION, VALUETYPE, SUPER, HASH >static
    MapType typedefArraySet< T, SORTED, COMPARE, ARRAY >
    MAXON_DISALLOW_COPY_AND_ASSIGN(ArraySet)ArraySet< T, SORTED, COMPARE, ARRAY >private
    MAXON_OPERATOR_MOVE_ASSIGNMENT(ArraySet)ArraySet< T, SORTED, COMPARE, ARRAY >
    operator SetImpl< ArraySet< T, true, DefaultCompare, BaseArraySelector<> > & >()SetBase< ArraySet< T, true, DefaultCompare, BaseArraySelector<> >, T, Protected< ArrayMap< T, UnitType, true, DefaultCompare, BaseArraySelector<> > >, DefaultCompare >
    operator SetImpl< const ArraySet< T, true, DefaultCompare, BaseArraySelector<> > & >() constSetBase< ArraySet< T, true, DefaultCompare, BaseArraySelector<> >, T, Protected< ArrayMap< T, UnitType, true, DefaultCompare, BaseArraySelector<> > >, 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) constBaseCollection< COLLECTION, SUPER >
    SetBase(ARGS &&... args)SetBase< ArraySet< T, true, DefaultCompare, BaseArraySelector<> >, T, Protected< ArrayMap< T, UnitType, true, DefaultCompare, BaseArraySelector<> > >, DefaultCompare >explicit
    SetBase0(ARGS &&... args)SetBase0< COLLECTION, VALUETYPE, SUPER, HASH >explicit
    SetType typedefSetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    Subtract(COLLECTION2 &&other)BaseCollection< COLLECTION, SUPER >
    SubtractImpl(COLLECTION2 &&other, OverloadRank0)SetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
    Super typedefArraySet< T, SORTED, COMPARE, ARRAY >private
    ToSet()SetBase< ArraySet< T, true, DefaultCompare, BaseArraySelector<> >, T, Protected< ArrayMap< T, UnitType, true, DefaultCompare, BaseArraySelector<> > >, DefaultCompare >
    ToSet() constSetBase< ArraySet< T, true, DefaultCompare, BaseArraySelector<> >, T, Protected< ArrayMap< T, UnitType, true, DefaultCompare, BaseArraySelector<> > >, 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 >