Go to the documentation of this file.
107 class const_iterator;
113 inline constexpr
UPtrList() noexcept;
146 inline
bool empty() const noexcept;
152 inline const
T&
first() const;
158 inline const
T&
last() const;
188 inline const
T*
set(const
label i) const;
253 inline pointer operator->()
const;
286 const T*
const* ptr_;
const_iterator operator-(difference_type n) const
bool operator==(const const_iterator &iter) const
label size() const noexcept
The number of elements in the list.
T & first()
Return reference to the first element of the list.
bool operator<(const const_iterator &iter) const
iterator begin()
Return an iterator to begin traversing the UPtrList.
void clear()
Set list size to zero.
void swap(UPtrList< T > &list)
Swap content.
void append(T *ptr)
Append an element to the end of the list.
const_iterator & operator+=(difference_type n)
const_iterator & operator++()
Detail::PtrListDetail< T > ptrs_
The list of pointers.
tmp< faMatrix< Type > > operator-(const faMatrix< Type > &)
T & reference
A non-const reference to the value_type.
const T * set(const label i) const
Return const pointer to element (if set) or nullptr.
reference operator()() const
reference operator*() const
Random-access iterator with const access.
bool operator>(const const_iterator &iter) const
void transfer(UPtrList< T > &list)
Transfer contents into this list and annul the argument.
bool operator!=(const eddy &a, const eddy &b)
void resize(const label newLen)
Reset size of list.
T value_type
Type of values the list contains.
bool operator>=(const const_iterator &iter) const
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
tmp< faMatrix< Type > > operator==(const faMatrix< Type > &, const faMatrix< Type > &)
bool operator!=(const const_iterator &iter) const
Random-access iterator with non-const access.
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
A list of pointers to objects of type <T>, without allocation/deallocation management of the pointers...
A list of pointers to objects of type <T>, with allocation/deallocation management of the pointers....
pointer get() const
Return pointer, can be nullptr.
friend Ostream & operator(Ostream &os, const UPtrList< T > &list)
Write UPtrList to Ostream.
constexpr UPtrList() noexcept
Construct null.
void sortOrder(const labelUList &order, const bool testNull=true)
const_iterator & operator--()
std::random_access_iterator_tag iterator_category
bool operator<=(const const_iterator &iter) const
const_iterator operator+(difference_type n) const
const_iterator cend() const
Return an const_iterator to end traversing the UPtrList.
bool operator<(const Instant< T1 > &a, const Instant< T2 > &b)
Compare instant values for less-than.
iterator end()
Return an iterator to end traversing the UPtrList.
reference operator[](difference_type n) const
T & last()
Return reference to the last element of the list.
tmp< faMatrix< Type > > operator+(const faMatrix< Type > &, const faMatrix< Type > &)
label squeezeNull()
Squeeze out intermediate nullptr entries in the list of pointers.
tmp< faMatrix< Type > > operator*(const areaScalarField &, const faMatrix< Type > &)
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
const_iterator & operator-=(difference_type n)
bool operator>(const Instant< T1 > &a, const Instant< T2 > &b)
Compare instant values for greater-than.
const T & operator[](const label i) const
Return const reference to the element.
A rudimentary list of pointers used for PtrList, UPtrList, etc. This class is considered implementati...
pointer operator->() const
std::random_access_iterator_tag iterator_category
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
void reorder(const labelUList &oldToNew, const bool testNull=true)
const T * operator()(const label i) const
Return const pointer to the element.
const typedef T & const_reference
A const reference to the value_type.
bool operator<=(const Pair< T > &a, const Pair< T > &b)
bool operator>=(const Pair< T > &a, const Pair< T > &b)
const_iterator cbegin() const
Return an const_iterator to begin traversing the UPtrList.
bool empty() const noexcept
True if the list is empty (ie, size() is zero)
Ostream & operator<<(Ostream &, const boundaryPatch &)
const_iterator(const T *const *ptr)
Construct for a given entry.
void setSize(const label newLen)
Same as resize()