Go to the documentation of this file.
28 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
38 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
52 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
55 const DynamicList<T, SizeInc, SizeMult, SizeDiv>& lst
63 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
74 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
77 const UIndirectList<T>& lst
85 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
99 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
107 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
116 if (nextFree > capacity_)
119 nextFree = capacity_;
128 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
135 if (nElem > capacity_)
153 label(SizeInc + capacity_ * SizeMult / SizeDiv)
165 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
172 if (nElem > capacity_)
190 label(SizeInc + capacity_ * SizeMult / SizeDiv)
202 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
213 while (nextFree < nElem)
215 this->operator[](nextFree++) = t;
220 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
230 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
241 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
248 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
256 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
261 if (capacity_ > nextFree)
267 capacity_ = nextFree;
275 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
279 capacity_ = lst.
size();
284 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
288 DynamicList<T, SizeInc, SizeMult, SizeDiv>& lst
292 capacity_ = lst.capacity_;
299 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
303 return xferMoveTo< List<T> >(*this);
307 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
317 this->operator[](elemI) = t;
322 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
336 setSize(nextFree + lst.size());
340 this->operator[](nextFree++) = lst[elemI];
346 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
350 const UIndirectList<T>& lst
354 setSize(nextFree + lst.size());
358 this->operator[](nextFree++) = lst[elemI];
364 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
385 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
396 return this->operator[](elemI);
400 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
410 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
413 const DynamicList<T, SizeInc, SizeMult, SizeDiv>& lst
422 if (capacity_ >= lst.size())
439 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
445 if (capacity_ >= lst.size())
462 template<
class T,
unsigned SizeInc,
unsigned SizeMult,
unsigned SizeDiv>
465 const UIndirectList<T>& lst
468 if (capacity_ >= lst.size())
void resize(const label)
Alter the addressed list size.
points setSize(newPointi)
Xfer< List< T > > xfer()
Transfer contents to the Xfer container as a plain List.
label capacity() const
Size of the underlying storage.
#define forAll(list, i)
Loop across all elements in list.
A 1D vector of objects of type <T> that resizes itself as necessary to accept the new objects.
A simple container for copying or transferring objects of type <T>.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
void clear()
Clear the addressed list, i.e. set the size to zero.
void setCapacity(const label)
Alter the size of the underlying storage.
DynamicList< T, SizeInc, SizeMult, SizeDiv > & shrink()
Shrink the allocated space to the number of elements used.
errorManip< error > abort(error &err)
DynamicList< T, SizeInc, SizeMult, SizeDiv > & append(const T &)
Append an element at the end of the list.
dimensioned< Type > max(const dimensioned< Type > &, const dimensioned< Type > &)
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
void transfer(List< T > &)
Transfer contents of the argument List into this.
void clearStorage()
Clear the list and delete storage.
T remove()
Remove and return the top element.
void reserve(const label)
Reserve allocation space for at least this size.
void size(const label)
Override size to be inconsistent with allocated storage.
void setSize(const label)
Alter the addressed list size.
friend Ostream & operator(Ostream &, const DynamicList< T, SizeInc, SizeMult, SizeDiv > &)
DynamicList()
Construct null.