Dynamically sized Field. Similar to DynamicList, but inheriting from a Field instead of a List. More...

#include <DynamicField.H>

Inheritance diagram for DynamicField< T, SizeMin >:

[legend]

Collaboration diagram for DynamicField< T, SizeMin >:

Public Member Functions
constexpr	DynamicField () noexcept
	Default construct, an empty field without allocation.
	DynamicField (const label initialCapacity)
	Construct empty field with given initial capacity.
	DynamicField (std::pair< label, label > sizing)
	Construct with given size and capacity.
	DynamicField (const label len, const T &val)
	Construct given size and initial value.
	DynamicField (const label len, Foam::zero)
	Construct given size and initial value of zero.
	DynamicField (const DynamicField< T, SizeMin > &list)
	Copy construct.
template<int AnySizeMin>
	DynamicField (const DynamicField< T, AnySizeMin > &list)
	Copy construct with different sizing parameters.
	DynamicField (const UList< T > &list)
	Copy construct from UList. Size set to UList size.
template<class Addr>
	DynamicField (const IndirectListBase< T, Addr > &list)
	Copy construct from IndirectList.
	DynamicField (List< T > &&content) noexcept
	Move construct from List contents.
	DynamicField (DynamicField< T, SizeMin > &&content) noexcept
	Move construct from dynamic Field contents.
template<int AnySizeMin>
	DynamicField (DynamicField< T, AnySizeMin > &&content) noexcept
	Move construct with different sizing parameters.
template<int AnySizeMin>
	DynamicField (DynamicList< T, AnySizeMin > &&content) noexcept
	Move construct from DynamicList.
template<int AnySizeMin>
	DynamicField (DynamicField< T, AnySizeMin > &content, bool reuse)
	Copy or move construct from DynamicField.
template<int AnySizeMin>
	DynamicField (DynamicList< T, AnySizeMin > &content, bool reuse)
	Copy or move construct from DynamicList.
	DynamicField (List< T > &content, bool reuse)
	Copy or move construct from List.
	DynamicField (const UList< T > &mapF, const labelUList &mapAddressing)
	Construct by 1 to 1 mapping from the given field.
	DynamicField (const UList< T > &mapF, const labelListList &mapAddressing, const scalarListList &weights)
	Construct by interpolative mapping from the given field.
	DynamicField (const UList< T > &mapF, const FieldMapper &map)
	Construct by mapping from the given field.
	DynamicField (Istream &is)
	Construct from Istream. Size set to size of list read.
tmp< DynamicField< T, SizeMin > >	clone () const
	Clone.
	~DynamicField ()
	Destructor, sync allocated size before list destruction.
label	capacity () const noexcept
	Size of the underlying storage.
std::streamsize	capacity_bytes () const noexcept
	Number of contiguous bytes of the underlying storage.
void	setCapacity (const label len)
	Alter the size of the underlying storage.
void	setCapacity_nocopy (const label len)
	Alter the size of the underlying storage, without retaining old content.
void	setCapacity_unsafe (label len) noexcept
	Change the value for the list capacity directly (ADVANCED, UNSAFE) Does not perform any memory management or resizing.
void	reserve (const label len)
	Reserve allocation space for at least this size, allocating new space if required and retaining old content.
void	reserve_nocopy (const label len)
	Reserve allocation space for at least this size, allocating new space if required without retaining old content.
void	reserve_exact (const label len)
	Reserve allocation space for at least this size, allocating new space if required and retaining old content. If allocation is required, uses the specified size without any other resizing logic.
void	resize (const label len)
	Alter addressable list size, allocating new space if required while recovering old content.
void	resize (const label len, const T &val)
	Alter addressable size and fill new entries with constant value.
void	resize_copy (label count, const label len)
	Alter addressable size, retaining the first count contents.
void	resize_fill (const label len, const T &val)
	Alter addressable size and set val for all addressed entries.
void	resize_nocopy (const label len)
	Alter addressable list size, allocating new space if required without necessarily recovering old content.
void	clear () noexcept
	Clear the addressed list, i.e. set the size to zero.
void	clearStorage ()
	Clear the list and delete storage.
void	shrink_to_fit ()
	Shrink the allocated space to the number of elements used.
void	swap (List< T > &other)
	Swap with plain List content. Implies shrink_to_fit().
template<int AnySizeMin>
void	swap (DynamicField< T, AnySizeMin > &other) noexcept
	Swap content, independent of sizing parameter.
template<int AnySizeMin>
void	swap (DynamicList< T, AnySizeMin > &other) noexcept
	Swap content with DynamicList, independent of sizing parameter.
void	transfer (List< T > &list)
	Transfer the parameter contents into this.
template<int AnySizeMin>
void	transfer (DynamicList< T, AnySizeMin > &list)
	Transfer the parameter contents into this.
template<int AnySizeMin>
void	transfer (DynamicField< T, AnySizeMin > &list)
	Transfer the parameter contents into this.
template<class... Args>
T &	emplace_back (Args &&... args)
	Construct an element at the end of the list, return reference to the new list element.
void	push_back (const T &val)
	Copy append an element to the end of the list.
void	push_back (T &&val)
	Move append an element.
void	push_back (const UList< T > &list)
	Copy append another list to the end of this list.
void	push_back (List< T > &&list)
	Move append another list to the end of this list.
void	pop_back (label n=1)
	Reduce size by 1 or more elements. Can be called on an empty list.
Istream &	readList (Istream &is)
	Read from Istream, discarding existing contents.
void	operator= (const T &val)
	Assign addressed entries to the given value.
void	operator= (Foam::zero)
	Assign addressed entries to zero.
void	operator= (const UList< T > &list)
	Copy assignment.
void	operator= (const DynamicField< T, SizeMin > &list)
	Copy assignment.
template<class Addr>
void	operator= (const IndirectListBase< T, Addr > &rhs)
	Copy assign from IndirectList.
void	operator= (List< T > &&list)
	Move assignment.
template<int AnySizeMin>
void	operator= (DynamicList< T, AnySizeMin > &&list)
	Move assignment.
void	operator= (DynamicField< T, SizeMin > &&list)
	Move assignment.
template<int AnySizeMin>
void	operator= (DynamicField< T, AnySizeMin > &&list)
	Move assignment.
T &	operator() (const label i)
	Return non-const access to an element, resizing list if needed.
void	setSize (const label n)
	Alias for resize().
void	setSize (const label n, const T &val)
	Alias for resize().
DynamicField< T, SizeMin > &	shrink ()
	Calls shrink_to_fit() and returns a reference to the DynamicField.
void	append (const T &val)
	Append an element at the end of the list.
void	append (T &&val)
	Move append an element.
void	append (const UList< T > &list)
	Append a List at the end of this list.
Public Member Functions inherited from Field< T >
constexpr	Field () noexcept
	Default construct.
	Field (const label len)
	Construct given size.
	Field (const label len, const T &val)
	Construct given size and initial value.
	Field (const label len, Foam::zero)
	Construct given size and initial values of zero.
	Field (Foam::one, const T &val)
	Construct with length=1, copying the value as the only content.
	Field (Foam::one, T &&val)
	Construct with length=1, moving the value as the only content.
	Field (Foam::one, Foam::zero)
	Construct with length=1, initializing content to zero.
	Field (const Field< T > &fld)
	Copy construct.
	Field (const UList< T > &list)
	Copy construct from UList<Type>.
	Field (const IndirectListBase< T, Addr > &list)
	Copy construct from IndirectList.
	Field (Field< T > &&fld) noexcept
	Move construct from Field.
	Field (List< T > &&list) noexcept
	Move construct from List.
	Field (DynamicList< T, SizeMin > &&list)
	Move construct from DynamicList.
	Field (const UList< T > &mapF, const labelUList &mapAddressing)
	Construct by 1 to 1 mapping from the given field.
	Field (const tmp< Field< T > > &tmapF, const labelUList &mapAddressing)
	Construct by 1 to 1 mapping from the given tmp field.
	Field (const UList< T > &mapF, const labelListList &mapAddressing, const scalarListList &weights)
	Construct by interpolative mapping from the given field.
	Field (const tmp< Field< T > > &tmapF, const labelListList &mapAddressing, const scalarListList &weights)
	Construct by interpolative mapping from the given tmp field.
	Field (const UList< T > &mapF, const FieldMapper &map, const bool applyFlip=true)
	Construct by mapping from the given field.
	Field (const UList< T > &mapF, const FieldMapper &map, const T &defaultValue, const bool applyFlip=true)
	Construct by mapping from the given field.
	Field (const UList< T > &mapF, const FieldMapper &map, const UList< T > &defaultValues, const bool applyFlip=true)
	Construct by mapping from the given field.
	Field (const tmp< Field< T > > &tmapF, const FieldMapper &map, const bool applyFlip=true)
	Construct by mapping from the given tmp field.
	Field (const tmp< Field< T > > &tmapF, const FieldMapper &map, const T &defaultValue, const bool applyFlip=true)
	Construct by mapping from the given tmp field. Uses supplied uniform value for unmapped items.
	Field (const tmp< Field< T > > &tmapF, const FieldMapper &map, const UList< T > &defaultValues, const bool applyFlip=true)
	Construct by mapping from the given tmp field. Uses supplied values for unmapped items.
	Field (Field< T > &fld, bool reuse)
	Copy construct or re-use as specified.
	Field (const tmp< Field< T > > &tfld)
	Copy or move construct from tmp.
	Field (Istream &is)
	Construct from Istream.
	Field (const entry &e, const label len)
	Construct from a dictionary (primitive) entry.
	Field (const word &key, const dictionary &dict, const label len, IOobjectOption::readOption readOpt=IOobjectOption::MUST_READ)
	Lookup of a primitive dictionary entry by (literal) name and assign its contents to this. The behaviour largely as described in assign():
tmp< Field< T > >	clone () const
	Clone.
void	assign (const entry &e, const label len)
	Assign from a primitive dictionary entry with the following behaviour:
bool	assign (const word &key, const dictionary &dict, const label len, IOobjectOption::readOption readOpt=IOobjectOption::MUST_READ)
	Lookup a primitive dictionary entry by (literal) name and assign its contents to this (behaviour as described above).
void	map (const UList< T > &mapF, const labelUList &mapAddressing)
	1 to 1 map from the given field
void	map (const tmp< Field< T > > &tmapF, const labelUList &mapAddressing)
	1 to 1 map from the given tmp field
void	map (const UList< T > &mapF, const labelListList &mapAddressing, const scalarListList &weights)
	Interpolative map from the given field.
void	map (const tmp< Field< T > > &tmapF, const labelListList &mapAddressing, const scalarListList &weights)
	Interpolative map from the given tmp field.
void	map (const UList< T > &mapF, const FieldMapper &map, const bool applyFlip=true)
	Map from the given field.
void	map (const tmp< Field< T > > &tmapF, const FieldMapper &map, const bool applyFlip=true)
	Map from the given tmp field.
void	autoMap (const FieldMapper &map, const bool applyFlip=true)
	Map from self.
void	rmap (const UList< T > &mapF, const labelUList &mapAddressing)
	1 to 1 reverse-map from the given field
void	rmap (const tmp< Field< T > > &tmapF, const labelUList &mapAddressing)
	1 to 1 reverse-map from the given tmp field
void	rmap (const UList< T > &mapF, const labelUList &mapAddressing, const UList< scalar > &weights)
	Interpolative reverse map from the given field.
void	rmap (const tmp< Field< T > > &tmapF, const labelUList &mapAddressing, const UList< scalar > &weights)
	Interpolative reverse map from the given tmp field.
void	negate ()
	Inplace negate this field (negative).
void	normalise ()
	Inplace normalise this field. Generally a no-op except for vector fields.
tmp< Field< cmptType > >	component (const direction) const
	Return a component field of the field.
void	replace (const direction, const UList< cmptType > &)
	Replace a component field of the field.
void	replace (const direction, const tmp< Field< cmptType > > &)
	Replace a component field of the field.
void	replace (const direction, const cmptType &)
	Replace a component field of the field.
void	clamp_min (const T &lower)
	Impose lower (floor) clamp on the field values (in-place).
void	clamp_min (const UList< T > &lower)
	Impose lower (floor) clamp on the field values (in-place).
void	clamp_max (const T &upper)
	Impose upper (ceiling) clamp on the field values (in-place).
void	clamp_max (const UList< T > &upper)
	Impose upper (ceiling) clamp on the field values (in-place).
void	clamp_range (const T &lower, const T &upper)
	Clamp field values (in-place) to the specified range.
void	clamp_range (const MinMax< T > &range)
	Clamp field values (in-place) to the specified range.
VSForm	block (const label start) const
tmp< Field< T > >	T () const
	Return the field transpose (only defined for second rank tensors).
void	writeEntry (const word &keyword, Ostream &os) const
	Write the field as a dictionary entry.
SubField< T >	slice (const label pos, label len=-1)
	Return SubField slice (non-const access) - no range checking.
const SubField< T >	slice (const label pos, label len=-1) const
	Return SubField slice (const access) - no range checking.
SubField< T >	slice (const labelRange &range)
	Return SubField slice (non-const access) - with range checking.
const SubField< T >	slice (const labelRange &range) const
	Return SubField slice (const access) - with range checking.
void	operator= (const Field< T > &)
	Copy assignment.
void	operator= (const tmp< Field< T > > &)
void	operator= (const UList< T > &rhs)
void	operator= (const SubField< T > &rhs)
void	operator= (const IndirectListBase< T, Addr > &rhs)
	Copy assign from IndirectList.
void	operator= (Field< T > &&rhs)
	Move assignment.
void	operator= (List< T > &&rhs)
void	operator= (DynamicList< T, SizeMin > &&rhs)
void	operator= (const T &val)
	Assign entries to the given value.
void	operator= (Foam::zero)
	Assign entries to zero.
void	operator= (const VectorSpace< Form, Cmpt, nCmpt > &)
void	operator+= (const UList< T > &)
void	operator+= (const tmp< Field< T > > &)
void	operator-= (const UList< T > &)
void	operator-= (const tmp< Field< T > > &)
void	operator*= (const UList< scalar > &)
void	operator*= (const tmp< Field< scalar > > &)
void	operator/= (const UList< scalar > &)
void	operator/= (const tmp< Field< scalar > > &)
void	operator+= (const T &)
void	operator-= (const T &)
void	operator*= (const scalar &)
void	operator/= (const scalar &)
	Field (const Expression::ListExpression< E > &expr)
	Construct from value expression.
void	operator= (const Expression::ListExpression< E > &expr)
	Assign values from expression.
void	operator= (const tmp< Field > &rhs)
void	normalise ()
void	normalise ()
void	normalise ()
	Inplace normalise (float) vector field.
void	normalise ()
	Inplace normalise (double) vector field.
Public Member Functions inherited from FieldBase
constexpr	FieldBase () noexcept
	Default construct.
Public Member Functions inherited from refCount
constexpr	refCount () noexcept
	Default construct, initializing count to 0.
int	use_count () const noexcept
	Return the current reference count.
bool	unique () const noexcept
	Return true if the reference count is zero.
void	operator++ () noexcept
	Increment the reference count.
void	operator++ (int) noexcept
	Increment the reference count.
void	operator-- () noexcept
	Decrement the reference count.
void	operator-- (int) noexcept
	Decrement the reference count.
Public Member Functions inherited from List< T >
constexpr	List () noexcept
	Default construct.
	List (const label len)
	Construct with given size.
	List (const label len, const T &val)
	Construct with given size and value for all elements.
	List (const label len, Foam::zero)
	Construct with given size initializing all elements to zero.
	List (Foam::one, const T &val)
	Construct with length=1, copying the value as the only content.
	List (Foam::one, T &&val)
	Construct with length=1, moving the value as the only content.
	List (Foam::one, Foam::zero)
	Construct with length=1, initializing content to zero.
	List (const List< T > &list)
	Copy construct from list.
	List (const UList< T > &list)
	Copy construct contents from list.
	List (List< T > &list, bool reuse)
	Construct as copy or re-use as specified.
	List (const UList< T > &list, const labelUList &indices)
	Copy construct subset of list.
template<unsigned N>
	List (const UList< T > &list, const FixedList< label, N > &indices)
	Copy construct subset of list.
template<unsigned N>
	List (const FixedList< T, N > &list)
	Construct as copy of FixedList<T, N>.
	List (const UPtrList< T > &list)
	Construct as copy of UPtrList<T> content.
template<class Addr>
	List (const IndirectListBase< T, Addr > &list)
	Construct as copy of IndirectList contents.
	List (std::initializer_list< T > list)
	Construct from an initializer list.
	List (List< T > &&list) noexcept
	Move construct from List.
template<int SizeMin>
	List (DynamicList< T, SizeMin > &&list)
	Move construct from DynamicList.
	List (Istream &is)
	Construct from Istream.
autoPtr< List< T > >	clone () const
	Clone.
	~List ()
	Destructor.
void	clear ()
	Clear the list, i.e. set size to zero.
void	resize (const label len)
	Adjust allocated size of list.
void	resize (const label len, const T &val)
	Adjust allocated size of list and set val for new elements.
void	resize_copy (label count, const label len)
	Change allocated size of list, retaining the first count elements.
void	resize_fill (const label len, const T &val)
	Adjust allocated size of list and set val for all elements.
void	resize_nocopy (const label len)
	Adjust allocated size of list without necessarily.
void	transfer (List< T > &list)
	Transfer the contents of the argument List into this list and annul the argument list.
template<int SizeMin>
void	transfer (DynamicList< T, SizeMin > &list)
	Transfer the contents of the argument List into this list and annul the argument list.
T &	newElmt (const label i)
	Return subscript-checked element of UList and resizing the list if required.
template<class... Args>
T &	emplace_back (Args &&... args)
	Construct an element at the end of the list, return reference to the new list element.
void	push_back (const T &val)
	Append an element at the end of the list.
void	push_back (T &&val)
	Move append an element at the end of the list.
void	push_back (const UList< T > &list)
	Append a List to the end of this list.
template<class Addr>
void	push_back (const IndirectListBase< T, Addr > &list)
	Append IndirectList contents at the end of this list.
label	push_uniq (const T &val)
	Append an element if not already in the list.
void	pop_back (label n=1)
	Reduce size by 1 or more elements. Can be called on an empty list.
void	operator= (const UList< T > &list)
	Assignment to UList operator. Takes linear time.
void	operator= (const List< T > &list)
	Assignment operator. Takes linear time.
template<class Addr>
void	operator= (const IndirectListBase< T, Addr > &list)
	Assignment from IndirectList. Takes linear time.
template<unsigned N>
void	operator= (const FixedList< T, N > &list)
	Copy assignment from FixedList.
void	operator= (std::initializer_list< T > list)
	Assignment to an initializer list.
void	operator= (const T &val)
	Assignment of all entries to the given value.
void	operator= (Foam::zero)
	Assignment of all entries to zero.
void	operator= (List< T > &&list)
	Move assignment. Takes constant time.
template<int SizeMin>
void	operator= (DynamicList< T, SizeMin > &&list)
	Move assignment. Takes constant time.
Istream &	readList (Istream &is)
	Read List from Istream, discarding contents of existing List.
void	shallowCopy (const UList< T > &)=delete
	No shallowCopy permitted.
template<class TypeT = T, class = std::enable_if_t<stdFoam::is_bool_v<TypeT>>>
bool	set (const label i, bool val=true)
	A bitSet::set() method for a list of bool.
void	append (const T &val)
	Append an element at the end of the list.
void	append (T &&val)
	Move append an element at the end of the list.
void	append (const UList< T > &list)
	Append a List to the end of this list.
template<class Addr>
void	append (const IndirectListBase< T, Addr > &list)
	Append IndirectList contents at the end of this list.
label	appendUniq (const T &val)
	Same as push_uniq().
void	setSize (label n)
	Alias for resize().
void	setSize (label n, const T &val)
	Alias for resize().
template<typename E>
	List (const Expression::ListExpression< E > &expr)
	Construct from value expression.
template<typename E>
void	operator= (const Expression::ListExpression< E > &expr)
	Assign values from expression.
void	resize (const label len)
Public Member Functions inherited from UList< T >
	UList (const UList< T > &) noexcept=default
	Copy construct, shallow copy.
	UList (UList< T > &&) noexcept=default
	Move construct, shallow copy.
UList< T > &	operator= (const UList< T > &)=delete
	No copy assignment (default: shallow copy).
UList< T > &	operator= (UList< T > &&) noexcept=default
	Move assignment, shallow copy.
constexpr	UList () noexcept
	Default construct, zero-sized and nullptr.
	UList (T *__restrict__ ptr, const label len) noexcept
	Construct from components.
	UList (SubList< T > &&) noexcept
	Move construct from a SubList, shallow copy.
label	fcIndex (const label i) const noexcept
	The forward circular index. The next index in the list which returns to the first at the end of the list.
label	rcIndex (const label i) const noexcept
	The reverse circular index. The previous index in the list which returns to the last at the beginning of the list.
const T &	fcValue (const label i) const
	Return forward circular value (ie, next value in the list).
T &	fcValue (const label i)
	Return forward circular value (ie, next value in the list).
const T &	rcValue (const label i) const
	Return reverse circular value (ie, previous value in the list).
T &	rcValue (const label i)
	Return reverse circular value (ie, previous value in the list).
const T *	cdata () const noexcept
	Return pointer to the underlying array serving as data storage.
T *	data () noexcept
	Return pointer to the underlying array serving as data storage.
const char *	cdata_bytes () const noexcept
	Return pointer to the underlying array serving as data storage,.
char *	data_bytes () noexcept
	Return pointer to the underlying array serving as data storage,.
T &	front ()
	Access first element of the list, position [0].
const T &	front () const
	Access first element of the list.
T &	back ()
	Access last element of the list, position [size()-1].
const T &	back () const
	Access last element of the list, position [size()-1].
std::streamsize	size_bytes () const noexcept
	Number of contiguous bytes for the List data.
std::streamsize	byteSize () const
	Number of contiguous bytes for the List data, runtime FatalError if type is not contiguous.
void	checkStart (const label start) const
	Check start is within valid range [0,size).
void	checkSize (const label size) const
	Check size is within valid range [0,size].
void	checkRange (const label start, const label len) const
	Check that start and length define a valid range.
void	checkIndex (const label i) const
	Check index is within valid range [0,size).
bool	uniform () const
	True if all entries have identical values, and list is non-empty.
bool	contains (const T &val) const
	True if the value is contained in the list.
bool	contains (const T &val, label pos, label len=-1) const
	Is the value contained in the list?
label	find (const T &val) const
	Find index of the first occurrence of the value.
label	find (const T &val, label pos, label len=-1) const
	Find index of the first occurrence of the value.
label	rfind (const T &val, label pos=-1) const
	Find index of the last occurrence of the value.
void	moveFirst (const label i)
	Move element to the first position.
void	moveLast (const label i)
	Move element to the last position.
void	swapFirst (const label i)
	Swap element with the first element. Fatal on an empty list.
void	swapLast (const label i)
	Swap element with the last element. Fatal on an empty list.
void	shallowCopy (T *__restrict__ ptr, const label len) noexcept
	Copy the pointer and size.
void	shallowCopy (std::nullptr_t) noexcept
	Copy nullptr and zero size.
void	shallowCopy (const UList< T > &list) noexcept
	Copy the pointer and size held by the given UList.
void	deepCopy (const UList< T > &list)
	Copy elements of the given UList. Sizes must match!
template<class Addr>
void	deepCopy (const IndirectListBase< T, Addr > &list)
	Copy elements of the given indirect list. Sizes must match!
SubList< T >	slice (const label pos, label len=-1)
	Return SubList slice (non-const access) - no range checking.
const SubList< T >	slice (const label pos, label len=-1) const
	Return SubList slice (const access) - no range checking.
SubList< T >	slice (const labelRange &range)
	Return SubList slice (non-const access) - with range checking.
const SubList< T >	slice (const labelRange &range) const
	Return SubList slice (const access) - with range checking.
T &	operator[] (const label i)
	Return element of UList.
const T &	operator[] (const label i) const
	Return element of constant UList.
	operator const Foam::List< T > & () const
	Allow cast to a const List<T>&.
void	operator= (const T &val)
	Assignment of all entries to the given value.
void	operator= (Foam::zero)
	Assignment of all entries to zero.
iterator	begin () noexcept
	Return an iterator to begin traversing the UList.
iterator	end () noexcept
	Return an iterator to end traversing the UList.
iterator	begin (const label i) noexcept
	Return iterator at offset i from begin, clamped to [0,size] range.
const_iterator	cbegin () const noexcept
	Return const_iterator to begin traversing the constant UList.
const_iterator	cend () const noexcept
	Return const_iterator to end traversing the constant UList.
const_iterator	begin () const noexcept
	Return const_iterator to begin traversing the constant UList.
const_iterator	end () const noexcept
	Return const_iterator to end traversing the constant UList.
const_iterator	cbegin (const label i) const noexcept
	Return const_iterator at offset i from begin, clamped to [0,size] range.
const_iterator	begin (const label i) const noexcept
	Return const_iterator at offset i from begin, clamped to [0,size] range.
reverse_iterator	rbegin ()
	Return reverse_iterator to begin reverse traversing the UList.
reverse_iterator	rend ()
	Return reverse_iterator to end reverse traversing the UList.
const_reverse_iterator	crbegin () const
	Return const_reverse_iterator to begin reverse traversing the UList.
const_reverse_iterator	crend () const
	Return const_reverse_iterator to end reverse traversing the UList.
const_reverse_iterator	rbegin () const
	Return const_reverse_iterator to begin reverse traversing the UList.
const_reverse_iterator	rend () const
	Return const_reverse_iterator to end reverse traversing the UList.
bool	empty () const noexcept
	True if List is empty (ie, size() is zero).
label	size () const noexcept
	The number of elements in the container.
label	capacity () const noexcept
	Size of the underlying storage.
void	swap (UList< T > &list) noexcept
	Swap content with another UList of the same type in constant time.
bool	operator== (const UList< T > &list) const
	Equality operation on ULists of the same type.
bool	operator!= (const UList< T > &list) const
	The opposite of the equality operation. Takes linear time.
bool	operator< (const UList< T > &list) const
	Compare two ULists lexicographically. Takes linear time.
bool	operator> (const UList< T > &list) const
	Compare two ULists lexicographically. Takes linear time.
bool	operator<= (const UList< T > &list) const
	Return true if !(a > b). Takes linear time.
bool	operator>= (const UList< T > &list) const
	Return true if !(a < b). Takes linear time.
Istream &	readList (Istream &is)
	Read List contents from Istream.
void	writeEntry (const word &keyword, Ostream &os) const
	Write the List as a dictionary entry with keyword.
Ostream &	writeList (Ostream &os, const label shortLen=0) const
	Write List, with line-breaks in ASCII when length exceeds shortLen.
template<class TypeT = T, class = std::enable_if_t<stdFoam::is_bool_v<TypeT>>>
bool	all () const
	True if all entries are 'true' or if the list is empty.
template<class TypeT = T, class = std::enable_if_t<stdFoam::is_bool_v<TypeT>>>
bool	any () const
	True if any entries are 'true'.
template<class TypeT = T, class = std::enable_if_t<stdFoam::is_bool_v<TypeT>>>
bool	none () const
	True if no entries are 'true'.
template<class TypeT = T, class = std::enable_if_t<stdFoam::is_bool_v<TypeT>>>
bool	test (const label i) const
	Test `bool` value at specified position, always false for out-of-range access.
template<class TypeT = T, class = std::enable_if_t<stdFoam::is_bool_v<TypeT>>>
bool	get (const label i) const
	Return `bool` value at specified position, always false for out-of-range access.
template<class TypeT = T, class = std::enable_if_t<stdFoam::is_bool_v<TypeT>>>
bool	unset (const label i)
	Unset the `bool` entry at specified position, always false for out-of-range access.
template<class TypeT = T, class = std::enable_if_t<stdFoam::is_char_v<TypeT>>>
std::string_view	view () const
	Return a string_view of the charList. Content is non-modifiable.
T &	first ()
	Access first element of the list, position [0].
const T &	first () const
	Access first element of the list.
T &	last ()
	Access last element of the list, position [size()-1].
const T &	last () const
	Access last element of the list, position [size()-1].
bool	found (const T &val, label pos=0) const
	Same as contains().
auto	expr () const
	Wrap value as expression.
template<typename E>
void	operator= (const Expression::ListExpression< E > &expr)
	Assign values from expression.

Static Public Member Functions
static constexpr label	min_size () noexcept
	Normal lower capacity limit - the SizeMin template parameter.
Static Public Member Functions inherited from Field< T >
static const Field< T > &	null () noexcept
	Return a null Field (reference to a nullObject). Behaves like an empty Field.
static autoPtr< Field< T > >	New (Istream &is)
	Return a pointer to a new Field created on freestore.
static tmp< Field< T > >	NewCalculatedType (const Field< Type2 > &f)
	Return a pointer to a new calculatedFvPatchFieldField created on freestore without setting patchField values.
Static Public Member Functions inherited from FieldBase
static void	warnLocalBoundaryConsistencyCompat (const dictionary &)
	Warn about keyword changes for local boundary consistency checks.
static int	localBoundaryConsistency () noexcept
	Get flag for local boundary consistency checks.
static int	localBoundaryConsistency (int val) noexcept
	Set flag for local boundary consistency checks.
Static Public Member Functions inherited from List< T >
static const List< T > &	null () noexcept
	Return a null List (reference to a nullObject). Behaves like an empty List.
Static Public Member Functions inherited from UList< T >
static const UList< T > &	null () noexcept
	Return a null UList (reference to a nullObject). Behaves like an empty UList.
static constexpr label	max_size () noexcept
	The size of the largest possible UList.

Friends
Istream &	operator>> (Istream &is, DynamicField< T, SizeMin > &rhs)
	Use the readList() method to read contents from Istream.
Ostream &	operator (Ostream &os, const DynamicField< T, SizeMin > &rhs)
	Write to Ostream.

Additional Inherited Members
Public Types inherited from Field< T >
typedef pTraits< T >::cmptType	cmptType
	Component type.
typedef SubField< T >	subField
	Declare type of subField.
Public Types inherited from List< T >
typedef SubList< T >	subList
	Declare type of subList.
Public Types inherited from UList< T >
typedef T	value_type
	The value type the list contains.
typedef T *	pointer
	The pointer type for non-const access to value_type items.
typedef const T *	const_pointer
	The pointer type for const access to value_type items.
typedef T &	reference
	The type used for storing into value_type objects.
typedef const T &	const_reference
	The type used for reading from constant value_type objects.
typedef T *	iterator
	Random access iterator for traversing a UList.
typedef const T *	const_iterator
	Random access iterator for traversing a UList.
typedef label	size_type
	The type to represent the size of a UList.
typedef label	difference_type
	The difference between iterator objects.
typedef std::reverse_iterator< iterator >	reverse_iterator
	Reverse iterator (non-const access).
typedef std::reverse_iterator< const_iterator >	const_reverse_iterator
	Reverse iterator (const access).
using	is_List = void
	Have unique tag.
Static Public Attributes inherited from FieldBase
static const char *const	typeName
	Typename for Field.
static bool	allowConstructFromLargerSize = false
	Permit read construct from a larger size.
static bool	unifiedGeometricField
	GeometricField with extra capacity for flattened boundary fields. Uses opt-switch "unifiedGeometricField".
static int	localBoundaryConsistency_
	Local boundary field consistency checks. Uses opt-switch "localBoundaryConsistency".
static scalar	localBoundaryTolerance_
	Tolerance for local boundary field consistency checks. Uses opt-switch "localBoundaryConsistency::tolerance".
Protected Member Functions inherited from UList< T >
void	setAddressableSize (const label n) noexcept
	Set addressed size to be inconsistent with allocated storage.
void	size (const label n)
	Older name for setAddressableSize.
void	writeEntry (Ostream &os) const
	Write the UList with its compound type.
labelRange	validateRange (const labelRange &requestedRange) const
	Return a validated (start,size) subset range, which means that it always addresses a valid section of the list.
void	fill_uniform (const T &val)
	Assign all entries to the given value.
void	fill_uniform (Foam::zero)
	Assign all entries to zero.

Detailed Description

template<class T, int SizeMin = 64>
class Foam::DynamicField< T, SizeMin >

Dynamically sized Field. Similar to DynamicList, but inheriting from a Field instead of a List.

Source files

Definition at line 59 of file DynamicField.H.

Constructor & Destructor Documentation

◆ DynamicField() [1/20]

template<class T, int SizeMin>

DynamicField ( )

inlineconstexprnoexcept

Default construct, an empty field without allocation.

Definition at line 122 of file DynamicFieldI.H.

References Field< T >::Field(), Foam::noexcept, and Field< T >::T().

Referenced by DynamicField(), DynamicField(), DynamicField(), DynamicField(), operator=(), operator=(), operator=(), swap(), and transfer().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ DynamicField() [2/20]

template<class T, int SizeMin>

DynamicField ( const label initialCapacity )

inlineexplicit

Construct empty field with given initial capacity.

Definition at line 130 of file DynamicFieldI.H.

References Field< T >::Field(), reserve_nocopy(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [3/20]

template<class T, int SizeMin>

DynamicField ( std::pair< label, label > sizing )

inlineexplicit

Construct with given size and capacity.

Definition at line 140 of file DynamicFieldI.H.

References Field< T >::Field(), UList< T >::first(), Foam::max(), UList< T >::setAddressableSize(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [4/20]

template<class T, int SizeMin>

DynamicField	(	const label	len,
		const T &	val )

inline

Construct given size and initial value.

Definition at line 153 of file DynamicFieldI.H.

References Field< T >::Field(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [5/20]

template<class T, int SizeMin>

DynamicField	(	const label	len,
		Foam::zero	)

inline

Construct given size and initial value of zero.

Definition at line 165 of file DynamicFieldI.H.

References Field< T >::Field(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [6/20]

template<class T, int SizeMin>

DynamicField ( const DynamicField< T, SizeMin > & list )

inline

Copy construct.

Definition at line 177 of file DynamicFieldI.H.

References DynamicField(), Field< T >::Field(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [7/20]

template<class T, int SizeMin>

template<int AnySizeMin>

DynamicField ( const DynamicField< T, AnySizeMin > & list )

inline

Copy construct with different sizing parameters.

Definition at line 189 of file DynamicFieldI.H.

References DynamicField(), Field< T >::Field(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [8/20]

template<class T, int SizeMin>

DynamicField ( const UList< T > & list )

inlineexplicit

Copy construct from UList. Size set to UList size.

Also constructs from DynamicField with different sizing parameters.

Definition at line 200 of file DynamicFieldI.H.

References Field< T >::Field(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [9/20]

template<class T, int SizeMin>

template<class Addr>

DynamicField ( const IndirectListBase< T, Addr > & list )

inlineexplicit

Copy construct from IndirectList.

Definition at line 212 of file DynamicFieldI.H.

References Field< T >::Field(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [10/20]

template<class T, int SizeMin>

DynamicField ( List< T > && content )

inlineexplicitnoexcept

Move construct from List contents.

Definition at line 223 of file DynamicFieldI.H.

◆ DynamicField() [11/20]

template<class T, int SizeMin>

DynamicField ( DynamicField< T, SizeMin > && content )

inlinenoexcept

Move construct from dynamic Field contents.

Definition at line 248 of file DynamicFieldI.H.

References DynamicField(), and Foam::noexcept.

Here is the call graph for this function:

◆ DynamicField() [12/20]

template<class T, int SizeMin>

template<int AnySizeMin>

DynamicField ( DynamicField< T, AnySizeMin > && content )

inlinenoexcept

Move construct with different sizing parameters.

Definition at line 262 of file DynamicFieldI.H.

◆ DynamicField() [13/20]

template<class T, int SizeMin>

template<int AnySizeMin>

DynamicField ( DynamicList< T, AnySizeMin > && content )

inlinenoexcept

Move construct from DynamicList.

Definition at line 235 of file DynamicFieldI.H.

References Field< T >::Field(), and Foam::noexcept.

Here is the call graph for this function:

◆ DynamicField() [14/20]

template<class T, int SizeMin>

template<int AnySizeMin>

DynamicField	(	DynamicField< T, AnySizeMin > &	content,
		bool	reuse )

inline

Copy or move construct from DynamicField.

Definition at line 276 of file DynamicFieldI.H.

References DynamicField(), Field< T >::Field(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [15/20]

template<class T, int SizeMin>

template<int AnySizeMin>

DynamicField	(	DynamicList< T, AnySizeMin > &	content,
		bool	reuse )

inline

Copy or move construct from DynamicList.

Definition at line 301 of file DynamicFieldI.H.

◆ DynamicField() [16/20]

template<class T, int SizeMin>

DynamicField	(	List< T > &	content,
		bool	reuse )

inline

Copy or move construct from List.

Definition at line 325 of file DynamicFieldI.H.

◆ DynamicField() [17/20]

template<class T, int SizeMin>

DynamicField	(	const UList< T > &	mapF,
		const labelUList &	mapAddressing )

inline

Construct by 1 to 1 mapping from the given field.

Definition at line 347 of file DynamicFieldI.H.

◆ DynamicField() [18/20]

template<class T, int SizeMin>

DynamicField	(	const UList< T > &	mapF,
		const labelListList &	mapAddressing,
		const scalarListList &	weights )

inline

Construct by interpolative mapping from the given field.

Definition at line 359 of file DynamicFieldI.H.

◆ DynamicField() [19/20]

template<class T, int SizeMin>

DynamicField	(	const UList< T > &	mapF,
		const FieldMapper &	map )

inline

Construct by mapping from the given field.

Definition at line 372 of file DynamicFieldI.H.

References Field< T >::Field(), Field< T >::map(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ DynamicField() [20/20]

template<class T, int SizeMin>

DynamicField ( Istream & is )

inlineexplicit

Construct from Istream. Size set to size of list read.

Definition at line 384 of file DynamicFieldI.H.

References Field< T >::Field(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ ~DynamicField()

template<class T, int SizeMin = 64>

~DynamicField ( )

inline

Destructor, sync allocated size before list destruction.

Definition at line 230 of file DynamicField.H.

Member Function Documentation

◆ clone()

template<class T, int SizeMin>

Foam::tmp< Foam::DynamicField< T, SizeMin > > clone ( ) const

inline

Clone.

Definition at line 393 of file DynamicFieldI.H.

References Foam::New().

Here is the call graph for this function:

◆ min_size()

template<class T, int SizeMin = 64>

constexpr label min_size ( )

inlinestaticconstexprnoexcept

Normal lower capacity limit - the SizeMin template parameter.

Definition at line 240 of file DynamicField.H.

◆ capacity()

template<class T, int SizeMin = 64>

label capacity ( ) const

inlinenoexcept

Size of the underlying storage.

Definition at line 245 of file DynamicField.H.

Referenced by searchableSurfaces::checkIntersection(), extendedEdgeMesh::cut(), and transfer().

Here is the caller graph for this function:

◆ capacity_bytes()

template<class T, int SizeMin>

std::streamsize capacity_bytes ( ) const

inlinenoexcept

Number of contiguous bytes of the underlying storage.

Note: Only meaningful for contiguous data

Definition at line 403 of file DynamicFieldI.H.

References Foam::noexcept, and Field< T >::T().

Here is the call graph for this function:

◆ setCapacity()

template<class T, int SizeMin>

void setCapacity ( const label len )

inline

Alter the size of the underlying storage.

The addressed size will be truncated if needed to fit, but will remain otherwise untouched. Use this or reserve() in combination with push_back().

Definition at line 410 of file DynamicFieldI.H.

References UList< T >::size().

Referenced by extendedEdgeMesh::cut().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ setCapacity_nocopy()

template<class T, int SizeMin>

void setCapacity_nocopy ( const label len )

inline

Alter the size of the underlying storage, without retaining old content.

The addressed size will be truncated if needed to fit, but will remain otherwise untouched.

Definition at line 421 of file DynamicFieldI.H.

◆ setCapacity_unsafe()

template<class T, int SizeMin = 64>

void setCapacity_unsafe ( label len )

inlinenoexcept

Change the value for the list capacity directly (ADVANCED, UNSAFE) Does not perform any memory management or resizing.

Definition at line 279 of file DynamicField.H.

Referenced by swap(), and transfer().

Here is the caller graph for this function:

◆ reserve()

template<class T, int SizeMin>

void reserve ( const label len )

inline

Reserve allocation space for at least this size, allocating new space if required and retaining old content.

Never shrinks the allocated size, use setCapacity() for that.

Definition at line 432 of file DynamicFieldI.H.

◆ reserve_nocopy()

template<class T, int SizeMin>

void reserve_nocopy ( const label len )

inline

Reserve allocation space for at least this size, allocating new space if required without retaining old content.

Never shrinks the allocated size, use setCapacity() for that.

Definition at line 443 of file DynamicFieldI.H.

Referenced by DynamicField().

Here is the caller graph for this function:

◆ reserve_exact()

template<class T, int SizeMin>

void reserve_exact ( const label len )

inline

Reserve allocation space for at least this size, allocating new space if required and retaining old content. If allocation is required, uses the specified size without any other resizing logic.

Definition at line 454 of file DynamicFieldI.H.

References List< T >::resize_copy(), UList< T >::setAddressableSize(), and UList< T >::size().

Referenced by DimensionedField< Type, GeoMesh >::DimensionedField(), and DimensionedField< Type, GeoMesh >::DimensionedField().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ resize() [1/2]

template<class T, int SizeMin>

void resize ( const label len )

inline

Alter addressable list size, allocating new space if required while recovering old content.

If no reallocation is required, the contents remain untouched. Otherwise new entries will be uninitialized. Use this to resize the list prior to using the operator[] for setting values (as per List usage).

Definition at line 482 of file DynamicFieldI.H.

References resize_copy(), and UList< T >::size().

Referenced by Foam::fvc::interpolate(), Foam::fvc::interpolate(), DynamicField< Type >::setSize(), DynamicField< Type >::setSize(), Foam::fvc::surfaceOp(), Foam::fvc::surfaceSnSum(), Foam::fvc::surfaceSnSum(), Foam::fvc::surfaceSnSum(), Foam::fvc::surfaceSnSum(), Foam::fvc::surfaceSnSum(), Foam::fvc::surfaceSum(), Foam::fvc::surfaceSum(), and Foam::fvc::surfaceSum().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ resize() [2/2]

template<class T, int SizeMin>

void resize	(	const label	len,
		const T &	val )

inline

Alter addressable size and fill new entries with constant value.

Definition at line 529 of file DynamicFieldI.H.

References UList< T >::begin(), UList< T >::end(), resize(), UList< T >::size(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ resize_copy()

template<class T, int SizeMin>

void resize_copy	(	label	count,
		const label	len )

inline

Alter addressable size, retaining the first count contents.

Note: Only uses a limited number of internal checks.

Definition at line 493 of file DynamicFieldI.H.

Referenced by resize(), and resize_nocopy().

Here is the caller graph for this function:

◆ resize_fill()

template<class T, int SizeMin>

void resize_fill	(	const label	len,
		const T &	val )

inline

Alter addressable size and set val for all addressed entries.

Definition at line 506 of file DynamicFieldI.H.

References UList< T >::operator=(), resize_nocopy(), and Field< T >::T().

Here is the call graph for this function:

◆ resize_nocopy()

template<class T, int SizeMin>

void resize_nocopy ( const label len )

inline

Alter addressable list size, allocating new space if required without necessarily recovering old content.

If no reallocation is required, the contents remain untouched. Otherwise all entries will be uninitialized.

Definition at line 518 of file DynamicFieldI.H.

References resize_copy().

Referenced by resize_fill().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ clear()

template<class T, int SizeMin>

void clear ( )

inlinenoexcept

Clear the addressed list, i.e. set the size to zero.

Allocated size does not change

Definition at line 552 of file DynamicFieldI.H.

References Foam::noexcept, and UList< T >::setAddressableSize().

Referenced by zoneDistribute::getFields(), zoneDistribute::getPositionFields(), and searchableSurfacesQueries::signedDistance().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ clearStorage()

template<class T, int SizeMin>

void clearStorage ( )

inline

Clear the list and delete storage.

Definition at line 559 of file DynamicFieldI.H.

References UList< T >::cdata(), List< T >::clear(), UList< T >::empty(), and UList< T >::setAddressableSize().

Referenced by transfer(), and transfer().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ shrink_to_fit()

template<class T, int SizeMin>

void shrink_to_fit ( )

inline

Shrink the allocated space to the number of elements used.

Definition at line 572 of file DynamicFieldI.H.

References List< T >::resize(), UList< T >::setAddressableSize(), and UList< T >::size().

Referenced by DynamicField< Type >::shrink(), and swap().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ swap() [1/3]

template<class T, int SizeMin>

void swap ( List< T > & other )

inline

Swap with plain List content. Implies shrink_to_fit().

Definition at line 586 of file DynamicFieldI.H.

References FOAM_UNLIKELY, shrink_to_fit(), UList< T >::size(), and UList< T >::swap().

Referenced by readList(), triSurfaceTools::writeCloseness(), triSurfaceTools::writeCurvature(), and Foam::edgeMeshTools::writeFeatureProximity().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ swap() [2/3]

template<class T, int SizeMin>

template<int AnySizeMin>

void swap ( DynamicField< T, AnySizeMin > & other )

inlinenoexcept

Swap content, independent of sizing parameter.

Definition at line 613 of file DynamicFieldI.H.

References DynamicField(), FOAM_UNLIKELY, and UList< T >::swap().

Here is the call graph for this function:

◆ swap() [3/3]

template<class T, int SizeMin>

template<int AnySizeMin>

void swap ( DynamicList< T, AnySizeMin > & other )

inlinenoexcept

Swap content with DynamicList, independent of sizing parameter.

Definition at line 640 of file DynamicFieldI.H.

References FOAM_UNLIKELY, setCapacity_unsafe(), and UList< T >::swap().

Here is the call graph for this function:

◆ transfer() [1/3]

template<class T, int SizeMin>

void transfer ( List< T > & list )

inline

Transfer the parameter contents into this.

Definition at line 668 of file DynamicFieldI.H.

References UList< T >::setAddressableSize(), UList< Type >::size(), and List< Type >::transfer().

Referenced by wallDistData< TransferType >::correct(), operator=(), operator=(), operator=(), and operator=().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ transfer() [2/3]

template<class T, int SizeMin>

template<int AnySizeMin>

void transfer ( DynamicList< T, AnySizeMin > & list )

inline

Transfer the parameter contents into this.

Definition at line 681 of file DynamicFieldI.H.

References DynamicList< T, SizeMin >::capacity(), clearStorage(), FOAM_UNLIKELY, DynamicList< T, SizeMin >::setCapacity_unsafe(), and UList< T >::swap().

Here is the call graph for this function:

◆ transfer() [3/3]

template<class T, int SizeMin>

template<int AnySizeMin>

void transfer ( DynamicField< T, AnySizeMin > & list )

inline

Transfer the parameter contents into this.

Definition at line 712 of file DynamicFieldI.H.

References capacity(), clearStorage(), DynamicField(), FOAM_UNLIKELY, setCapacity_unsafe(), and UList< T >::swap().

Here is the call graph for this function:

◆ emplace_back()

template<class T, int SizeMin>

template<class... Args>

T & emplace_back ( Args &&... args )

inline

Construct an element at the end of the list, return reference to the new list element.

Definition at line 743 of file DynamicFieldI.H.

References args, UList< T >::operator[](), resize(), UList< T >::size(), Field< T >::T(), and T.

Here is the call graph for this function:

◆ push_back() [1/4]

template<class T, int SizeMin>

void push_back ( const T & val )

inline

Copy append an element to the end of the list.

Definition at line 759 of file DynamicFieldI.H.

References UList< T >::operator[](), resize(), UList< T >::size(), and Field< T >::T().

Referenced by DynamicField< Type >::append(), DynamicField< Type >::append(), and DynamicField< Type >::append().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ push_back() [2/4]

template<class T, int SizeMin>

void push_back ( T && val )

inline

Move append an element.

Definition at line 772 of file DynamicFieldI.H.

References UList< T >::operator[](), resize(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ push_back() [3/4]

template<class T, int SizeMin>

void push_back ( const UList< T > & list )

inline

Copy append another list to the end of this list.

Definition at line 785 of file DynamicFieldI.H.

References Foam::abort(), UList< T >::begin(), UList< T >::end(), Foam::FatalError, FatalErrorInFunction, FOAM_UNLIKELY, resize(), UList< T >::size(), and UList< T >::size().

Here is the call graph for this function:

◆ push_back() [4/4]

template<class T, int SizeMin>

void push_back ( List< T > && list )

inline

Move append another list to the end of this list.

Definition at line 812 of file DynamicFieldI.H.

References Foam::abort(), Foam::FatalError, FatalErrorInFunction, FOAM_UNLIKELY, resize(), and UList< T >::size().

Here is the call graph for this function:

◆ pop_back()

template<class T, int SizeMin>

void pop_back ( label n = 1 )

inline

Reduce size by 1 or more elements. Can be called on an empty list.

Definition at line 842 of file DynamicFieldI.H.

References clear(), n, resize(), and UList< T >::size().

Here is the call graph for this function:

◆ readList()

template<class T, int SizeMin>

Foam::Istream & readList ( Istream & is )

inline

Read from Istream, discarding existing contents.

Uses a DynamicList::readList internally

Definition at line 980 of file DynamicFieldI.H.

References DynamicList< T, SizeMin >::readList(), and swap().

Here is the call graph for this function:

◆ operator=() [1/9]

template<class T, int SizeMin>

void operator= ( const T & val )

inline

Assign addressed entries to the given value.

Definition at line 873 of file DynamicFieldI.H.

References operator, UList< T >::operator=(), and Field< T >::T().

Referenced by DimensionedField< Type, GeoMesh >::operator=(), DimensionedField< Type, GeoMesh >::operator=(), and DimensionedField< Type, GeoMesh >::operator=().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ operator=() [2/9]

template<class T, int SizeMin>

void operator= ( Foam::zero )

inline

Assign addressed entries to zero.

Definition at line 883 of file DynamicFieldI.H.

References operator, and UList< T >::operator=().

Here is the call graph for this function:

◆ operator=() [3/9]

template<class T, int SizeMin>

void operator= ( const UList< T > & list )

inline

Copy assignment.

Definition at line 893 of file DynamicFieldI.H.

References operator.

Here is the call graph for this function:

◆ operator=() [4/9]

template<class T, int SizeMin>

void operator= ( const DynamicField< T, SizeMin > & list )

inline

Copy assignment.

Definition at line 903 of file DynamicFieldI.H.

References DynamicField(), and operator.

Here is the call graph for this function:

◆ operator=() [5/9]

template<class T, int SizeMin>

template<class Addr>

void operator= ( const IndirectListBase< T, Addr > & rhs )

inline

Copy assign from IndirectList.

if ( static_cast<const UList<T>*>(this) == static_cast<const UList<T>*>(&list.values()) )

Definition at line 919 of file DynamicFieldI.H.

References operator.

Here is the call graph for this function:

◆ operator=() [6/9]

template<class T, int SizeMin>

void operator= ( List< T > && list )

inline

Move assignment.

Definition at line 936 of file DynamicFieldI.H.

References operator, and transfer().

Here is the call graph for this function:

◆ operator=() [7/9]

template<class T, int SizeMin>

template<int AnySizeMin>

void operator= ( DynamicList< T, AnySizeMin > && list )

inline

Move assignment.

Definition at line 968 of file DynamicFieldI.H.

References operator, and transfer().

Here is the call graph for this function:

◆ operator=() [8/9]

template<class T, int SizeMin>

void operator= ( DynamicField< T, SizeMin > && list )

inline

Move assignment.

Definition at line 946 of file DynamicFieldI.H.

References DynamicField(), operator, and transfer().

Here is the call graph for this function:

◆ operator=() [9/9]

template<class T, int SizeMin>

template<int AnySizeMin>

void operator= ( DynamicField< T, AnySizeMin > && list )

inline

Move assignment.

Definition at line 957 of file DynamicFieldI.H.

References DynamicField(), operator, and transfer().

Here is the call graph for this function:

◆ operator()()

template<class T, int SizeMin>

T & operator() ( const label i )

inline

Return non-const access to an element, resizing list if needed.

Definition at line 858 of file DynamicFieldI.H.

References UList< T >::operator[](), resize(), UList< T >::size(), and Field< T >::T().

Here is the call graph for this function:

◆ setSize() [1/2]

template<class T, int SizeMin = 64>

void setSize ( const label n )

inline

Alias for resize().

Definition at line 524 of file DynamicField.H.

◆ setSize() [2/2]

template<class T, int SizeMin = 64>

void setSize	(	const label	n,
		const T &	val )

inline

Alias for resize().

Definition at line 529 of file DynamicField.H.

◆ shrink()

template<class T, int SizeMin = 64>

DynamicField< T, SizeMin > & shrink ( )

inline

Calls shrink_to_fit() and returns a reference to the DynamicField.

FOAM_DEPRECATED_FOR(2025-04, "shrink_to_fit()")

Definition at line 536 of file DynamicField.H.

◆ append() [1/3]

template<class T, int SizeMin = 64>

void append ( const T & val )

inline

Append an element at the end of the list.

FOAM_DEPRECATED_FOR(2022-10, "push_back()")

Definition at line 547 of file DynamicField.H.

Referenced by extendedEdgeMesh::add(), searchableSurfaces::checkIntersection(), extendedEdgeMesh::cut(), zoneDistribute::getFields(), zoneDistribute::getPositionFields(), distributedTriSurfaceMesh::getVolumeType(), and searchableSurfacesQueries::signedDistance().

Here is the caller graph for this function:

◆ append() [2/3]

template<class T, int SizeMin = 64>

void append ( T && val )

inline

Move append an element.

FOAM_DEPRECATED_FOR(2022-10, "push_back()")

Definition at line 554 of file DynamicField.H.

◆ append() [3/3]

template<class T, int SizeMin = 64>

void append ( const UList< T > & list )

inline

Append a List at the end of this list.

FOAM_DEPRECATED_FOR(2022-10, "push_back()")

Definition at line 561 of file DynamicField.H.

◆ operator>>

template<class T, int SizeMin = 64>

Istream & operator>>	(	Istream &	is,
		DynamicField< T, SizeMin > &	rhs )

friend

Use the readList() method to read contents from Istream.

◆ operator

template<class T, int SizeMin = 64>

Ostream & operator	(	Ostream &	os,
		const DynamicField< T, SizeMin > &	rhs )

friend

Write to Ostream.

Referenced by operator=(), operator=(), operator=(), operator=(), operator=(), operator=(), operator=(), operator=(), and operator=().

The documentation for this class was generated from the following files:

src/OpenFOAM/fields/Fields/DynamicField/DynamicField.H
src/OpenFOAM/fields/Fields/DynamicField/DynamicFieldI.H

Public Member Functions

Static Public Member Functions

Friends

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ DynamicField() [1/20]

◆ DynamicField() [2/20]

◆ DynamicField() [3/20]

◆ DynamicField() [4/20]

◆ DynamicField() [5/20]

◆ DynamicField() [6/20]

◆ DynamicField() [7/20]

◆ DynamicField() [8/20]

◆ DynamicField() [9/20]

◆ DynamicField() [10/20]

◆ DynamicField() [11/20]

◆ DynamicField() [12/20]

◆ DynamicField() [13/20]

◆ DynamicField() [14/20]

◆ DynamicField() [15/20]

◆ DynamicField() [16/20]

◆ DynamicField() [17/20]

◆ DynamicField() [18/20]

◆ DynamicField() [19/20]

◆ DynamicField() [20/20]

◆ ~DynamicField()

Member Function Documentation

◆ clone()

◆ min_size()

◆ capacity()

◆ capacity_bytes()

◆ setCapacity()

◆ setCapacity_nocopy()

◆ setCapacity_unsafe()

◆ reserve()

◆ reserve_nocopy()

◆ reserve_exact()

◆ resize() [1/2]

◆ resize() [2/2]

◆ resize_copy()

◆ resize_fill()

◆ resize_nocopy()

◆ clear()

◆ clearStorage()

◆ shrink_to_fit()

◆ swap() [1/3]

◆ swap() [2/3]

◆ swap() [3/3]

◆ transfer() [1/3]

◆ transfer() [2/3]

◆ transfer() [3/3]

◆ emplace_back()

◆ push_back() [1/4]

◆ push_back() [2/4]

◆ push_back() [3/4]

◆ push_back() [4/4]

◆ pop_back()

◆ readList()

◆ operator=() [1/9]

◆ operator=() [2/9]

◆ operator=() [3/9]

◆ operator=() [4/9]

◆ operator=() [5/9]

◆ operator=() [6/9]

◆ operator=() [7/9]

◆ operator=() [8/9]

◆ operator=() [9/9]

◆ operator()()

◆ setSize() [1/2]

◆ setSize() [2/2]

◆ shrink()

◆ append() [1/3]

◆ append() [2/3]

◆ append() [3/3]

Friends And Related Symbol Documentation

◆ operator>>

◆ operator