Go to the documentation of this file.
35 const UPtrList<T>& input
39 sortedOrder(input, order,
typename PtrListOps::less<T>(input));
55 template<
class T,
class ListComparePredicate>
60 const ListComparePredicate& comp
63 const label len = input.
size();
66 if (order.size() != len)
88 template<
class T,
class Compare>
List< label > labelList
A List of labels.
label size() const noexcept
The number of elements in the list.
Functions to operate on Pointer Lists.
A UPtrList compare binary predicate for normal sort.
void stableSort(UList< T > &a)
A list of pointers to objects of type <T>, without allocation/deallocation management of the pointers...
void resize(const label newSize)
Adjust allocated size of list.
void sortOrder(const labelUList &order, const bool testNull=true)
void shuffle(UList< T > &a)
labelList identity(const label len, label start=0)
Create identity map of the given length with (map[i] == i)
void clear()
Clear the list, i.e. set size to zero.
labelList sortedOrder(const UList< T > &input)
Return the (stable) sort order for the list.