|
| Ifpack_HashTable64 (const int n_keys=1031, const int n_sets=1) |
|
| TIfpack_HashTable (const int n_keys=1031, const int n_sets=1) |
| constructor.
|
|
double | get (const long long key) |
| Returns an element from the hash table, or 0.0 if not found.
|
|
void | set (const long long 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 (long long *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) |
|
Definition at line 267 of file Ifpack_HashTable.h.
◆ Ifpack_HashTable64()
Ifpack_HashTable64::Ifpack_HashTable64 |
( |
const int |
n_keys = 1031 , |
|
|
const int |
n_sets = 1 |
|
) |
| |
|
inline |
The documentation for this class was generated from the following file: