Go to the documentation of this file.
66 indices_(lst.indices())
73 List<
T>(std::move(lst)),
74 indices_(std::move(lst.indices_))
97 template<
class InputIterator>
100 InputIterator begIter,
101 InputIterator endIter
133 return static_cast<List<T>&
>(*this);
160 indices_.resize(this->size());
166 indices_.begin() + start,
167 indices_.begin() + start +
n,
180 indices_.resize(this->size());
186 indices_.begin() + start,
187 indices_.begin() + start +
n,
206 indices_.swap(lst.indices_);
void sort()
Forward (stable) sort the list (if changed after construction).
List< T > values(const HashTable< T, Key, Hash > &tbl, const bool doSort=false)
List of values from HashTable, optionally sorted.
static bool less(const vector &x, const vector &y)
To compare normals.
void reverseSort()
Reverse (stable) sort the list.
void Swap(DynamicList< T, SizeMin1 > &a, DynamicList< T, SizeMin2 > &b)
void partialSort(label n, label start=0)
Forward partial sort the list until the middle point.
A list compare binary predicate for reverse sort.
const dimensionedScalar b
Wien displacement law constant: default SI units: [m.K].
void transfer(List< T > &list)
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
void partialReverseSort(label n, label start=0)
Reverse partial sort the list until the middle point.
void operator=(const T &val)
Assignment of all entries to the given value, removing indices.
A list compare binary predicate for normal sort.
void operator=(const UList< T > &a)
Assignment to UList operator. Takes linear time.
List< T > & shrink()
Clear the indices and return a reference to the underlying List.
void swap(SortableList< T > &lst)
Swap content with another SortableList in constant time.
A list that is sorted upon construction or when explicitly requested with the sort() method.
constexpr SortableList() noexcept
Null constructor, sort later (eg, after assignment or transfer)
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
UList< T > & operator=(const UList< T > &)=delete
No copy assignment (default: shallow copy)
void identity(labelUList &map, label start=0)
Set identity map with (map[i] == i)
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
void clear()
Clear the list, i.e. set size to zero.
const labelList & indices() const
Return the list of sorted indices. Updated every sort.
Various functions to operate on Lists.
void clear()
Clear the list and the indices.
labelList sortedOrder(const UList< T > &input)
Return the (stable) sort order for the list.
A class representing the concept of 0 (zero) that can be used to avoid manipulating objects known to ...