#include <Ifpack_HashTable.h>
Public Member Functions | |
| Ifpack_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. | |
| Ifpack_HashTable::Ifpack_HashTable | ( | const int | n_keys = 1031, |
|
| const int | n_sets = 1 | |||
| ) | [inline] |
constructor.
| void Ifpack_HashTable::arrayify | ( | int * | key_array, | |
| double * | val_array | |||
| ) | [inline] |
Converts the contents in array format for both keys and values.
| double Ifpack_HashTable::get | ( | const int | key | ) | [inline] |
Returns an element from the hash table, or 0.0 if not found.
| int Ifpack_HashTable::getNumEntries | ( | ) | const [inline] |
Returns the number of stored entries.
| void Ifpack_HashTable::print | ( | ) | [inline] |
Basic printing routine.
| void Ifpack_HashTable::reset | ( | ) | [inline] |
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.
| void Ifpack_HashTable::set | ( | const int | key, | |
| const double | value, | |||
| const bool | addToValue = false | |||
| ) | [inline] |
Sets an element in the hash table.
1.5.9