Go to the source code of this file.
|
module | qs_fb_hash_table_types |
| A simple hash table of integer keys, using hash function: H(k) = (k*p) mod n + 1 where: k = key p = a prime number >= n n = size of the hash table And collision resolvation is done by open addressing with linear probing.
|
|
|
recursive subroutine, public | qs_fb_hash_table_types::fb_hash_table_add (hash_table, key, val) |
| Add element to a hash table, auto resize if necessary.
|
|
subroutine, public | qs_fb_hash_table_types::fb_hash_table_create (hash_table, nmax) |
| Creates and initialises an empty fb_hash_table object.
|
|
subroutine, public | qs_fb_hash_table_types::fb_hash_table_get (hash_table, key, val, found) |
| Retrieve value from a key from a hash table.
|
|
pure logical function, public | qs_fb_hash_table_types::fb_hash_table_has_data (hash_table) |
| check if the object has data associated to it
|
|
pure subroutine, public | qs_fb_hash_table_types::fb_hash_table_nullify (hash_table) |
| Nullifies a fb_hash_table object.
|
|
subroutine, public | qs_fb_hash_table_types::fb_hash_table_release (hash_table) |
| releases given object
|
|