#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) noexcept
	Move constructor. Steals the working data from the original. More...

	UT_Array (const exint capacity, const exint size)
	Construct based on given capacity and size. More...

	UT_Array (const exint capacity=0)
	Construct based on given capacity with a size of 0. More...

	UT_Array (std::initializer_list< DOP_FullPathData > init)

	~UT_Array ()

void	swap (UT_Array< DOP_FullPathData > &other)

exint	append ()

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	uniqueSortedInsert (DOP_FullPathData &&t, Comparator compare)

exint	uniqueSortedFind (const DOP_FullPathData &item, ComparatorBool is_less={}) const

exint	uniqueSortedFind (const DOP_FullPathData &item, Comparator compare) 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, ComparatorBool is_less={}) const

bool	hasSortedSubset (const UT_Array< DOP_FullPathData > &other, Comparator compare) const

void	sortedUnion (const UT_Array< DOP_FullPathData > &other, ComparatorBool is_less={})

void	sortedUnion (const UT_Array< DOP_FullPathData > &other, UT_Array< DOP_FullPathData > &result, ComparatorBool is_less={}) 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, ComparatorBool is_less={})

void	sortedIntersection (const UT_Array< DOP_FullPathData > &other, UT_Array< DOP_FullPathData > &result, ComparatorBool is_less={}) 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, ComparatorBool is_less={})

void	sortedSetDifference (const UT_Array< DOP_FullPathData > &other, UT_Array< DOP_FullPathData > &result, ComparatorBool is_less={}) 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

exint	heapPush (const DOP_FullPathData &t, Comparator compare)

DOP_FullPathData	heapPop (Comparator compare)

const DOP_FullPathData &	heapMax () const

exint	concat (const UT_Array< DOP_FullPathData > &a)
	Takes another T array and concatenate it onto my end. More...

exint	concat (UT_Array< DOP_FullPathData > &&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 DOP_FullPathData &t, exint index)

bool	isValidIndex (exint index) const
	Return true if given index is valid. More...

exint	findAndRemove (const S &s)

exint	removeIndex (exint index)

SYS_FORCE_INLINE void	removeLast ()

void	removeRange (exint begin_i, exint end_i)

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 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 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 S &s, exint start=0) const

exint	sortedFind (const DOP_FullPathData &t, Comparator compare) const

void	reverse ()
	Reverses the array by swapping elements in mirrored locations. More...

void	sort (ComparatorBool is_less={})
	Sort using std::sort with bool comparator. Defaults to operator<(). More...

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	stableSortRange (ComparatorBool is_less, exint start, exint end)
	Like stableSort, but operates on a subset of the array. More...

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)

exint	sortAndRemoveDuplicates (ComparatorBool is_less={})

DOP_FullPathData	selectNthLargest (exint idx, ComparatorBool is_less={})

void	setCapacity (exint new_capacity)

void	setCapacityIfNeeded (exint min_capacity)

void	bumpCapacity (exint min_capacity)

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	setSizeIfNeeded (exint minsize)

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_FullPathData &	operator() (exint i)

const DOP_FullPathData &	operator() (exint i) const

DOP_FullPathData &	operator[] (exint i)

const DOP_FullPathData &	operator[] (exint i) const

DOP_FullPathData &	forcedRef (exint i)

DOP_FullPathData	forcedGet (exint i) const

DOP_FullPathData &	last ()

const DOP_FullPathData &	last () const

exint	apply (int(apply_func)(DOP_FullPathData &t, void d), void *d)

DOP_FullPathData	accumulate (const DOP_FullPathData &init_value, BinaryOp add) const

DOP_FullPathData *	getArray () const

const DOP_FullPathData *	getRawArray () const

DOP_FullPathData *	array ()

const DOP_FullPathData *	array () const

DOP_FullPathData *	data ()

const DOP_FullPathData *	data () const

DOP_FullPathData *	aliasArray (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< iterator >	range ()

UT_IteratorRange< const_iterator >	range () 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< 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...

exint	sortedInsert (const DOP_FullPathData &t, Comparator compare)

exint	sortedInsert (const DOP_FullPathData &t, ComparatorBool is_less={})

exint	index (const DOP_FullPathData &t) const

exint	safeIndex (const DOP_FullPathData &t) const

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 >	iterator

typedef base_iterator< const DOP_FullPathData, true >	const_iterator

typedef base_iterator < DOP_FullPathData, false >	reverse_iterator

typedef base_iterator< const DOP_FullPathData, false >	const_reverse_iterator

typedef const_iterator	traverser

Protected Member Functions inherited from UT_Array< DOP_FullPathData >
	UT_Array (const UT_ArrayCT::ExternalCapacity, DOP_FullPathData *external_data, const exint external_capacity)

	UT_Array (const UT_ArrayCT::ExternalMove, DOP_FullPathData *external_data, const exint external_capacity, UT_Array &&a)

exint	appendImpl (S &&s)

exint	insertImpl (S &&s, exint index)
	Similar to appendImpl() but for insertion. More...

exint	uniqueSortedInsertImpl (S &&s, Comparator compare)

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 SYS_FORCE_INLINE bool	isPOD ()

static void	construct (DOP_FullPathData &dst, S &&...s)

static void	copyConstruct (DOP_FullPathData &dst, const DOP_FullPathData &src)

Detailed Description

Definition at line 99 of file DOP_FullPathData.h.

Constructor & Destructor Documentation

DOP_FullPathDataArray::DOP_FullPathDataArray ( )

virtual DOP_FullPathDataArray::~DOP_FullPathDataArray ( )

virtual

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:

DOP/DOP_FullPathData.h

Public Member Functions

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation