All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
GU_Flatten2::ElementConstraintList< T > Class Template Reference

#include <GU_Flatten2.h>

+ Inheritance diagram for GU_Flatten2::ElementConstraintList< T >:

Public Types

using Base = UT_Array< T >
- Public Types inherited from UT_Array< T >
typedef T value_type
typedef int(* Comparator )(const T *, const T *)
typedef base_iterator< T, true > iterator
typedef base_iterator< const T,
true > 
typedef base_iterator< T, false > reverse_iterator
typedef base_iterator< const T,
false > 
typedef const_iterator traverser

Public Member Functions

void deleteIndices (const UT_IntArray &idxs)
bool operator!= (const ElementConstraintList< T > &other) const
- Public Member Functions inherited from UT_Array< T >
 UT_Array (const UT_Array< T > &a)
 UT_Array (UT_Array< T > &&a) 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< T > init)
 Construct with the contents of an initializer list. More...
 ~UT_Array ()
void swap (UT_Array< T > &other)
exint append ()
exint append (const T &t)
exint append (T &&t)
exint append (const T &t, bool check_dup)
void append (const T *pt, exint count)
void appendMultiple (const T &t, exint count)
exint insert (exint index)
exint insert (const T &t, exint i)
exint insert (T &&t, exint i)
template<typename... S>
exint emplace_back (S &&...s)
exint uniqueSortedInsert (const T &t, Comparator compare)
template<typename ComparatorBool >
exint uniqueSortedInsert (const T &t, ComparatorBool is_less)
exint uniqueSortedFind (const T &item, Comparator compare) const
template<typename ComparatorBool >
exint uniqueSortedFind (const T &item, ComparatorBool is_less) const
template<typename ComparatorBool >
void merge (const UT_Array< T > &other, int direction, bool allow_dups, ComparatorBool is_less)
bool hasSortedSubset (const UT_Array< T > &other, Comparator compare) const
void sortedUnion (const UT_Array< T > &other, Comparator compare)
void sortedUnion (const UT_Array< T > &other, UT_Array< T > &result, Comparator compare) const
void sortedIntersection (const UT_Array< T > &other, Comparator compare)
void sortedIntersection (const UT_Array< T > &other, UT_Array< T > &result, Comparator compare) const
void sortedSetDifference (const UT_Array< T > &other, Comparator compare)
void sortedSetDifference (const UT_Array< T > &other, UT_Array< T > &result, Comparator compare) const
exint heapPush (const T &t, Comparator compare)
T heapPop (Comparator compare)
const TheapMax () const
exint concat (const UT_Array< T > &a)
 Takes another T array and concatenate it onto my end. More...
exint concat (UT_Array< T > &&a) noexcept
 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 T &t, exint index)
bool isValidIndex (exint index) const
 Return true if given index is valid. More...
exint findAndRemove (const T &t)
exint removeIndex (exint index)
SYS_FORCE_INLINE 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< T > &dest)
template<typename IsEqual >
exint removeIf (IsEqual is_equal)
template<typename IsEqual >
void collapseIf (IsEqual is_equal)
 Remove all matching elements. Also sets the capacity of the array. More...
void move (exint src_idx, exint dst_idx, exint how_many)
void cycle (exint how_many)
 Cyclically shifts the entire array by how_many. More...
void constant (const T &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 T &t, exint s=0) const
exint sortedFind (const T &t, Comparator compare) const
void reverse ()
 Reverses the array by swapping elements in mirrored locations. More...
void sort (Comparator compare)
template<typename ComparatorBool >
void stdsort (ComparatorBool is_less)
 Sort using std::sort. The ComparatorBool uses the less-than semantics. More...
template<typename ComparatorBool >
void stableSort (ComparatorBool is_less)
template<typename I , typename ComparatorBool >
void stableSortIndices (UT_Array< I > &indices, ComparatorBool is_less) const
template<typename I , typename ComparatorBool >
void stableArgSort (UT_Array< I > &indices, ComparatorBool is_less) const
template<typename K , typename ComparatorBool >
void stableSortByKey (const UT_Array< K > &keys, ComparatorBool is_less)
exint sortedRemoveDuplicates ()
template<typename CompareEqual >
exint sortedRemoveDuplicatesIf (CompareEqual compare_equal)
template<typename ComparatorBool >
void sortAndRemoveDuplicates (ComparatorBool is_less)
template<typename ComparatorBool >
T selectNthLargest (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...
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 setSizeIfNeeded (exint minsize)
void entries (exint newsize)
 Alias of setSize(). setSize() is preferred. More...
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< T > & operator= (const UT_Array< T > &a)
UT_Array< T > & operator= (std::initializer_list< T > ilist)
 Replace the contents with those from the initializer_list ilist. More...
UT_Array< T > & operator= (UT_Array< T > &&a)
 Move the contents of array a to this array. More...
bool operator== (const UT_Array< T > &a) const
bool operator!= (const UT_Array< T > &a) const
int isEqual (const UT_Array< T > &a, Comparator compare) const
Toperator() (exint i)
const Toperator() (exint i) const
Toperator[] (exint i)
const Toperator[] (exint i) const
TforcedRef (exint i)
T forcedGet (exint i) const
Tlast ()
const Tlast () const
exint apply (int(*apply_func)(T &t, void *d), void *d)
template<typename BinaryOp >
T accumulate (const T &init_value, BinaryOp add) const
TgetArray () const
const TgetRawArray () const
Tarray ()
const Tarray () const
Tdata ()
const Tdata () const
TaliasArray (T *newdata)
iterator begin ()
iterator end ()
 End iterator. More...
const_iterator begin () const
const_iterator end () const
 End const iterator. Consider using it.atEnd() instead. More...
reverse_iterator rbegin ()
 Begin iterating over the array in reverse. More...
reverse_iterator rend ()
 End reverse iterator. More...
const_reverse_iterator rbegin () const
 Begin iterating over the array in reverse. More...
const_reverse_iterator rend () const
 End reverse iterator. Consider using it.atEnd() instead. More...
UT_IteratorRange< iteratorrange ()
UT_IteratorRange< const_iteratorrange () const
< reverse_iterator
rrange ()
< const_reverse_iterator
rrange () const
void removeItem (const reverse_iterator &it)
 Remove item specified by the reverse_iterator. More...
void unsafeShareData (UT_Array< T > &src)
void unsafeShareData (T *src, exint srcsize)
void unsafeShareData (T *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 (T *data) const
exint sortedInsert (const T &t, Comparator compare)
template<typename ComparatorBool >
exint sortedInsert (const T &t, ComparatorBool is_less)
exint index (const T &t) const
exint safeIndex (const T &t) const

Additional Inherited Members

- Protected Member Functions inherited from UT_Array< T >
template<typename S >
exint appendImpl (S &&s)
template<typename S >
exint insertImpl (S &&s, exint index)
 Similar to appendImpl() but for insertion. More...
template<typename First , typename... Rest>
void validateEmplaceArgs (First &&first, Rest &&...rest) const
void validateEmplaceArgs () const
 Base case for validateEmplaceArgs(). More...
- Static Protected Member Functions inherited from UT_Array< T >
static constexpr
isPOD ()
template<typename... S>
static void construct (T &dst, S &&...s)
static void copyConstruct (T &dst, const T &src)
static void copyConstructRange (T *dst, const T *src, exint n)
static void trivialConstruct (T &dst)
 Element Constructor. More...
static void trivialConstructRange (T *dst, exint n)
static SYS_FORCE_INLINE void trivialDestruct (T &dst)
 Element Destructor. More...
static void trivialDestructRange (T *dst, exint n)

Detailed Description

template<typename T>
class GU_Flatten2::ElementConstraintList< T >

Definition at line 903 of file GU_Flatten2.h.

Member Typedef Documentation

template<typename T>
using GU_Flatten2::ElementConstraintList< T >::Base = UT_Array<T>

Definition at line 906 of file GU_Flatten2.h.

Member Function Documentation

template<typename T>
void GU_Flatten2::ElementConstraintList< T >::deleteIndices ( const UT_IntArray idxs)

Definition at line 908 of file GU_Flatten2.h.

template<typename T>
bool GU_Flatten2::ElementConstraintList< T >::operator!= ( const ElementConstraintList< T > &  other) const

Definition at line 927 of file GU_Flatten2.h.

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