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

#include <DOP_FullPathData.h>

+ Inheritance diagram for DOP_FullPathDataArray:

Public Member Functions

 DOP_FullPathDataArray ()
virtual ~DOP_FullPathDataArray ()
void buildFromPaths (const UT_StringArray &paths)
void getObjectArray (SIM_ConstObjectArray &objects) const
void getObjectString (UT_WorkBuffer &buffer) const
- Public Member Functions inherited from UT_Array< DOP_FullPathData >
 UT_Array (const UT_Array< DOP_FullPathData > &a)
 UT_Array (UT_Array< DOP_FullPathData > &&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< DOP_FullPathData > init)
 Construct with the contents of an initializer list. More...
 ~UT_Array ()
void swap (UT_Array< DOP_FullPathData > &other)
exint append (void)
exint append (const DOP_FullPathData &t)
exint append (DOP_FullPathData &&t)
exint append (const DOP_FullPathData &t, bool check_dup)
void append (const DOP_FullPathData *pt, exint count)
void appendMultiple (const DOP_FullPathData &t, exint count)
exint insert (exint index)
exint insert (const DOP_FullPathData &t, exint i)
exint insert (DOP_FullPathData &&t, exint i)
exint emplace_back (S &&...s)
exint uniqueSortedInsert (const DOP_FullPathData &t, Comparator compare)
exint uniqueSortedInsert (const DOP_FullPathData &t, ComparatorBool is_less)
exint uniqueSortedFind (const DOP_FullPathData &item, Comparator compare) const
exint uniqueSortedFind (const DOP_FullPathData &item, ComparatorBool is_less) const
void merge (const UT_Array< DOP_FullPathData > &other, int direction, bool allow_dups, ComparatorBool is_less)
bool hasSortedSubset (const UT_Array< DOP_FullPathData > &other, Comparator compare) const
void sortedUnion (const UT_Array< DOP_FullPathData > &other, Comparator compare)
void sortedUnion (const UT_Array< DOP_FullPathData > &other, UT_Array< DOP_FullPathData > &result, Comparator compare) const
void sortedIntersection (const UT_Array< DOP_FullPathData > &other, Comparator compare)
void sortedIntersection (const UT_Array< DOP_FullPathData > &other, UT_Array< DOP_FullPathData > &result, Comparator compare) const
void sortedSetDifference (const UT_Array< DOP_FullPathData > &other, Comparator compare)
void sortedSetDifference (const UT_Array< DOP_FullPathData > &other, UT_Array< DOP_FullPathData > &result, Comparator compare) const
void fromStdVector (const std::vector< DOP_FullPathData > &vec)
 Convert from an std::vector. More...
void toStdVector (std::vector< DOP_FullPathData > &vec) const
 Convert to an std::vector. More...
exint heapPush (const DOP_FullPathData &t, Comparator compare)
DOP_FullPathData heapPop (Comparator compare)
const DOP_FullPathDataheapMax () const
exint concat (const UT_Array< DOP_FullPathData > &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 DOP_FullPathData &t, exint index)
bool isValidIndex (exint index) const
 Return true if given index is valid. More...
exint findAndRemove (const DOP_FullPathData &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< DOP_FullPathData > &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 DOP_FullPathData &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 DOP_FullPathData &t, exint s=0) const
exint find (const DOP_FullPathData &t, Comparator compare) const
void reverse ()
 Reverses the array by swapping elements in mirrored locations. More...
exint index (const DOP_FullPathData &t) const
exint safeIndex (const DOP_FullPathData &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)
DOP_FullPathData 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...
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< DOP_FullPathData > & operator= (const UT_Array< DOP_FullPathData > &a)
UT_Array< DOP_FullPathData > & operator= (std::initializer_list< DOP_FullPathData > ilist)
 Replace the contents with those from the initializer_list ilist. More...
UT_Array< DOP_FullPathData > & operator= (UT_Array< DOP_FullPathData > &&a)
 Move the contents of array a to this array. More...
bool operator== (const UT_Array< DOP_FullPathData > &a) const
bool operator!= (const UT_Array< DOP_FullPathData > &a) const
int isEqual (const UT_Array< DOP_FullPathData > &a, Comparator compare) const
DOP_FullPathDataoperator() (exint i)
const DOP_FullPathDataoperator() (exint i) const
DOP_FullPathDataoperator[] (exint i)
const DOP_FullPathDataoperator[] (exint i) const
DOP_FullPathDataforcedRef (exint i)
DOP_FullPathData forcedGet (exint i) const
DOP_FullPathDatalast ()
const DOP_FullPathDatalast () const
exint apply (int(*applyFct)(DOP_FullPathData &t, void *d), void *d)
DOP_FullPathData accumulate (const DOP_FullPathData &init_value, BinaryOp add) const
DOP_FullPathDatagetArray () const
const DOP_FullPathDatagetRawArray () const
DOP_FullPathDataarray ()
const DOP_FullPathDataarray () const
DOP_FullPathDatadata ()
const DOP_FullPathDatadata () const
DOP_FullPathDataaliasArray (DOP_FullPathData *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
< 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< DOP_FullPathData > &src)
void unsafeShareData (DOP_FullPathData *src, exint srcsize)
void unsafeShareData (DOP_FullPathData *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 (DOP_FullPathData *data) const
exint sortedInsert (const DOP_FullPathData &t, Comparator compare)
exint sortedInsert (const DOP_FullPathData &t, ComparatorBool is_less)

Additional Inherited Members

- Public Types inherited from UT_Array< DOP_FullPathData >
typedef DOP_FullPathData value_type
typedef int(* Comparator )(const DOP_FullPathData *, const DOP_FullPathData *)
typedef base_iterator
< DOP_FullPathData, true > 
typedef base_iterator< const
DOP_FullPathData, true > 
typedef base_iterator
< DOP_FullPathData, false > 
typedef base_iterator< const
DOP_FullPathData, false > 
typedef const_iterator traverser
- Protected Member Functions inherited from UT_Array< DOP_FullPathData >
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< DOP_FullPathData >
static constexpr
isPOD ()
static void construct (DOP_FullPathData &dst, S &&...s)
static void copyConstruct (DOP_FullPathData &dst, const DOP_FullPathData &src)
static void copyConstructRange (DOP_FullPathData *dst, const DOP_FullPathData *src, exint n)
static void trivialConstruct (DOP_FullPathData &dst)
 Element Constructor. More...
static void trivialConstructRange (DOP_FullPathData *dst, exint n)
static void trivialDestruct (DOP_FullPathData &dst)
 Element Destructor. More...
static void trivialDestructRange (DOP_FullPathData *dst, exint n)

Detailed Description

Definition at line 139 of file DOP_FullPathData.h.

Constructor & Destructor Documentation

DOP_FullPathDataArray::DOP_FullPathDataArray ( )
virtual DOP_FullPathDataArray::~DOP_FullPathDataArray ( )

Member Function Documentation

void DOP_FullPathDataArray::buildFromPaths ( const UT_StringArray paths)
void DOP_FullPathDataArray::getObjectArray ( SIM_ConstObjectArray objects) const
void DOP_FullPathDataArray::getObjectString ( UT_WorkBuffer buffer) const

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