58 List<Type>(size, val),
72 indices_(lst.indices())
88 indices_.setSize(newSize);
102 List<Type> tmpValues(this->size());
106 tmpValues[i] = this->operator[](indices_[i]);
113 template <
class Type>
118 indices_.begin()+start,
119 indices_.begin()+start+
M,
126 template <
class Type>
136 List<Type> tmpValues(this->size());
140 tmpValues[i] = this->operator[](indices_[i]);
149 template <
class Type>
void transfer(List< T > &list)
Transfer the contents of the argument List into this list and annul the argument list.
SortableListEFA(const List< Type > &)
Construct from List, sorting the elements. Starts with indices set.
void stableSort(UList< T > &list)
Stable sort the list.
A list that is sorted upon construction or when explicitly requested with the sort() method...
static bool less(const vector &x, const vector &y)
To compare normals.
const labelList & indices() const
Return the list of sorted indices. Updated every sort.
#define forAll(list, i)
Loop across all elements in list.
void operator=(const SortableListEFA< Type > &)
List< T > values(const HashTable< T, Key, Hash > &tbl, const bool doSort=false)
List of values from HashTable, optionally sorted.
Functions used by OpenFOAM that are specific to POSIX compliant operating systems and need to be repl...
void setSize(const label n)
Alias for resize()
void operator=(const UList< T > &list)
Assignment to UList operator. Takes linear time.
void sort(UList< T > &list)
Sort the list.
Less function class used by the sort function.
void setSize(const label)
Size the list. If grow can cause undefined indices (until next sort)
void partialSort(int M, int start)
Partial sort the list (if changed after construction time)
void stableSort()
Sort the list (if changed after construction time)
void sort()
Sort the list (if changed after construction time)