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

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

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