33template<
class LListBase,
class T>
36 LList<LListBase,
T*>()
38 for (
auto iter = lst.cbegin(); iter != lst.cend(); ++iter)
40 this->
append((*iter).clone().ptr());
45template<
class LListBase,
class T>
48 LList<LListBase,
T*>()
56template<
class LListBase,
class T>
65template<
class LListBase,
class T>
68 T*
p = this->removeHead();
74template<
class LListBase,
class T>
77 label len = this->size();
88template<
class LListBase,
class T>
98template<
class LListBase,
class T>
103 for (
auto iter = lst.
cbegin(); iter != lst.
cend(); ++iter)
105 this->
append((*iter).clone().ptr());
110template<
class LListBase,
class T>
Template class for non-intrusive linked lists.
void clear()
Delete contents of list.
void append(const T * &elem)
Add copy at back of list.
Template class for non-intrusive linked PtrLists.
const_iterator cbegin() const
Iterator to first item in list with const access.
bool eraseHead()
Remove the head element from the list and delete the pointer.
const const_iterator & cend() const
End of list for forward iterators.
void operator=(const LPtrList< LListBase, T > &lst)
Copy assign by using 'clone()' for each element.
void clear()
Clear the contents of the list.
LPtrList()=default
Default construct.
transferModelList & transfer()
Transfer.
rAUs append(new volScalarField(IOobject::groupName("rAU", phase1.name()), 1.0/(U1Eqn.A()+byDt(max(phase1.residualAlpha() - alpha1, scalar(0)) *rho1))))