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]);
118 indices_.begin()+start,
119 indices_.begin()+start+
M,
136 List<Type> tmpValues(this->size());
140 tmpValues[i] = this->operator[](indices_[i]);
153 indices_ =
rhs.indices();
Functions used by OpenFOAM that are specific to POSIX compliant operating systems and need to be repl...
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
void transfer(List< T > &list)
Transfer the contents of the argument List into this list and annul the argument list.
void operator=(const UList< T > &list)
Assignment to UList operator. Takes linear time.
void setSize(label n)
Alias for resize().
Less function class used by the sort function.
A list that is sorted upon construction or when explicitly requested with the sort() method.
const labelList & indices() const
Return the list of sorted indices. Updated every sort.
void stableSort()
Sort the list (if changed after construction time).
void operator=(const SortableListEFA< Type > &)
void sort()
Sort the list (if changed after construction time).
SortableListEFA(const List< Type > &)
Construct from List, sorting the elements. Starts with indices set.
void partialSort(int M, int start)
Partial sort the list (if changed after construction time).
void setSize(const label)
Size the list. If grow can cause undefined indices (until next sort).
Type & operator[](const label i)
static bool less(const vector &x, const vector &y)
To compare normals.
void sort(UList< T > &list)
Sort the list.
void rhs(fvMatrix< typename Expr::value_type > &m, const Expr &expression)
void stableSort(UList< T > &list)
Stable sort the list.
#define forAll(list, i)
Loop across all elements in list.