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

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

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