HDK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
OP_OutputReversedIterator Class Reference

#include <OP_Node.h>

+ Inheritance diagram for OP_OutputReversedIterator:

Public Member Functions

 OP_OutputReversedIterator (const OP_Node &node, bool into_subnets=false, bool through_dots=true, int output_idx=-1)
 
OP_NodeList::const_reverse_iterator begin () const
 
OP_NodeList::const_reverse_iterator end () const
 
OP_NodeList::reverse_iterator begin ()
 
OP_NodeList::reverse_iterator end ()
 
OP_NodeList::const_iterator rbegin () const
 
OP_NodeList::const_iterator rend () const
 
OP_NodeList::iterator rbegin ()
 
OP_NodeList::iterator rend ()
 
- Public Member Functions inherited from UT_ValArray< OP_Node * >
 UT_ValArray (const UT_ValArray< OP_Node * > &src)
 
 UT_ValArray (UT_ValArray< OP_Node * > &&src) SYS_NOEXCEPT
 
 UT_ValArray (const UT_Array< OP_Node * > &src)
 
 UT_ValArray (exint capacity=0)
 
 UT_ValArray (exint capacity, exint entries)
 
UT_ValArrayoperator= (const UT_ValArray< OP_Node * > &src)
 
UT_ValArrayoperator= (const UT_Array< OP_Node * > &src)
 
UT_ValArrayoperator= (UT_ValArray< OP_Node * > &&src)
 
UT_ValArrayoperator= (UT_Array< OP_Node * > &&src)
 
exint sortAndRemoveDuplicates ()
 
void sort (Comparator compare)
 
void sort ()
 
void stdsort (ComparatorBool is_less)
 
void sortAscending ()
 
void stableSort (ComparatorBool is_less)
 
void stableSort ()
 
OP_NodeselectNthLargest (int idx, ComparatorBool is_less)
 
OP_NodeselectNthLargest (int idx)
 
exint uniqueSortedFind (const OP_Node *&item, Comparator compare) const
 
exint uniqueSortedFind (const OP_Node *&item, ComparatorBool is_less) const
 
exint uniqueSortedFind (const OP_Node *&item) const
 
exint uniqueSortedFindAscending (const OP_Node *&item) const
 
exint sortedInsert (const OP_Node *&t, Comparator compare)
 
exint sortedInsert (const OP_Node *&t, ComparatorBool is_less)
 
exint sortedInsert (const OP_Node *&t)
 
exint uniqueSortedInsert (const OP_Node *&t, Comparator compare)
 
exint uniqueSortedInsert (const OP_Node *&t, ComparatorBool is_less)
 
exint uniqueSortedInsert (const OP_Node *&t)
 
exint uniqueSortedInsertAscending (const OP_Node *&t)
 
void merge (const UT_Array< OP_Node * > &other, int direction, bool allow_dups, ComparatorBool is_less)
 
void merge (const UT_ValArray< OP_Node * > &other, int direction, bool allow_dups)
 
bool hasSortedSubset (const UT_ValArray< OP_Node * > &other, Comparator compare=compareElements) const
 
void sortedUnion (const UT_ValArray< OP_Node * > &other, Comparator compare=compareElements)
 
void sortedUnion (const UT_ValArray< OP_Node * > &other, UT_ValArray< OP_Node * > &result, Comparator compare=compareElements) const
 
void sortedIntersection (const UT_ValArray< OP_Node * > &other, Comparator compare=compareElements)
 
void sortedIntersection (const UT_ValArray< OP_Node * > &other, UT_ValArray< OP_Node * > &result, Comparator compare=compareElements) const
 
void sortedSetDifference (const UT_ValArray< OP_Node * > &other, Comparator compare=compareElements)
 
void sortedSetDifference (const UT_ValArray< OP_Node * > &other, UT_ValArray< OP_Node * > &result, Comparator compare=compareElements) const
 
exint heapPush (const OP_Node *&t, Comparator compare)
 
OP_NodeheapPop (Comparator compare)
 
int removeZeros ()
 
void collapse ()
 
OP_Nodesum () const
 Functions which are only specialized for int{32,64}, fpreal{32,64}. More...
 
void display () const
 Prints the constents of the array. More...
 
- Public Member Functions inherited from UT_Array< OP_Node * >
 UT_Array (const UT_Array< OP_Node * > &a)
 
 UT_Array (UT_Array< OP_Node * > &&a) SYS_NOEXCEPT
 Move constructor. Steals the working data from the original. More...
 
 UT_Array (exint capacity, exint size)
 Construct based on given capacity and size. More...
 
 UT_Array (exint capacity=0)
 Construct based on given capacity with a size of 0. More...
 
 UT_Array (std::initializer_list< OP_Node * > init)
 Construct with the contents of an initializer list. More...
 
 ~UT_Array ()
 
void swap (UT_Array< OP_Node * > &other)
 
exint append (void)
 
exint append (const OP_Node *&t)
 
exint append (OP_Node *&&t)
 
exint append (const OP_Node *&t, bool check_dup)
 
void append (const OP_Node **pt, exint count)
 
void appendMultiple (const OP_Node *&t, exint count)
 
exint insert (exint index)
 
exint insert (const OP_Node *&t, exint i)
 
exint insert (OP_Node *&&t, exint i)
 
exint emplace_back (S &&...s)
 
exint uniqueSortedInsert (const OP_Node *&t, Comparator compare)
 
exint uniqueSortedInsert (const OP_Node *&t, ComparatorBool is_less)
 
exint uniqueSortedFind (const OP_Node *&item, Comparator compare) const
 
exint uniqueSortedFind (const OP_Node *&item, ComparatorBool is_less) const
 
void merge (const UT_Array< OP_Node * > &other, int direction, bool allow_dups, ComparatorBool is_less)
 
bool hasSortedSubset (const UT_Array< OP_Node * > &other, Comparator compare) const
 
void sortedUnion (const UT_Array< OP_Node * > &other, Comparator compare)
 
void sortedUnion (const UT_Array< OP_Node * > &other, UT_Array< OP_Node * > &result, Comparator compare) const
 
void sortedIntersection (const UT_Array< OP_Node * > &other, Comparator compare)
 
void sortedIntersection (const UT_Array< OP_Node * > &other, UT_Array< OP_Node * > &result, Comparator compare) const
 
void sortedSetDifference (const UT_Array< OP_Node * > &other, Comparator compare)
 
void sortedSetDifference (const UT_Array< OP_Node * > &other, UT_Array< OP_Node * > &result, Comparator compare) const
 
void fromStdVector (const std::vector< OP_Node * > &vec)
 Convert from an std::vector. More...
 
void toStdVector (std::vector< OP_Node * > &vec) const
 Convert to an std::vector. More...
 
exint heapPush (const OP_Node *&t, Comparator compare)
 
OP_NodeheapPop (Comparator compare)
 
const OP_Node *& heapMax () const
 
exint concat (const UT_Array< OP_Node * > &a)
 Takes another T array and concatenate it onto my end. More...
 
exint multipleInsert (exint index, exint count)
 Insert an element "count" times at the given index. Return the index. More...
 
exint insertAt (const OP_Node *&t, exint index)
 
bool isValidIndex (exint index) const
 Return true if given index is valid. More...
 
exint findAndRemove (const OP_Node *&t)
 
exint removeIndex (exint index)
 
void removeLast ()
 
void removeRange (exint begin_i, exint end_i)
 Remove the range [begin_i,end_i) of elements from the array. More...
 
void extractRange (exint begin_i, exint end_i, UT_Array< OP_Node * > &dest)
 
exint removeIf (IsEqual is_equal)
 
void collapseIf (IsEqual is_equal)
 Remove all matching elements. Also sets the capacity of the array. More...
 
void move (exint srcIdx, exint destIdx, exint howMany)
 
void cycle (exint howMany)
 Cyclically shifts the entire array by howMany. More...
 
void constant (const OP_Node *&v)
 Quickly set the array to a single value. More...
 
void zero ()
 Zeros the array if a POD type, else trivial constructs if a class type. More...
 
exint find (const OP_Node *&t, exint s=0) const
 
exint find (const OP_Node *&t, Comparator compare) const
 
void reverse ()
 Reverses the array by swapping elements in mirrored locations. More...
 
exint index (const OP_Node *&t) const
 
exint safeIndex (const OP_Node *&t) const
 
void sort (Comparator compare)
 
void stdsort (ComparatorBool is_less)
 Sort using std::sort. The ComparatorBool uses the less-than semantics. More...
 
void stableSort (ComparatorBool is_less)
 
void stableSortIndices (UT_Array< I > &indices, ComparatorBool is_less) const
 
void stableArgSort (UT_Array< I > &indices, ComparatorBool is_less) const
 
void stableSortByKey (const UT_Array< K > &keys, ComparatorBool is_less)
 
exint sortedRemoveDuplicates ()
 
exint sortedRemoveDuplicatesIf (CompareEqual compare_equal)
 
OP_NodeselectNthLargest (exint idx, ComparatorBool is_less)
 
void setCapacity (exint newcapacity)
 
void setCapacityIfNeeded (exint mincapacity)
 
void bumpCapacity (exint mincapacity)
 
void bumpSize (exint newsize)
 
void bumpEntries (exint newsize)
 
exint capacity () const
 
exint size () const
 
exint entries () const
 Alias of size(). size() is preferred. More...
 
void entries (exint newsize)
 Alias of setSize(). setSize() is preferred. More...
 
bool isEmpty () const
 Returns true iff there are no occupied elements in the array. More...
 
int64 getMemoryUsage (bool inclusive=false) const
 
void setSize (exint newsize)
 
void setSizeNoInit (exint newsize)
 
void truncate (exint maxsize)
 Decreases, but never expands, to the given maxsize. More...
 
void clear ()
 Resets list to an empty list. More...
 
UT_Array< OP_Node * > & operator= (const UT_Array< OP_Node * > &a)
 
UT_Array< OP_Node * > & operator= (std::initializer_list< OP_Node * > ilist)
 Replace the contents with those from the initializer_list ilist. More...
 
UT_Array< OP_Node * > & operator= (UT_Array< OP_Node * > &&a)
 Move the contents of array a to this array. More...
 
bool operator== (const UT_Array< OP_Node * > &a) const
 
bool operator!= (const UT_Array< OP_Node * > &a) const
 
int isEqual (const UT_Array< OP_Node * > &a, Comparator compare) const
 
OP_Node *& operator() (exint i)
 
const OP_Node *& operator() (exint i) const
 
OP_Node *& operator[] (exint i)
 
const OP_Node *& operator[] (exint i) const
 
OP_Node *& forcedRef (exint i)
 
OP_NodeforcedGet (exint i) const
 
OP_Node *& last ()
 
const OP_Node *& last () const
 
exint apply (int(*applyFct)(OP_Node *&t, void *d), void *d)
 
OP_Nodeaccumulate (const OP_Node *&init_value, BinaryOp add) const
 
OP_Node ** getArray () const
 
const OP_Node ** getRawArray () const
 
OP_Node ** array ()
 
const OP_Node ** array () const
 
OP_Node ** data ()
 
const OP_Node ** data () const
 
OP_Node ** aliasArray (OP_Node **newdata)
 
iterator begin ()
 
const_iterator begin () const
 
iterator end ()
 End iterator. More...
 
const_iterator end () const
 End const iterator. Consider using it.atEnd() instead. More...
 
reverse_iterator rbegin ()
 Begin iterating over the array in reverse. More...
 
const_reverse_iterator rbegin () const
 Begin iterating over the array in reverse. More...
 
reverse_iterator rend ()
 End reverse iterator. More...
 
const_reverse_iterator rend () const
 End reverse iterator. Consider using it.atEnd() instead. More...
 
UT_IteratorRange< iteratorrange ()
 
UT_IteratorRange< const_iteratorrange () const
 
UT_IteratorRange
< reverse_iterator
rrange ()
 
UT_IteratorRange
< const_reverse_iterator
rrange () const
 
void removeItem (const reverse_iterator &it)
 Remove item specified by the reverse_iterator. More...
 
void unsafeShareData (UT_Array< OP_Node * > &src)
 
void unsafeShareData (OP_Node **src, exint srcsize)
 
void unsafeShareData (OP_Node **src, exint size, exint capacity)
 
void unsafeClearData ()
 
bool isHeapBuffer () const
 Returns true if the data used by the array was allocated on the heap. More...
 
bool isHeapBuffer (OP_Node **data) const
 
exint sortedInsert (const OP_Node *&t, Comparator compare)
 
exint sortedInsert (const OP_Node *&t, ComparatorBool is_less)
 

Additional Inherited Members

- Public Types inherited from UT_ValArray< OP_Node * >
typedef int(* Comparator )(const OP_Node **, const OP_Node **)
 
- Public Types inherited from UT_Array< OP_Node * >
typedef OP_Nodevalue_type
 
typedef int(* Comparator )(const OP_Node **, const OP_Node **)
 
typedef base_iterator< OP_Node
*, true > 
iterator
 
typedef base_iterator< const
OP_Node *, true > 
const_iterator
 
typedef base_iterator< OP_Node
*, false > 
reverse_iterator
 
typedef base_iterator< const
OP_Node *, false > 
const_reverse_iterator
 
typedef const_iterator traverser
 
- Static Public Member Functions inherited from UT_ValArray< OP_Node * >
static bool compareElementsBool (const OP_Node *&a, const OP_Node *&b)
 
static int compareElements (const OP_Node **a, const OP_Node **b)
 
static bool isElementZero (const OP_Node *&a)
 
- Protected Member Functions inherited from UT_Array< OP_Node * >
exint appendImpl (S &&s)
 
exint insertImpl (S &&s, exint index)
 Similar to appendImpl() but for insertion. More...
 
void validateEmplaceArgs (First &&first, Rest &&...rest) const
 
void validateEmplaceArgs () const
 Base case for validateEmplaceArgs(). More...
 
- Static Protected Member Functions inherited from UT_Array< OP_Node * >
static constexpr
SYS_FORCE_INLINE bool 
isPOD ()
 
static void construct (OP_Node *&dst, S &&...s)
 
static void copyConstruct (OP_Node *&dst, const OP_Node *&src)
 
static void copyConstructRange (OP_Node **dst, const OP_Node **src, exint n)
 
static void trivialConstruct (OP_Node *&dst)
 Element Constructor. More...
 
static void trivialConstructRange (OP_Node **dst, exint n)
 
static void trivialDestruct (OP_Node *&dst)
 Element Destructor. More...
 
static void trivialDestructRange (OP_Node **dst, exint n)
 

Detailed Description

Definition at line 388 of file OP_Node.h.

Constructor & Destructor Documentation

OP_OutputReversedIterator::OP_OutputReversedIterator ( const OP_Node node,
bool  into_subnets = false,
bool  through_dots = true,
int  output_idx = -1 
)

Member Function Documentation

OP_NodeList::const_reverse_iterator OP_OutputReversedIterator::begin ( void  ) const
inline

Definition at line 396 of file OP_Node.h.

OP_NodeList::reverse_iterator OP_OutputReversedIterator::begin ( void  )
inline

Definition at line 400 of file OP_Node.h.

OP_NodeList::const_reverse_iterator OP_OutputReversedIterator::end ( void  ) const
inline

Definition at line 398 of file OP_Node.h.

OP_NodeList::reverse_iterator OP_OutputReversedIterator::end ( void  )
inline

Definition at line 402 of file OP_Node.h.

OP_NodeList::const_iterator OP_OutputReversedIterator::rbegin ( ) const
inline

Definition at line 405 of file OP_Node.h.

OP_NodeList::iterator OP_OutputReversedIterator::rbegin ( )
inline

Definition at line 409 of file OP_Node.h.

OP_NodeList::const_iterator OP_OutputReversedIterator::rend ( ) const
inline

Definition at line 407 of file OP_Node.h.

OP_NodeList::iterator OP_OutputReversedIterator::rend ( )
inline

Definition at line 411 of file OP_Node.h.


The documentation for this class was generated from the following file: