#include <Ifpack_HashTable.h>
|
| TIfpack_HashTable (const int n_keys=1031, const int n_sets=1) |
| constructor. More...
|
|
double | get (const key_type key) |
| Returns an element from the hash table, or 0.0 if not found. More...
|
|
void | set (const key_type key, 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 (key_type *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) |
|
template<typename key_type>
class TIfpack_HashTable< key_type >
Definition at line 89 of file Ifpack_HashTable.h.
template<typename key_type>
template<typename key_type>
Returns an element from the hash table, or 0.0 if not found.
Definition at line 116 of file Ifpack_HashTable.h.
template<typename key_type>
template<typename key_type>
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.
Definition at line 174 of file Ifpack_HashTable.h.
template<typename key_type>
template<typename key_type>
void TIfpack_HashTable< key_type >::arrayify |
( |
key_type * |
key_array, |
|
|
double * |
val_array |
|
) |
| |
|
inline |
Converts the contents in array format for both keys and values.
Definition at line 189 of file Ifpack_HashTable.h.
template<typename key_type>
template<typename key_type>
template<typename key_type>
template<typename key_type>
template<typename key_type>
template<typename key_type>
template<typename key_type>
template<typename key_type>
template<typename key_type>
The documentation for this class was generated from the following file: