Go to the documentation of this file.
64 template<
class T,
class ListComparePredicate>
67 const UPtrList<T>&
input,
69 const ListComparePredicate& comp
75 void sort(UPtrList<T>& list);
78 template<
class T,
class Compare>
79 void sort(UPtrList<T>& list,
const Compare& comp);
83 void shuffle(UPtrList<T>& list);
109 const T*
const ptr1 =
values(a);
112 return (ptr1 && ptr2) ? (*ptr1 < *ptr2) : !ptr2;
131 const T*
const ptr1 =
values(a);
134 return (ptr1 && ptr2) ? (*ptr2 < *ptr1) : !ptr2;
List< label > labelList
A List of labels.
less(const UPtrList< T > &list)
A UPtrList compare binary predicate for normal sort.
A UPtrList compare binary predicate for reverse sort.
const dimensionedScalar b
Wien displacement law constant: default SI units: [m.K].
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
const UPtrList< T > & values
A list of pointers to objects of type <T>, without allocation/deallocation management of the pointers...
const UPtrList< T > & values
void shuffle(UList< T > &a)
bool operator()(const label a, const label b) const
static Istream & input(Istream &is, IntRange< T > &range)
bool operator()(const label a, const label b) const
greater(const UPtrList< T > &list)
Various functions to operate on Lists.
labelList sortedOrder(const UList< T > &input)
Return the (stable) sort order for the list.