Go to the documentation of this file.
31 #ifndef ccmSolutionTable_H
32 #define ccmSolutionTable_H
49 Ostream&
operator<<(Ostream&
os,
const fieldEntry& entry);
50 Ostream&
operator<<(Ostream&
os,
const fieldTable& entry);
51 Ostream&
operator<<(Ostream&
os,
const solutionEntry& entry);
121 matched[matchi++] =
name;
163 const word& shortName,
165 const char*
units =
nullptr
228 if (maxCellId_ < newMax)
238 if (maxFaceId_ < newMax)
254 <<
" [" <<
entry.units_.c_str()
255 <<
"] maxCell: " <<
entry.maxCellId_
256 <<
" maxFace: " <<
entry.maxFaceId_;
329 <<
" iter: " <<
entry.iter_
330 <<
" time: " <<
entry.time_;
374 const label currMax = iter().maxCellId();
392 const label currMax = iter().maxFaceId();
412 os << static_cast<const namesList<fieldEntry>&>(tbl)
414 <<
"maxCell: " << tbl.maxCellId()
415 <<
" maxFace: " << tbl.maxFaceId();
A keyword and a list of tokens is an 'entry'.
iterator find(const word &key)
Find a list element has a name matching key.
label maxFaceId() const
The max face id for the field.
A class for handling words, derived from Foam::string.
const word & name() const
The solution name.
void resize(const label len)
Adjust allocated size of list.
A ccm field entry with short name, name, maxId and type.
label maxCellId() const
The max cell id for the field.
A ccm solution entry with name, iteration and time.
auto key(const Type &t) -> typename std::enable_if< std::is_enum< Type >::value, typename std::underlying_type< Type >::type >::type
A linked-list that is searchable by the 'name()' of the items.
typename SLList< solutionEntry >::const_iterator const_iterator
label iteration() const
The solution iteration/timestep.
const word & name() const
The field name (PROSTAR short name)
An STL-conforming iterator.
typename SLList< solutionEntry >::iterator iterator
A list of the available fields.
Ostream & operator<<(Ostream &os, const interfaceEntry &entry)
bool match(const std::string &text, bool literal=false) const
Smart match as literal or regex, stopping on the first match.
const iterator & end()
End of list for forward iterators.
Template class for non-intrusive linked lists.
const string & fullName() const
The full field name.
bool found(const word &key) const
Return true if a list element has a name that matches key.
const string & units() const
The field units.
void units(const std::string &units)
Set the field units.
label maxCellId() const
The maximum cell Id referenced in the list.
fieldEntry(const word &shortName, const string &fullName, const char *units=nullptr)
Construct from components with optional units.
namesList()=default
Default construct.
fieldTable()
Null construct.
scalar timeValue() const
The solution time (sec)
#define forAllIters(container, iter)
Iterate across all elements in the container object.
solutionEntry(const word &name, const label iteration, const scalar timeValue=0)
Construct from components.
OBJstream os(runTime.globalPath()/outputName)
namesList< solutionEntry > solutionTable
forAllConstIters(mixture.phases(), phase)
Non-intrusive singly-linked list.
List< word > findNames(const wordRes &allow, const wordRes &deny=wordRes()) const
Return a list of names in allow-list and not in deny-list.
A List of wordRe with additional matching capabilities.
label maxFaceId() const
The maximum face Id referenced in the list.
word name(const expressions::valueTypeCode typeCode)
A word representation of a valueTypeCode. Empty for INVALID.
void maxFaceId(const int newMax)
Set the max face Id for the field.
void maxCellId(const int newMax)
Set the max cell Id for the field.
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
An STL-conforming const_iterator.