Go to the documentation of this file.
38 #ifndef SortableListDRGEP_H
39 #define SortableListDRGEP_H
81 return values_[a] < values_[
b];
void operator=(const SortableListDRGEP< Type > &)
List< T > values(const HashTable< T, Key, Hash > &tbl, const bool doSort=false)
List of values from HashTable, optionally sorted.
bool operator()(const label a, const label b)
less(const UList< Type > &values)
const labelList & indices() const
Return the list of sorted indices. Updated every sort.
void partialSort(int M)
Partial sort the list (if changed after construction time)
const dimensionedScalar b
Wien displacement law constant: default SI units: [m.K].
A list that is sorted upon construction or when explicitly requested with the sort() method.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
void stableSort()
Sort the list (if changed after construction time)
Less function class used by the sort function.
void sort()
Sort the list (if changed after construction time)
void setSize(const label)
Size the list. If grow can cause undefined indices (until next sort)
SortableListDRGEP(const List< Type > &)
Construct from List, sorting the elements. Starts with indices set.