HDK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
DOP_FullPathDataArray Member List

This is the complete list of members for DOP_FullPathDataArray, including all inherited members.

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