Inheritance diagram for Ifpack_HashTable:
Collaboration diagram for Ifpack_HashTable:
Public Member Functions | |
| Ifpack_HashTable (const int n_keys=1031, const int n_sets=1) | |
 Public Member Functions inherited from TIfpack_HashTable< int > | |
| TIfpack_HashTable (const int n_keys=1031, const int n_sets=1) | |
| constructor. | |
| double | get (const int key) |
| Returns an element from the hash table, or 0.0 if not found. | |
| void | set (const int key, const double value, const bool addToValue=false) |
| Sets an element in the hash table. | |
| void | reset () |
| Resets the entries of the already allocated memory. This method can be used to clean an array, to be reused without additional memory allocation/deallocation. | |
| int | getNumEntries () const |
| Returns the number of stored entries. | |
| void | arrayify (int *key_array, double *val_array) |
| Converts the contents in array format for both keys and values. | |
| void | print () |
| Basic printing routine. | |
| int | getRecommendedHashSize (int n) |
Detailed Description
Definition at line 264 of file Ifpack_HashTable.h.
Constructor & Destructor Documentation
◆ Ifpack_HashTable()
|
inline |
Definition at line 267 of file Ifpack_HashTable.h.
The documentation for this class was generated from the following file:
