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