Definition at line 59 of file multivariateSurfaceInterpolationScheme.H.
Public Member Functions | |
fieldTable () | |
void | add (const GeometricField< Type, fvPatchField, volMesh > &f) |
![]() | |
bool | set (const word &, const const GeometricField< Type, fvPatchField, volMesh > *&newElmt) |
Assign a new hashedEntry, overwriting existing entries. | |
HashTable (const label size=128) | |
Construct given initial table size. | |
HashTable (Istream &, const label size=128) | |
Construct from Istream. | |
HashTable (const HashTable< const GeometricField< Type, fvPatchField, volMesh > *, word, string::hash > &) | |
Construct as copy. | |
HashTable (const Xfer< HashTable< const GeometricField< Type, fvPatchField, volMesh > *, word, string::hash > > &) | |
Construct by transferring the parameter contents. | |
~HashTable () | |
label | size () const |
Return number of elements in table. | |
bool | empty () const |
Return true if the hash table is empty. | |
bool | found (const word &) const |
Return true if hashedEntry is found in table. | |
iterator | find (const word &) |
Find and return an iterator set at the hashedEntry. | |
const_iterator | find (const word &) const |
Find and return an const_iterator set at the hashedEntry. | |
List< word > | toc () const |
Return the table of contents. | |
List< word > | sortedToc () const |
Return the table of contents as a sorted list. | |
Ostream & | printInfo (Ostream &) const |
Print information. | |
bool | insert (const word &, const const GeometricField< Type, fvPatchField, volMesh > *&newElmt) |
Insert a new hashedEntry. | |
bool | erase (const iterator &) |
Erase an hashedEntry specified by given iterator. | |
bool | erase (const word &) |
Erase an hashedEntry specified by given key if in table. | |
label | erase (const UList< word > &) |
Remove entries given by the listed keys from this HashTable. | |
label | erase (const HashTable< AnyType, word, AnyHash > &) |
Remove entries given by the given keys from this HashTable. | |
void | resize (const label newSize) |
Resize the hash table for efficiency. | |
void | clear () |
Clear all entries from table. | |
void | clearStorage () |
Clear the table entries and the table itself. | |
void | transfer (HashTable< const GeometricField< Type, fvPatchField, volMesh > *, word, string::hash > &) |
Transfer the contents of the argument table into this table. | |
Xfer< HashTable< const GeometricField< Type, fvPatchField, volMesh > *, word, string::hash > > | xfer () |
Transfer contents to the Xfer container. | |
const GeometricField< Type, fvPatchField, volMesh > *& | operator[] (const word &) |
Find and return an hashedEntry. | |
const const GeometricField < Type, fvPatchField, volMesh > *& | operator[] (const word &) const |
Find and return an hashedEntry. | |
const GeometricField< Type, fvPatchField, volMesh > *& | operator() (const word &) |
Find and return an hashedEntry, create it null if not present. | |
void | operator= (const HashTable< const GeometricField< Type, fvPatchField, volMesh > *, word, string::hash > &) |
Assignment. | |
bool | operator== (const HashTable< const GeometricField< Type, fvPatchField, volMesh > *, word, string::hash > &) const |
Equality. Two hash tables are equal if all contents of first are. | |
bool | operator!= (const HashTable< const GeometricField< Type, fvPatchField, volMesh > *, word, string::hash > &) const |
The opposite of the equality operation. Takes linear time. | |
iterator | begin () |
iterator set to the begining of the HashTable | |
const_iterator | begin () const |
const_iterator set to the beginning of the HashTable | |
const iterator & | end () |
iterator set to beyond the end of the HashTable | |
const const_iterator & | end () const |
const_iterator set to beyond the end of the HashTable | |
const_iterator | cbegin () const |
const_iterator set to the beginning of the HashTable | |
const const_iterator & | cend () const |
const_iterator set to beyond the end of the HashTable |
Additional Inherited Members | |
![]() | |
typedef const GeometricField < Type, fvPatchField, volMesh > * | value_type |
Type of values the HashTable contains. | |
typedef const GeometricField < Type, fvPatchField, volMesh > *& | reference |
Type that can be used for storing into HashTable::value_type. | |
typedef const const GeometricField< Type, fvPatchField, volMesh > *& | const_reference |
Type that can be used for storing into constant. | |
typedef label | size_type |
The type that can represent the size of a HashTable. |
|
inline |
Definition at line 65 of file multivariateSurfaceInterpolationScheme.H.
|
inline |
Definition at line 68 of file multivariateSurfaceInterpolationScheme.H.
References f(), HashTable< const GeometricField< Type, fvPatchField, volMesh > * >::insert(), and IOobject::name().