33template<
class LListBase,
class T>
38 for (
const T& val : lst)
45template<
class LListBase,
class T>
54template<
class LListBase,
class T>
59 for (
const T& val : lst)
68template<
class LListBase,
class T>
77template<
class LListBase,
class T>
80 label len = this->size();
91template<
class LListBase,
class T>
101template<
class LListBase,
class T>
106 for (
const T& val : lst)
113template<
class LListBase,
class T>
122template<
class LListBase,
class T>
127 for (
const T& val : lst)
Template class for non-intrusive linked lists.
LList()=default
Default construct.
void clear()
Delete contents of list.
void append(const T &elem)
Add copy at back of list.
void operator=(const LList< LListBase, T > &lst)
Copy assignment.
transferModelList & transfer()
Transfer.
rAUs append(new volScalarField(IOobject::groupName("rAU", phase1.name()), 1.0/(U1Eqn.A()+byDt(max(phase1.residualAlpha() - alpha1, scalar(0)) *rho1))))