Ifpack Package Browser (Single Doxygen Collection)
Development
|
#include <Ifpack_HashTable.h>
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. More... | |
double | get (const intkey) |
Returns an element from the hash table, or 0.0 if not found. More... | |
void | set (const intkey, const double value, const bool addToValue=false) |
Sets an element in the hash table. More... | |
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. More... | |
int | getNumEntries () const |
Returns the number of stored entries. More... | |
void | arrayify (int *key_array, double *val_array) |
Converts the contents in array format for both keys and values. More... | |
void | print () |
Basic printing routine. More... | |
int | getRecommendedHashSize (int n) |
Definition at line 258 of file Ifpack_HashTable.h.
|
inline |
Definition at line 261 of file Ifpack_HashTable.h.