|
| | regionProperties ()=default |
| | Default construct.
|
| | regionProperties (const regionProperties &)=default |
| | Copy construct.
|
| | regionProperties (regionProperties &&)=default |
| | Move construct.
|
| regionProperties & | operator= (const regionProperties &)=default |
| | Copy assignment.
|
| regionProperties & | operator= (regionProperties &&)=default |
| | Move assignment.
|
| | regionProperties (const Time &runTime, IOobjectOption::readOption rOpt=IOobjectOption::MUST_READ) |
| | Construct from Time with specified read option (default: MUST_READ).
|
| | regionProperties (const Time &runTime, const fileName &local, IOobjectOption::readOption rOpt=IOobjectOption::MUST_READ) |
| | Construct from Time and local (prefix) with specified read option (default: MUST_READ).
|
| | ~regionProperties ()=default |
| | Destructor.
|
| label | count () const |
| | Total count of all region names.
|
| auto | types () const |
| | The names of the region types (sorted).
|
| wordList | names () const |
| | The region names (sorted by region type).
|
| wordList | sortedNames () const |
| | The region names in sorted order.
|
| wordList | names (const wordRes &matcher) const |
| | The region names (sorted by region type) for all matches.
|
| Foam::List< word > | sortedToc (const Compare &comp) const |
| Foam::List< word > | tocKeys (const UnaryPredicate &pred, const bool invert) const |
| Foam::List< word > | tocValues (const UnaryPredicate &pred, const bool invert) const |
| Foam::List< word > | tocEntries (const BinaryPredicate &pred, const bool invert) const |
| Foam::label | countKeys (const UnaryPredicate &pred, const bool invert) const |
| Foam::label | countValues (const UnaryPredicate &pred, const bool invert) const |
| Foam::label | countEntries (const BinaryPredicate &pred, const bool invert) const |
| Foam::label | erase (InputIter first, InputIter last) |
| Foam::label | erase (const FixedList< word, N > &keys) |
| Foam::label | erase (const HashTable< AnyType, word, AnyHash > &other) |
| Foam::label | retain (const HashTable< AnyType, word, AnyHash > &other) |
| Foam::label | filterKeys (const UnaryPredicate &pred, const bool pruning) |
| Foam::label | filterValues (const UnaryPredicate &pred, const bool pruning) |
| Foam::label | filterEntries (const BinaryPredicate &pred, const bool pruning) |
| constexpr | HashTable () noexcept |
| | Default construct: empty without allocation (capacity=0).
|
| | ~HashTable () |
| | Destructor.
|
| bool | empty () const noexcept |
| | True if the hash table is empty.
|
| label | size () const noexcept |
| | The number of elements in table.
|
| label | capacity () const noexcept |
| | The size of the underlying table (the number of buckets).
|
| wordList & | at (const word &key) |
| | Find and return a hashed entry. FatalError if it does not exist.
|
| bool | contains (const word &key) const |
| | True if hashed key is contained (found) in table.
|
| iterator | find (const word &key) |
| | Find and return an iterator set at the hashed entry.
|
| const_iterator | cfind (const word &key) const |
| | Find and return an const_iterator set at the hashed entry.
|
| const wordList & | lookup (const word &key, const wordList &deflt) const |
| | Return hashed entry if it exists, or return the given default.
|
| List< word > | toc () const |
| | The table of contents (the keys) in unsorted order.
|
| UPtrList< const node_type > | csorted () const |
| | Const access to the hash-table contents in sorted order (sorted by keys).
|
| UPtrList< node_type > | sorted () |
| | Non-const access to the hash-table contents in sorted order (sorted by keys).
|
| bool | emplace (const word &key, Args &&... args) |
| | Emplace insert a new entry, not overwriting existing entries.
|
| bool | emplace_set (const word &key, Args &&... args) |
| | Emplace set an entry, overwriting any existing entries.
|
| bool | insert (const word &key, const wordList &obj) |
| | Copy insert a new entry, not overwriting existing entries.
|
| bool | set (const word &key, const wordList &obj) |
| | Copy assign a new entry, overwriting existing entries.
|
| void | clear () |
| | Remove all entries from table.
|
| void | clearStorage () |
| | Remove all entries from table and the table itself.
|
| void | setCapacity (label newCapacity) |
| | Change the hash table capacity (number of buckets).
|
| void | resize (label newCapacity) |
| | Rehash the hash table with new number of buckets. Currently identical to setCapacity().
|
| void | reserve (label numEntries) |
| | Reserve space for at least the specified number of elements (not the number of buckets) and regenerates the hash table.
|
| void | swap (HashTable< wordList, word, Foam::Hash< word > > &rhs) noexcept |
| | Swap contents into this table.
|
| void | transfer (HashTable< wordList, word, Foam::Hash< word > > &rhs) |
| | Transfer contents into this table.
|
| void | merge (HashTable< wordList, word, Foam::Hash< word > > &source) |
| | Attempts to extract entries from source parameter and insert them into this, does not overwrite existing entries. The source will contains any items that could not be merged.
|
| wordList & | operator[] (const word &key) |
| | Find and return a hashed entry. FatalError if it does not exist.
|
| wordList & | operator() (const word &key) |
| | Return existing entry or create a new entry.
|
| void | operator= (const this_type &rhs) |
| | Copy assign.
|
| bool | operator== (const this_type &rhs) const |
| | Equality. Tables are equal if all keys and values are equal, independent of order or underlying storage size.
|
| bool | operator!= (const this_type &rhs) const |
| | The opposite of the equality operation.
|
| this_type & | operator+= (const this_type &rhs) |
| | Add entries into this HashTable.
|
| const_iterator_pair< const_key_iterator, this_type > | keys () const |
| | A const iterator begin/end pair for iterating over keys.
|
| iterator | begin () |
| | iterator set to the beginning of the HashTable
|
| const_iterator | cbegin () const |
| | const_iterator set to the beginning of the HashTable
|
| iterator | end () noexcept |
| | iterator to signal the end (for any HashTable)
|
| constexpr const_iterator | cend () const noexcept |
| | const_iterator to signal the end (for any HashTable)
|
| Ostream & | printInfo (Ostream &os) const |
| | Print information.
|
| Ostream & | writeKeys (Ostream &os, const label shortLen=0) const |
| | Write unordered keys (list), with line-breaks when length exceeds shortLen.
|
| bool | found (const word &key) const |
| | Same as contains().
|
| | ClassName ("HashTable") |
| | Declare type-name (with debug switch).
|
| constexpr | HashTableCore () noexcept=default |
| | Default construct.
|
Simple class to hold region information for coupled region simulations.
Gives per physics ('fluid', 'solid') the names of the regions. There is no assumption on this level that a region should only have a single set of physics.
Uses the "regions" table from the constant/regionProperties file. For example,
regions
(
fluid (air water)
solid (walls)
);
- Source files
-
Definition at line 95 of file regionProperties.H.
1.16.1 
