HDK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
UT_PtrArray< T > Member List

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

accumulate(const T &init_value, BinaryOp add) const UT_Array< T >inline
aliasArray(T *newdata)UT_Array< T >inline
append()UT_Array< T >inline
append(const T &t)UT_Array< T >inline
append(T &&t)UT_Array< T >inline
append(const T &t, bool check_dup)UT_Array< T >inline
append(const T *pt, exint count)UT_Array< T >inline
appendImpl(S &&s)UT_Array< T >inlineprotected
appendMultiple(const T &t, exint count)UT_Array< T >inline
apply(int(*apply_func)(T &t, void *d), void *d)UT_Array< T >inline
array()UT_Array< T >inline
array() const UT_Array< T >inline
begin()UT_Array< T >inline
begin() const UT_Array< T >inline
bumpCapacity(exint min_capacity)UT_Array< T >inline
bumpEntries(exint newsize)UT_Array< T >inline
bumpSize(exint newsize)UT_Array< T >inline
capacity() const UT_Array< T >
clear()UT_Array< T >inline
collapse()UT_ValArray< T >inline
collapseIf(IsEqual is_equal)UT_Array< T >inline
Comparator typedefUT_ValArray< T >
compareElements(const T *a, const T *b)UT_ValArray< T >inlinestatic
compareElementsBool(const T &a, const T &b)UT_ValArray< T >inlinestatic
concat(const UT_Array< T > &a)UT_Array< T >inline
concat(UT_Array< T > &&a) noexceptUT_Array< T >inline
const_iterator typedefUT_Array< T >
const_reverse_iterator typedefUT_Array< T >
constant(const T &v)UT_Array< T >inline
construct(T &dst, S &&...s)UT_Array< T >inlineprotectedstatic
copyConstruct(T &dst, const T &src)UT_Array< T >inlineprotectedstatic
cycle(exint how_many)UT_Array< T >inline
data()UT_Array< T >inline
data() const UT_Array< T >inline
display() const UT_ValArray< T >inline
emplace_back(S &&...s)UT_Array< T >inline
end()UT_Array< T >inline
end() const UT_Array< T >inline
entries() const UT_Array< T >inline
entries(exint newsize)UT_Array< T >inline
extractRange(exint begin_i, exint end_i, UT_Array< T > &dest)UT_Array< T >inline
find(const S &s, exint start=0) const UT_Array< T >inline
findAndRemove(const S &s)UT_Array< T >inline
forcedGet(exint i) const UT_Array< T >inline
forcedRef(exint i)UT_Array< T >inline
getArray() const UT_Array< T >inline
getMemoryUsage(bool inclusive=false) const UT_Array< T >inline
getRawArray() const UT_Array< T >inline
hasSortedSubset(const UT_ValArray< T > &other) const UT_ValArray< T >inline
hasSortedSubset(const UT_ValArray< T > &other, Comparator compare) const UT_ValArray< T >inline
hasSortedSubset(const UT_Array< T > &other, ComparatorBool is_less) const UT_ValArray< T >inline
UT_Array::hasSortedSubset(const UT_Array< T > &other, Comparator compare) const UT_Array< T >inline
heapMax() const UT_Array< T >inline
heapPop(Comparator compare)UT_Array< T >inline
heapPush(const T &t, Comparator compare)UT_Array< T >inline
index(const T &t) const UT_Array< T >inline
insert(exint index)UT_Array< T >inline
insert(const T &t, exint i)UT_Array< T >inline
insert(T &&t, exint i)UT_Array< T >inline
insertAt(const T &t, exint index)UT_Array< T >inline
insertImpl(S &&s, exint index)UT_Array< T >inlineprotected
isElementZero(const T &a)UT_ValArray< T >inlinestatic
isEmpty() const UT_Array< T >inline
isEqual(const UT_Array< T > &a, ComparatorBool is_equal) const UT_Array< T >inline
isEqual(const UT_Array< T > &a, Comparator compare) const UT_Array< T >inline
isHeapBuffer() const UT_Array< T >inline
isPOD()UT_Array< T >inlineprotectedstatic
isValidIndex(exint index) const UT_Array< T >inline
iterator typedefUT_Array< T >
last()UT_Array< T >inline
last() const UT_Array< T >inline
merge(const UT_Array< T > &other, int direction, bool allow_dups, ComparatorBool is_less={})UT_Array< T >inline
move(exint src_idx, exint dst_idx, exint how_many)UT_Array< T >inline
multipleInsert(exint index, exint count)UT_Array< T >inline
operator!=(const UT_Array< T > &a) const UT_Array< T >inline
operator()(exint i)UT_Array< T >inline
operator()(exint i) const UT_Array< T >inline
operator=(const UT_ValArray< T > &src)UT_ValArray< T >inline
operator=(const UT_Array< T > &src)UT_ValArray< T >inline
operator=(std::initializer_list< T > src)UT_ValArray< T >inline
operator=(UT_ValArray< T > &&src)UT_ValArray< T >inline
operator=(UT_Array< T > &&src)UT_ValArray< T >inline
operator==(const UT_Array< T > &a) const UT_Array< T >inline
operator[](exint i)UT_Array< T >inline
operator[](exint i) const UT_Array< T >inline
range()UT_Array< T >inline
range() const UT_Array< T >inline
rbegin()UT_Array< T >inline
rbegin() const UT_Array< T >inline
removeIf(IsEqual is_equal)UT_Array< T >inline
removeIndex(exint index)UT_Array< T >inline
removeItem(const reverse_iterator &it)UT_Array< T >inline
removeLast()UT_Array< T >inline
removeRange(exint begin_i, exint end_i)UT_Array< T >inline
removeZeros()UT_ValArray< T >inline
rend()UT_Array< T >inline
rend() const UT_Array< T >inline
reverse()UT_Array< T >inline
reverse_iterator typedefUT_Array< T >
rrange()UT_Array< T >inline
rrange() const UT_Array< T >inline
safeIndex(const T &t) const UT_Array< T >inline
selectNthLargest(exint idx, ComparatorBool is_less={})UT_Array< T >inline
setCapacity(exint new_capacity)UT_Array< T >inline
setCapacityIfNeeded(exint min_capacity)UT_Array< T >inline
setSize(exint newsize)UT_Array< T >inline
setSizeAndShrink(exint new_size)UT_Array< T >inline
setSizeIfNeeded(exint minsize)UT_Array< T >inline
setSizeNoInit(exint newsize)UT_Array< T >inline
shrinkToFit()UT_Array< T >inline
size() const UT_Array< T >inline
sort(ComparatorBool is_less={})UT_Array< T >inline
sort(Comparator compare)UT_Array< T >inline
sortAndRemoveDuplicates(ComparatorBool is_less={})UT_Array< T >inline
sortAscending()UT_ValArray< T >inline
sortedFind(const T &t, Comparator compare) const UT_Array< T >
sortedInsert(const T &t, Comparator compare)UT_Array< T >inline
sortedInsert(const T &t, ComparatorBool is_less={})UT_Array< T >inline
sortedIntersection(const UT_ValArray< T > &other)UT_ValArray< T >inline
sortedIntersection(const UT_ValArray< T > &other, Comparator compare)UT_ValArray< T >inline
sortedIntersection(const UT_ValArray< T > &other, ComparatorBool is_less)UT_ValArray< T >inline
sortedIntersection(const UT_ValArray< T > &other, UT_ValArray< T > &result) const UT_ValArray< T >inline
sortedIntersection(const UT_ValArray< T > &other, UT_ValArray< T > &result, Comparator compare) const UT_ValArray< T >inline
sortedIntersection(const UT_ValArray< T > &other, UT_ValArray< T > &result, ComparatorBool is_less) const UT_ValArray< T >inline
UT_Array::sortedIntersection(const UT_Array< T > &other, ComparatorBool is_less={})UT_Array< T >inline
UT_Array::sortedIntersection(const UT_Array< T > &other, UT_Array< T > &result, ComparatorBool is_less={}) const UT_Array< T >inline
UT_Array::sortedIntersection(const UT_Array< T > &other, Comparator compare)UT_Array< T >inline
UT_Array::sortedIntersection(const UT_Array< T > &other, UT_Array< T > &result, Comparator compare) const UT_Array< T >inline
sortedRemoveDuplicates()UT_Array< T >inline
sortedRemoveDuplicatesIf(CompareEqual compare_equal)UT_Array< T >inline
sortedSetDifference(const UT_ValArray< T > &other)UT_ValArray< T >inline
sortedSetDifference(const UT_ValArray< T > &other, Comparator compare)UT_ValArray< T >inline
sortedSetDifference(const UT_ValArray< T > &other, ComparatorBool is_less)UT_ValArray< T >inline
sortedSetDifference(const UT_ValArray< T > &other, UT_ValArray< T > &result) const UT_ValArray< T >inline
sortedSetDifference(const UT_ValArray< T > &other, UT_ValArray< T > &result, Comparator compare) const UT_ValArray< T >inline
sortedSetDifference(const UT_ValArray< T > &other, UT_ValArray< T > &result, ComparatorBool is_less) const UT_ValArray< T >inline
UT_Array::sortedSetDifference(const UT_Array< T > &other, ComparatorBool is_less={})UT_Array< T >inline
UT_Array::sortedSetDifference(const UT_Array< T > &other, UT_Array< T > &result, ComparatorBool is_less={}) const UT_Array< T >inline
UT_Array::sortedSetDifference(const UT_Array< T > &other, Comparator compare)UT_Array< T >inline
UT_Array::sortedSetDifference(const UT_Array< T > &other, UT_Array< T > &result, Comparator compare) const UT_Array< T >inline
sortedUnion(const UT_ValArray< T > &other)UT_ValArray< T >inline
sortedUnion(const UT_ValArray< T > &other, Comparator compare)UT_ValArray< T >inline
sortedUnion(const UT_ValArray< T > &other, ComparatorBool is_less)UT_ValArray< T >inline
sortedUnion(const UT_ValArray< T > &other, UT_ValArray< T > &result) const UT_ValArray< T >inline
sortedUnion(const UT_ValArray< T > &other, UT_ValArray< T > &result, Comparator compare) const UT_ValArray< T >inline
sortedUnion(const UT_ValArray< T > &other, UT_ValArray< T > &result, ComparatorBool is_less) const UT_ValArray< T >inline
UT_Array::sortedUnion(const UT_Array< T > &other, ComparatorBool is_less={})UT_Array< T >inline
UT_Array::sortedUnion(const UT_Array< T > &other, UT_Array< T > &result, ComparatorBool is_less={}) const UT_Array< T >inline
UT_Array::sortedUnion(const UT_Array< T > &other, Comparator compare)UT_Array< T >inline
UT_Array::sortedUnion(const UT_Array< T > &other, UT_Array< T > &result, Comparator compare) const UT_Array< T >inline
stableArgSort(UT_Array< I > &indices, ComparatorBool is_less) const UT_Array< T >inline
stableSort(ComparatorBool is_less={})UT_Array< T >inline
stableSortByKey(const UT_Array< K > &keys, ComparatorBool is_less)UT_Array< T >inline
stableSortIndices(UT_Array< I > &indices, ComparatorBool is_less) const UT_Array< T >inline
stableSortRange(ComparatorBool is_less, exint start, exint end)UT_Array< T >inline
stdsort(ComparatorBool is_less)UT_Array< T >inline
sum() const UT_ValArray< T >inline
swap(UT_Array< T > &other)UT_Array< T >inline
traverser typedefUT_Array< T >
truncate(exint maxsize)UT_Array< T >inline
uniqueSortedFind(const T &item, ComparatorBool is_less={}) const UT_Array< T >inline
uniqueSortedFind(const T &item, Comparator compare) const UT_Array< T >inline
uniqueSortedFindAscending(const T &item) const UT_ValArray< T >inline
uniqueSortedInsert(const T &t, Comparator compare)UT_Array< T >inline
uniqueSortedInsert(const T &t, ComparatorBool is_less={})UT_Array< T >inline
uniqueSortedInsert(T &&t, Comparator compare)UT_Array< T >inline
uniqueSortedInsertAscending(const T &t)UT_ValArray< T >inline
uniqueSortedInsertImpl(S &&s, Comparator compare)UT_Array< T >inlineprotected
unsafeClearData()UT_Array< T >inline
unsafeShareData(UT_Array< T > &src)UT_Array< T >inline
unsafeShareData(T *src, exint srcsize)UT_Array< T >inline
unsafeShareData(T *src, exint size, exint capacity)UT_Array< T >inline
UT_Array(const UT_Array< T > &a)UT_Array< T >inlineexplicit
UT_Array(UT_Array< T > &&a) noexceptUT_Array< T >inline
UT_Array(const exint capacity, const exint size)UT_Array< T >inline
UT_Array(const exint capacity=0)UT_Array< T >inlineexplicit
UT_Array(std::initializer_list< T > init)UT_Array< T >inlineexplicit
UT_Array(const UT_ArrayCT::ExternalCapacity, T *external_data, const exint external_capacity)UT_Array< T >explicitprotected
UT_Array(const UT_ArrayCT::ExternalMove, T *external_data, const exint external_capacity, UT_Array &&a)UT_Array< T >explicitprotected
UT_PtrArray(const UT_PtrArray< T > &a)UT_PtrArray< T >inline
UT_PtrArray(exint capacity=0)UT_PtrArray< T >inlineexplicit
UT_ValArray(const UT_ValArray< T > &src)UT_ValArray< T >inlineexplicit
UT_ValArray(const UT_Array< T > &src)UT_ValArray< T >inlineexplicit
UT_ValArray(UT_ValArray< T > &&src) noexceptUT_ValArray< T >inline
UT_ValArray(UT_Array< T > &&src) noexceptUT_ValArray< T >inline
UT_ValArray(exint capacity=0)UT_ValArray< T >inlineexplicit
UT_ValArray(exint capacity, exint entries)UT_ValArray< T >inline
UT_ValArray(std::initializer_list< T > init)UT_ValArray< T >inlineexplicit
validateEmplaceArgs(First &&first, Rest &&...rest) const UT_Array< T >inlineprotected
validateEmplaceArgs() const UT_Array< T >inlineprotected
value_type typedefUT_Array< T >
zero()UT_Array< T >inline
~UT_Array()UT_Array< T >inline