|
| fieldTable () |
|
void | add (const VolField< Type > &f) |
|
bool | set (const word &, const const VolField< Type > * &newElmt) |
| Set a new hashedEntry, overwriting existing entries. More...
|
|
void | set (const HashTable< const VolField< Type > *, word, string::hash > &) |
| Insert all the entries from the given HashTable,. More...
|
|
| HashTable (const label size=128) |
| Construct given initial table size. More...
|
|
| HashTable (Istream &, const label size=128) |
| Construct from Istream. More...
|
|
| HashTable (const UList< word > &keyList, const UList< const VolField< Type > * > &elmtList) |
| Construct from a list of keys and list of elements. More...
|
|
| HashTable (const HashTable< const VolField< Type > *, word, string::hash > &) |
| Copy constructor. More...
|
|
| HashTable (HashTable< const VolField< Type > *, word, string::hash > &&) |
| Move constructor. More...
|
|
| HashTable (std::initializer_list< Tuple2< word, const VolField< Type > * >>) |
| Construct from an initialiser list. More...
|
|
| ~HashTable () |
| Destructor. More...
|
|
label | capacity () const |
| The size of the underlying table. More...
|
|
label | size () const |
| Return number of elements in table. More...
|
|
bool | empty () const |
| Return true if the hash table is empty. More...
|
|
bool | found (const word &) const |
| Return true if hashedEntry is found in table. More...
|
|
iterator | find (const word &) |
| Find and return an iterator set at the hashedEntry. More...
|
|
const_iterator | find (const word &) const |
| Find and return an const_iterator set at the hashedEntry. More...
|
|
List< word > | toc () const |
| Return the table of contents. More...
|
|
List< word > | sortedToc () const |
| Return the table of contents as a sorted list. More...
|
|
List< const_iterator > | sorted () const |
| Return a sorted list of constant iterators. More...
|
|
Ostream & | printInfo (Ostream &) const |
| Print information. More...
|
|
bool | insert (const word &, const const VolField< Type > * &newElmt) |
| Insert a new hashedEntry. More...
|
|
void | insert (const HashTable< const VolField< Type > *, word, string::hash > &) |
| Insert all the entries from the given HashTable. More...
|
|
bool | erase (const iterator &) |
| Erase a hashedEntry specified by given iterator. More...
|
|
bool | erase (const word &) |
| Erase a hashedEntry specified by the given key. More...
|
|
label | erase (const UList< word > &) |
| Remove entries given by the listed keys from this HashTable. More...
|
|
label | erase (const HashTable< AnyType, word, AnyHash > &) |
| Remove entries given by the given keys from this HashTable. More...
|
|
Foam::label | erase (const HashTable< AnyType, word, AnyHash > &rhs) |
|
void | resize (const label newSize) |
| Resize the hash table for efficiency. More...
|
|
void | clear () |
| Clear all entries from table. More...
|
|
void | clearStorage () |
| Clear the table entries and the table itself. More...
|
|
void | shrink () |
| Shrink the allocated table to approx. twice number of elements. More...
|
|
void | transfer (HashTable< const VolField< Type > *, word, string::hash > &) |
| Transfer the contents of the argument table into this table. More...
|
|
const VolField< Type > * & | operator[] (const word &) |
| Find and return a hashedEntry. More...
|
|
const const VolField< Type > * & | operator[] (const word &) const |
| Find and return a hashedEntry. More...
|
|
const VolField< Type > * & | operator() (const word &) |
| Find and return a hashedEntry, create it null if not present. More...
|
|
void | operator= (const HashTable< const VolField< Type > *, word, string::hash > &) |
| Assignment operator. More...
|
|
void | operator= (HashTable< const VolField< Type > *, word, string::hash > &&) |
| Move assignment operator. More...
|
|
void | operator= (std::initializer_list< Tuple2< word, const VolField< Type > * >>) |
| Assignment to an initialiser list. More...
|
|
bool | operator== (const HashTable< const VolField< Type > *, word, string::hash > &) const |
| Equality. Hash tables are equal if the keys and values are equal. More...
|
|
bool | operator!= (const HashTable< const VolField< Type > *, word, string::hash > &) const |
| The opposite of the equality operation. Takes linear time. More...
|
|
iterator | begin () |
| Iterator set to the beginning of the HashTable. More...
|
|
const_iterator | begin () const |
| const_iterator set to the beginning of the HashTable More...
|
|
const_iterator | cbegin () const |
| const_iterator set to the beginning of the HashTable More...
|
|
| HashTableCore () |
| Construct null. More...
|
|
| ClassName ("HashTable") |
| Define template name and debug. More...
|
|
template<class Type>
class Foam::multivariateSurfaceInterpolationScheme< Type >::fieldTable
fieldTable
Definition at line 58 of file multivariateSurfaceInterpolationScheme.H.