Go to the documentation of this file.
33 template<
class LListBase,
class T>
36 for (
auto iter = lst.
cbegin(); iter != lst.
cend(); ++iter)
45 template<
class LListBase,
class T>
50 for (
auto iter = lst.
cbegin(); iter != lst.
cend(); ++iter)
57 template<
class LListBase,
class T>
63 if (this->size() != rhs.size())
70 for (
auto iter1 = this->
cbegin(); iter1 != this->
cend(); ++iter1, ++iter2)
72 if (!(*iter1 == *iter2))
82 template<
class LListBase,
class T>
void operator=(const UILList< LListBase, T > &lst)
Copy assignment.
UILList()=default
Default construct.
const_iterator cbegin() const
Iterator to first item in list with const access.
rAUs append(new volScalarField(IOobject::groupName("rAU", phase1.name()), 1.0/(U1Eqn.A()+byDt(max(phase1.residualAlpha() - alpha1, scalar(0)) *rho1))))
const const_iterator & cend() const
End of list for forward iterators.
tmp< faMatrix< Type > > operator==(const faMatrix< Type > &, const faMatrix< Type > &)
constexpr auto cend(const C &c) -> decltype(c.end())
Return const_iterator to the end of the container c.
constexpr auto cbegin(const C &c) -> decltype(c.begin())
Return const_iterator to the beginning of the container c.
Template class for intrusive linked lists.