Go to the source code of this file.
|
module | sihash_oct_m |
| This module implements a simple hash table for string valued keys and integer values using the C++ STL unordered_map container.
|
|
|
subroutine, public | sihash_oct_m::sihash_init (h) |
| Initialize a hash table h with size entries. Since we use separate chaining, the number of entries in the hash table is, in principle, unlimited. We take the smallest prime number as table size that is greater or equal than the requested size to reduce collisions. More...
|
|
subroutine, public | sihash_oct_m::sihash_end (h) |
| Free a hash table. More...
|
|
subroutine, public | sihash_oct_m::sihash_insert (h, key, val) |
| Insert a (key, val) pair into the hash table h. More...
|
|
integer function, public | sihash_oct_m::sihash_lookup (h, key, found) |
| Look up a value in the hash table h. If found is present, it indicates if key could be found in the table. If found = .false., the return value of iihash_lookup is meaningless (and essentially undefined). More...
|
|
subroutine | sihash_oct_m::sihash_iterator_start (this, h) |
|
logical function | sihash_oct_m::sihash_iterator_has_next (this) |
|
integer function | sihash_oct_m::sihash_iterator_get_next (this) |
|