Go to the source code of this file.
|
| module | iihash_oct_m |
| | This module implements a simple hash table for non-negative integer keys and integer values.
|
| |
|
| subroutine, public | iihash_oct_m::iihash_init (h) |
| | Initialize a hash table h. More...
|
| |
| subroutine, public | iihash_oct_m::iihash_end (h) |
| | Free a hash table. More...
|
| |
| subroutine, public | iihash_oct_m::iihash_insert (h, key, val) |
| | Insert a (key, val) pair into the hash table h. More...
|
| |
| integer function, public | iihash_oct_m::iihash_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, public | iihash_oct_m::lihash_init (h) |
| | Initialize a hash table h. More...
|
| |
| subroutine, public | iihash_oct_m::lihash_end (h) |
| | Free a hash table. More...
|
| |
| subroutine, public | iihash_oct_m::lihash_insert (h, key, val) |
| | Insert a (key, val) pair into the hash table h. More...
|
| |
| integer function, public | iihash_oct_m::lihash_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 lihash_lookup is meaningless (and essentially undefined). More...
|
| |