![]() |
Nilorea Library
C utilities for networking, threading, graphics
|
Data Structures | |
| union | HASH_DATA |
| union of the possibles data values of a node More... | |
| struct | HASH_NODE |
| structure of a hash table node More... | |
| struct | HASH_TABLE |
| structure of a hash table More... | |
Macros | |
| #define | HASH_CLASSIC 128 |
| Murmur hash using hash key string, hash key numeric value, index table with lists of elements. | |
| #define | HASH_DOUBLE 2 |
| value of double type inside the hash node | |
| #define | HASH_INT 1 |
| compatibility with existing rot func | |
| #define | HASH_INT_TYPE int64_t |
| type of a HASH_INT in 64 bits | |
| #define | HASH_PTR 8 |
| value of pointer type inside the hash node | |
| #define | HASH_STRING 4 |
| value of char * type inside the hash node | |
| #define | HASH_TRIE 256 |
| TRIE tree using hash key string. | |
| #define | HASH_UNKNOWN 16 |
| value of unknow type inside the hash node | |
| #define | HASH_VAL(node, type) |
| Cast a HASH_NODE element. | |
| #define | hash_val(node, type) |
| Cast a HASH_NODE element. | |
| #define | HT_FOREACH(__ITEM_, __HASH_, ...) |
| ForEach macro helper. | |
| #define | ht_foreach(__ITEM_, __HASH_) |
| ForEach macro helper (classic / old). | |
| #define | HT_FOREACH_R(__ITEM_, __HASH_, __ITERATOR, ...) |
| ForEach macro helper. | |
| #define | ht_foreach_r(__ITEM_, __HASH_, __ITERATOR_) |
| ForEach macro helper, reentrant (classic / old). | |
| #define | MurmurHash(__key, __len, __seed, __out) |
| Murmur hash macro helper 64 bits. | |
Typedefs | |
| typedef size_t | HASH_VALUE |
| type of a HASH_VALUE | |
Functions | |
| int | destroy_ht (HASH_TABLE **table) |
| destroy a hash table and free all resources | |
| int | empty_ht (HASH_TABLE *table) |
| empty a hash table, freeing all nodes | |
| HASH_TABLE * | ht_duplicate (HASH_TABLE *table) |
| duplicate a hash table | |
| LIST * | ht_get_completion_list (HASH_TABLE *table, const char *keybud, size_t max_results) |
| get a list of key completions matching the given prefix | |
| int | ht_get_double (HASH_TABLE *table, const char *key, double *val) |
| get a double value from the hash table by key | |
| int | ht_get_int (HASH_TABLE *table, const char *key, int64_t *val) |
| get an integer value from the hash table by key | |
| HASH_NODE * | ht_get_node (HASH_TABLE *table, const char *key) |
| get the HASH_NODE associated with the given key | |
| HASH_NODE * | ht_get_node_ex (HASH_TABLE *table, HASH_VALUE hash_value) |
| get a HASH_NODE by numeric hash value | |
| size_t | ht_get_optimal_size (HASH_TABLE *table) |
| compute the optimal size for the hash table | |
| int | ht_get_ptr (HASH_TABLE *table, const char *key, void **val) |
| get a pointer value from the hash table by key | |
| int | ht_get_ptr_ex (HASH_TABLE *table, HASH_VALUE hash_value, void **val) |
| get a pointer value by numeric hash value | |
| int | ht_get_string (HASH_TABLE *table, const char *key, char **val) |
| get a string value from the hash table by key | |
| int | ht_get_table_collision_percentage (HASH_TABLE *table) |
| get the collision percentage of the hash table | |
| char * | ht_node_type (const HASH_NODE *node) |
| return the type of a hash node as a string | |
| int | ht_optimize (HASH_TABLE **table) |
| optimize a hash table by resizing to the optimal size | |
| void | ht_print (HASH_TABLE *table) |
| print the contents of a hash table | |
| int | ht_put_double (HASH_TABLE *table, const char *key, double value) |
| put a double value into the hash table | |
| int | ht_put_int (HASH_TABLE *table, const char *key, int64_t value) |
| put an integer value into the hash table | |
| int | ht_put_ptr (HASH_TABLE *table, const char *key, void *ptr, void(*destructor)(void *ptr), void *(*duplicator)(void *ptr)) |
| put a pointer value into the hash table with destructor and duplicator | |
| int | ht_put_ptr_ex (HASH_TABLE *table, HASH_VALUE hash_value, void *val, void(*destructor)(void *ptr), void *(*duplicator)(void *ptr)) |
| put a pointer value by numeric hash value | |
| int | ht_put_string (HASH_TABLE *table, const char *key, char *string) |
| put a string value (duplicated) into the hash table | |
| int | ht_put_string_ptr (HASH_TABLE *table, const char *key, char *string) |
| put a string pointer into the hash table without copying | |
| int | ht_remove (HASH_TABLE *table, const char *key) |
| remove a node from the hash table by key | |
| int | ht_remove_ex (HASH_TABLE *table, HASH_VALUE hash_value) |
| remove a node by numeric hash value | |
| int | ht_resize (HASH_TABLE **table, size_t size) |
| resize a hash table to the given size | |
| LIST * | ht_search (HASH_TABLE *table, int(*node_is_matching)(HASH_NODE *node)) |
| search the hash table for nodes matching a predicate | |
| int | is_prime (size_t nb) |
| check if a number is prime | |
| void | MurmurHash3_x64_128 (const void *key, const size_t len, const uint64_t seed, void *out) |
| compute a 128-bit MurmurHash3 hash for x64 | |
| void | MurmurHash3_x86_128 (const void *key, const size_t len, const uint32_t seed, void *out) |
| compute a 128-bit MurmurHash3 hash for x86 | |
| void | MurmurHash3_x86_32 (const void *key, const size_t len, const uint32_t seed, void *out) |
| compute a 32-bit MurmurHash3 hash | |
| HASH_TABLE * | new_ht (size_t size) |
| create a new classic hash table of the given size | |
| HASH_TABLE * | new_ht_trie (size_t alphabet_size, size_t alphabet_offset) |
| create a new trie hash table with the given alphabet size and offset | |
| size_t | next_prime (size_t nb) |
| return the next prime number greater than or equal to nb | |
| union HASH_DATA |
| struct HASH_NODE |
| Data Fields | ||
|---|---|---|
| size_t | alphabet_length | HASH_TRIE mode: size of alphabet and so size of children allocated array. |
| struct HASH_NODE ** | children | HASH_TRIE mode: pointers to children. |
| union HASH_DATA | data | data inside the node |
| void(*)(void *ptr) | destroy_func | destroy_func |
| void *(*)(void *ptr) | duplicate_func | duplicator_func |
| HASH_VALUE | hash_value | numeric key of the node if any, else < 0 |
| int | is_leaf | HASH_TRIE mode: does it have a value. |
| char * | key | string key of the node if any, else NULL |
| char | key_id | key id of the node if any |
| int | need_rehash | flag to mark a node for rehash |
| int | type | type of the node |
| struct HASH_TABLE |
structure of a hash table
| Data Fields | ||
|---|---|---|
| size_t | alphabet_length | HASH_TRIE mode: size of the alphabet. |
| size_t | alphabet_offset | HASH_TRIE mode: offset to deduce to individual key digits. |
| int(*)(struct HASH_TABLE **table) | destroy_ht | destroy a hash table |
| int(*)(struct HASH_TABLE *table) | empty_ht |
empty a hash table. char *strings are also freed |
| LIST ** | hash_table | HASH_CLASSIC mode: preallocated hash table. |
| int(*)(struct HASH_TABLE *table, const char *key, double *val) | ht_get_double | get a double from a key's node |
| int(*)(struct HASH_TABLE *table, const char *key, int64_t *val) | ht_get_int | get an int from a key's node |
| HASH_NODE *(*)(struct HASH_TABLE *table, const char *key) | ht_get_node | get HASH_NODE at 'key' from table |
| int(*)(struct HASH_TABLE *table, const char *key, void **val) | ht_get_ptr | get a pointer from a key's node |
| int(*)(struct HASH_TABLE *table, const char *key, char **val) | ht_get_string | get a char *string from a key's node |
| void(*)(struct HASH_TABLE *table) | ht_print | print table |
| int(*)(struct HASH_TABLE *table, const char *key, double val) | ht_put_double | put a double |
| int(*)(struct HASH_TABLE *table, const char *key, int64_t val) | ht_put_int | put an integer |
| int(*)(struct HASH_TABLE *table, const char *key, void *ptr, void(*destructor)(void *ptr), void *(*duplicator)(void *ptr)) | ht_put_ptr | put a a pointer |
| int(*)(struct HASH_TABLE *table, const char *key, char *val) | ht_put_string | put an char *string |
| int(*)(struct HASH_TABLE *table, const char *key, char *val) | ht_put_string_ptr | put an char *string pointer |
| int(*)(struct HASH_TABLE *table, const char *key) | ht_remove | remove given's key node from the table |
| LIST *(*)(struct HASH_TABLE *table, int(*node_is_matching)(HASH_NODE *node)) | ht_search | search elements given an expression |
| unsigned int | mode | hashing mode, murmurhash and classic HASH_MURMUR, or HASH_TRIE |
| size_t | nb_keys | total number of used keys in the table |
| HASH_NODE * | root | HASH_TRIE mode: Start of tree. |
| size_t | seed | table's seed |
| size_t | size | size of the hash table |
| #define HASH_CLASSIC 128 |
Murmur hash using hash key string, hash key numeric value, index table with lists of elements.
Definition at line 80 of file n_hash.h.
Referenced by ht_duplicate(), ht_get_completion_list(), ht_get_node_ex(), ht_get_optimal_size(), ht_get_ptr_ex(), ht_get_table_collision_percentage(), ht_optimize(), ht_put_ptr_ex(), ht_remove_ex(), ht_resize(), and new_ht().
| #define HASH_DOUBLE 2 |
value of double type inside the hash node
Definition at line 72 of file n_hash.h.
Referenced by _ht_get_double(), _ht_get_double_trie(), _ht_new_double_node(), _ht_print_trie_helper(), _ht_put_double(), _ht_put_double_trie(), ht_duplicate(), and ht_node_type().
| #define HASH_INT 1 |
compatibility with existing rot func
compatibility with existing rot func
compatibility with existing func
missing ROTL fix 32bit
missing ROTL fix 64bit
missing ROTL constant
value of integral type inside the hash node
Definition at line 70 of file n_hash.h.
Referenced by _ht_get_int(), _ht_get_int_trie(), _ht_new_int_node(), _ht_print_trie_helper(), _ht_put_int(), _ht_put_int_trie(), ht_duplicate(), and ht_node_type().
| #define HASH_INT_TYPE int64_t |
type of a HASH_INT in 64 bits
Definition at line 93 of file n_hash.h.
Referenced by _ht_get_int(), _ht_get_int_trie(), _ht_new_int_node(), _ht_put_int(), _ht_put_int_trie(), ht_get_int(), ht_put_int(), and main().
| #define HASH_PTR 8 |
value of pointer type inside the hash node
Definition at line 76 of file n_hash.h.
Referenced by _ht_get_ptr(), _ht_get_ptr_trie(), _ht_new_ptr_node(), _ht_node_destroy(), _ht_print_trie_helper(), _ht_put_ptr(), _ht_put_ptr_trie(), ht_duplicate(), ht_get_ptr_ex(), ht_node_type(), and ht_put_ptr_ex().
| #define HASH_STRING 4 |
value of char * type inside the hash node
Definition at line 74 of file n_hash.h.
Referenced by _ht_get_string(), _ht_get_string_trie(), _ht_new_string_node(), _ht_new_string_ptr_node(), _ht_node_destroy(), _ht_print_trie_helper(), _ht_put_string(), _ht_put_string_ptr(), _ht_put_string_ptr_trie(), _ht_put_string_trie(), ht_duplicate(), and ht_node_type().
| #define HASH_TRIE 256 |
TRIE tree using hash key string.
Definition at line 82 of file n_hash.h.
Referenced by ht_get_completion_list(), and new_ht_trie().
| #define HASH_UNKNOWN 16 |
| #define HASH_VAL | ( | node, | |
| type ) |
| #define hash_val | ( | node, | |
| type ) |
Cast a HASH_NODE element.
Definition at line 188 of file n_hash.h.
Referenced by netw_pool_broadcast().
| #define HT_FOREACH | ( | __ITEM_, | |
| __HASH_, | |||
| ... ) |
ForEach macro helper.
Definition at line 216 of file n_hash.h.
Referenced by handle_request(), main(), main(), and refresh_clients_list().
| #define ht_foreach | ( | __ITEM_, | |
| __HASH_ ) |
ForEach macro helper (classic / old).
Definition at line 192 of file n_hash.h.
Referenced by _ht_print(), _ht_search(), ht_duplicate(), ht_get_completion_list(), ht_resize(), and netw_pool_broadcast().
| #define HT_FOREACH_R | ( | __ITEM_, | |
| __HASH_, | |||
| __ITERATOR, | |||
| ... ) |
ForEach macro helper.
Definition at line 262 of file n_hash.h.
Referenced by main().
| #define ht_foreach_r | ( | __ITEM_, | |
| __HASH_, | |||
| __ITERATOR_ ) |
ForEach macro helper, reentrant (classic / old).
| #define MurmurHash | ( | __key, | |
| __len, | |||
| __seed, | |||
| __out ) |
Murmur hash macro helper 64 bits.
Definition at line 91 of file n_hash.h.
Referenced by _ht_hash_value().
| typedef size_t HASH_VALUE |
type of a HASH_VALUE
| int destroy_ht | ( | HASH_TABLE ** | table | ) |
destroy a hash table and free all resources
destroy a hash table and free all resources
| table | targeted hash table |
Definition at line 2349 of file n_hash.c.
References __n_assert.
Referenced by close_nodup_log(), destroy_config_file_section(), handle_request(), ht_duplicate(), main(), main(), n_gui_destroy_ctx(), and netw_destroy_pool().
| int empty_ht | ( | HASH_TABLE * | table | ) |
empty a hash table, freeing all nodes
empty a hash table, freeing all nodes
| table | targeted hash table |
Definition at line 2339 of file n_hash.c.
References __n_assert, and HASH_TABLE::empty_ht.
Referenced by empty_nodup_table(), and main().
| HASH_TABLE * ht_duplicate | ( | HASH_TABLE * | table | ) |
duplicate a hash table
duplicate a hash table
| table | the HASH_TABLE *table to duplicate |
Definition at line 2757 of file n_hash.c.
References __n_assert, HASH_NODE::data, HASH_NODE::destroy_func, destroy_ht(), HASH_NODE::duplicate_func, HASH_DATA::fval, HASH_CLASSIC, HASH_DOUBLE, HASH_INT, HASH_PTR, HASH_STRING, ht_foreach, ht_put_double(), ht_put_int(), ht_put_ptr(), ht_put_string(), HASH_DATA::ival, HASH_NODE::key, LOG_ERR, HASH_TABLE::mode, n_log, new_ht(), HASH_DATA::ptr, HASH_TABLE::size, HASH_DATA::string, and HASH_NODE::type.
Referenced by main().
| LIST * ht_get_completion_list | ( | HASH_TABLE * | table, |
| const char * | keybud, | ||
| size_t | max_results ) |
get a list of key completions matching the given prefix
get a list of key completions matching the given prefix
| table | targeted hash table |
| keybud | starting characters of the keys we want |
| max_results | maximum number of matching keys in list. From UNLIMITED_LIST_ITEMS (0) to MAX_LIST_ITEMS (SIZE_MAX). |
Definition at line 2506 of file n_hash.c.
References __n_assert, _ht_depth_first_search(), _ht_get_node_trie(), HASH_TABLE::alphabet_length, HASH_TABLE::alphabet_offset, HASH_NODE::children, Free, HASH_CLASSIC, HASH_TRIE, ht_foreach, HASH_NODE::key, key, list_destroy(), list_push(), LOG_ERR, max_results, HASH_TABLE::mode, n_log, LIST::nb_items, new_generic_list(), and HASH_TABLE::root.
Referenced by main(), and update_completion().
| int ht_get_double | ( | HASH_TABLE * | table, |
| const char * | key, | ||
| double * | val ) |
get a double value from the hash table by key
get a double value from the hash table by key
| table | targeted table |
| key | key to retrieve |
| val | pointer to double storage |
Definition at line 2189 of file n_hash.c.
References __n_assert, HASH_TABLE::ht_get_double, and key.
Referenced by main().
| int ht_get_int | ( | HASH_TABLE * | table, |
| const char * | key, | ||
| int64_t * | val ) |
get an integer value from the hash table by key
get an integer value from the hash table by key
| table | targeted table |
| key | key to retrieve |
| val | pointer to int storage |
Definition at line 2202 of file n_hash.c.
References __n_assert, HASH_INT_TYPE, HASH_TABLE::ht_get_int, and key.
Referenced by main().
| HASH_NODE * ht_get_node | ( | HASH_TABLE * | table, |
| const char * | key ) |
get the HASH_NODE associated with the given key
get the HASH_NODE associated with the given key
| table | targeted table |
| key | key to retrieve |
Definition at line 2176 of file n_hash.c.
References __n_assert, HASH_TABLE::ht_get_node, and key.
Referenced by _n_nodup_log(), _n_nodup_log_indexed(), check_n_log_dup(), and check_n_log_dup_indexed().
| HASH_NODE * ht_get_node_ex | ( | HASH_TABLE * | table, |
| HASH_VALUE | hash_value ) |
get a HASH_NODE by numeric hash value
get a HASH_NODE by numeric hash value
| table | Targeted hash table |
| hash_value | Associated hash_value |
Definition at line 2360 of file n_hash.c.
References __n_assert, HASH_CLASSIC, HASH_TABLE::hash_table, HASH_NODE::hash_value, list_foreach, HASH_TABLE::mode, HASH_TABLE::size, and LIST::start.
Referenced by ht_get_ptr_ex().
| size_t ht_get_optimal_size | ( | HASH_TABLE * | table | ) |
compute the optimal size for the hash table
compute the optimal size for the hash table
| table | targeted table |
Definition at line 2616 of file n_hash.c.
References __n_assert, HASH_CLASSIC, is_prime(), LOG_ERR, HASH_TABLE::mode, n_log, HASH_TABLE::nb_keys, and next_prime().
Referenced by ht_optimize(), and main().
| int ht_get_ptr | ( | HASH_TABLE * | table, |
| const char * | key, | ||
| void ** | val ) |
get a pointer value from the hash table by key
get a pointer value from the hash table by key
| table | targeted table |
| key | key to retrieve |
| val | pointer to pointer storage |
Definition at line 2215 of file n_hash.c.
References __n_assert, HASH_TABLE::ht_get_ptr, and key.
Referenced by get_config_section_value(), get_nb_config_file_sections_entries(), load_config_file(), main(), main(), n_gui_get_widget(), netw_pool_add(), and update_definitions().
| int ht_get_ptr_ex | ( | HASH_TABLE * | table, |
| HASH_VALUE | hash_value, | ||
| void ** | val ) |
get a pointer value by numeric hash value
get a pointer value by numeric hash value
Leave val untouched if key is not found. (HASH_CLASSIC only)
| table | Targeted hash table |
| hash_value | key pre computed numeric hash value |
| val | A pointer to an empty pointer store |
Definition at line 2385 of file n_hash.c.
References __n_assert, HASH_NODE::data, HASH_CLASSIC, HASH_PTR, ht_get_node_ex(), ht_node_type(), LOG_ERR, HASH_TABLE::mode, n_log, HASH_DATA::ptr, and HASH_NODE::type.
| int ht_get_string | ( | HASH_TABLE * | table, |
| const char * | key, | ||
| char ** | val ) |
get a string value from the hash table by key
get a string value from the hash table by key
| table | targeted table |
| key | key to retrieve |
| val | pointer to string storage |
Definition at line 2228 of file n_hash.c.
References __n_assert, HASH_TABLE::ht_get_string, and key.
Referenced by main(), and n_str_template_expand().
| int ht_get_table_collision_percentage | ( | HASH_TABLE * | table | ) |
get the collision percentage of the hash table
get the collision percentage of the hash table
| table | targeted table |
Definition at line 2592 of file n_hash.c.
References __n_assert, HASH_CLASSIC, HASH_TABLE::hash_table, LOG_ERR, HASH_TABLE::mode, n_log, LIST::nb_items, and HASH_TABLE::size.
Referenced by ht_optimize(), and main().
| char * ht_node_type | ( | const HASH_NODE * | node | ) |
return the type of a hash node as a string
return the type of a hash node as a string
| node | node to check |
Definition at line 1337 of file n_hash.c.
References __n_assert, HASH_DOUBLE, HASH_INT, HASH_PTR, HASH_STRING, and HASH_NODE::type.
Referenced by _ht_get_double(), _ht_get_double_trie(), _ht_get_int(), _ht_get_int_trie(), _ht_get_ptr(), _ht_get_ptr_trie(), _ht_get_string(), _ht_get_string_trie(), _ht_put_double(), _ht_put_int(), _ht_put_ptr(), _ht_put_string(), _ht_put_string_ptr(), ht_get_ptr_ex(), and ht_put_ptr_ex().
| int ht_optimize | ( | HASH_TABLE ** | table | ) |
optimize a hash table by resizing to the optimal size
optimize a hash table by resizing to the optimal size
| table | targeted table |
Definition at line 2723 of file n_hash.c.
References __n_assert, HASH_CLASSIC, ht_get_optimal_size(), ht_get_table_collision_percentage(), ht_resize(), LOG_ERR, and n_log.
Referenced by main().
| void ht_print | ( | HASH_TABLE * | table | ) |
print the contents of a hash table
print the contents of a hash table
| table | targeted hash table |
Definition at line 2317 of file n_hash.c.
References __n_assert, and HASH_TABLE::ht_print.
| int ht_put_double | ( | HASH_TABLE * | table, |
| const char * | key, | ||
| double | value ) |
put a double value into the hash table
put a double value into the hash table
| table | targeted table |
| key | key to retrieve |
| value | double value to put |
Definition at line 2241 of file n_hash.c.
References __n_assert, HASH_TABLE::ht_put_double, and key.
Referenced by ht_duplicate(), and main().
| int ht_put_int | ( | HASH_TABLE * | table, |
| const char * | key, | ||
| int64_t | value ) |
put an integer value into the hash table
put an integer value into the hash table
| table | targeted hash table |
| key | associated value's key |
| value | integral value to put |
Definition at line 2254 of file n_hash.c.
References __n_assert, HASH_INT_TYPE, HASH_TABLE::ht_put_int, and key.
Referenced by ht_duplicate(), and main().
| int ht_put_ptr | ( | HASH_TABLE * | table, |
| const char * | key, | ||
| void * | ptr, | ||
| void(* | destructor )(void *ptr), | ||
| void *(* | duplicator )(void *ptr) ) |
put a pointer value into the hash table with destructor and duplicator
put a pointer value into the hash table with destructor and duplicator
| table | targeted hash table |
| key | key of the entry |
| ptr | pointer value to put |
| destructor | Pointer to the ptr type destructor function. Leave to NULL if there isn't |
| duplicator | Pointer to the ptr type duplicator function. Leave to NULL if there isn't |
Definition at line 2269 of file n_hash.c.
References __n_assert, HASH_TABLE::ht_put_ptr, and key.
Referenced by _register_widget(), ht_duplicate(), load_config_file(), main(), main(), and netw_pool_add().
| int ht_put_ptr_ex | ( | HASH_TABLE * | table, |
| HASH_VALUE | hash_value, | ||
| void * | val, | ||
| void(* | destructor )(void *ptr), | ||
| void *(* | duplicator )(void *ptr) ) |
put a pointer value by numeric hash value
put a pointer value by numeric hash value
| table | targeted hash table |
| hash_value | precomputed hash value for the key |
| val | pointer value to put |
| destructor | Pointer to the ptr type destructor function. Leave to NULL if there isn't |
| duplicator | Pointer to the ptr type duplicator function. Leave to NULL if there isn't |
Definition at line 2412 of file n_hash.c.
References __n_assert, _ht_node_destroy(), HASH_NODE::data, HASH_NODE::destroy_func, HASH_NODE::duplicate_func, HASH_CLASSIC, HASH_PTR, HASH_TABLE::hash_table, HASH_NODE::hash_value, ht_node_type(), HASH_NODE::key, list_foreach, list_push(), LOG_ERR, Malloc, HASH_TABLE::mode, n_log, HASH_TABLE::nb_keys, HASH_DATA::ptr, HASH_TABLE::size, and HASH_NODE::type.
| int ht_put_string | ( | HASH_TABLE * | table, |
| const char * | key, | ||
| char * | string ) |
put a string value (duplicated) into the hash table
put a string value (duplicated) into the hash table
| table | targeted hash table |
| key | associated value's key |
| string | string value to put (copy) |
Definition at line 2282 of file n_hash.c.
References __n_assert, HASH_TABLE::ht_put_string, and key.
Referenced by _n_nodup_log(), _n_nodup_log_indexed(), ht_duplicate(), main(), and netw_parse_post_data().
| int ht_put_string_ptr | ( | HASH_TABLE * | table, |
| const char * | key, | ||
| char * | string ) |
put a string pointer into the hash table without copying
put a string pointer into the hash table without copying
| table | targeted hash table |
| key | associated value's key |
| string | string value to put (pointer) |
Definition at line 2295 of file n_hash.c.
References __n_assert, HASH_TABLE::ht_put_string_ptr, and key.
| int ht_remove | ( | HASH_TABLE * | table, |
| const char * | key ) |
remove a node from the hash table by key
remove a node from the hash table by key
| table | targeted hash table |
| key | key of node to destroy |
Definition at line 2307 of file n_hash.c.
References __n_assert, HASH_TABLE::ht_remove, and key.
Referenced by main(), and netw_pool_remove().
| int ht_remove_ex | ( | HASH_TABLE * | table, |
| HASH_VALUE | hash_value ) |
remove a node by numeric hash value
remove a node by numeric hash value
| table | Targeted hash table |
| hash_value | key pre computed numeric hash value |
Definition at line 2465 of file n_hash.c.
References __n_assert, _ht_node_destroy(), HASH_CLASSIC, HASH_TABLE::hash_table, HASH_NODE::hash_value, list_foreach, LOG_ERR, HASH_TABLE::mode, n_log, HASH_TABLE::nb_keys, remove_list_node, HASH_TABLE::size, and LIST::start.
| int ht_resize | ( | HASH_TABLE ** | table, |
| size_t | size ) |
resize a hash table to the given size
resize a hash table to the given size
| table | targeted table |
| size | new hash table size |
Definition at line 2635 of file n_hash.c.
References __n_assert, HASH_CLASSIC, HASH_NODE::hash_value, ht_foreach, list_destroy(), list_node_push(), list_node_shift(), LOG_ERR, MAX_LIST_ITEMS, n_log, HASH_NODE::need_rehash, new_generic_list(), LIST_NODE::next, LIST_NODE::prev, and Realloc.
Referenced by ht_optimize(), and main().
| LIST * ht_search | ( | HASH_TABLE * | table, |
| int(* | node_is_matching )(HASH_NODE *node) ) |
search the hash table for nodes matching a predicate
search the hash table for nodes matching a predicate
| table | targeted hash table |
| node_is_matching | matching function |
Definition at line 2329 of file n_hash.c.
References __n_assert, and HASH_TABLE::ht_search.
Referenced by main().
| int is_prime | ( | size_t | nb | ) |
check if a number is prime
check if a number is prime
| nb | number to test |
Definition at line 2553 of file n_hash.c.
Referenced by ht_get_optimal_size(), and next_prime().
| void MurmurHash3_x64_128 | ( | const void * | key, |
| const size_t | len, | ||
| const uint64_t | seed, | ||
| void * | out ) |
compute a 128-bit MurmurHash3 hash for x64
compute a 128-bit MurmurHash3 hash for x64
The author hereby disclaims copyright to this source code. Note - The x86 and x64 versions do not produce the same results, as the algorithms are optimized for their respective platforms. You can still compile and run any of them on any platform, but your performance with the non-native version will be less than optimal.
| key | char *string as the key |
| len | size of the key |
| seed | seed value for murmur hash |
| out | generated hash |
Definition at line 1215 of file n_hash.c.
References FALL_THROUGH, fmix64(), getblock64(), key, and ROTL64.
Referenced by n_disk_cache_path().
| void MurmurHash3_x86_128 | ( | const void * | key, |
| const size_t | len, | ||
| const uint32_t | seed, | ||
| void * | out ) |
compute a 128-bit MurmurHash3 hash for x86
compute a 128-bit MurmurHash3 hash for x86
The author hereby disclaims copyright to this source code. Note - The x86 and x64 versions do not produce the same results, as the algorithms are optimized for their respective platforms. You can still compile and run any of them on any platform, but your performance with the non-native version will be less than optimal.
| key | char *string as the key |
| len | size of the key |
| seed | seed value for murmur hash |
| out | generated hash |
Definition at line 1047 of file n_hash.c.
References FALL_THROUGH, fmix32(), getblock32(), key, and ROTL32.
| void MurmurHash3_x86_32 | ( | const void * | key, |
| const size_t | len, | ||
| const uint32_t | seed, | ||
| void * | out ) |
compute a 32-bit MurmurHash3 hash
compute a 32-bit MurmurHash3 hash
The author hereby disclaims copyright to this source code. Note - The x86 and x64 versions do not produce the same results, as the algorithms are optimized for their respective platforms. You can still compile and run any of them on any platform, but your performance with the non-native version will be less than optimal.
| key | char *string as the key |
| len | size of the key |
| seed | seed value for murmur hash |
| out | generated hash |
Definition at line 989 of file n_hash.c.
References FALL_THROUGH, fmix32(), getblock32(), key, and ROTL32.
| HASH_TABLE * new_ht | ( | size_t | size | ) |
create a new classic hash table of the given size
create a new classic hash table of the given size
| size | Size of the root hash node table |
Definition at line 2116 of file n_hash.c.
References __n_assert, _destroy_ht(), _empty_ht(), _ht_get_double(), _ht_get_int(), _ht_get_node(), _ht_get_ptr(), _ht_get_string(), _ht_new_seed(), _ht_print(), _ht_put_double(), _ht_put_int(), _ht_put_ptr(), _ht_put_string(), _ht_put_string_ptr(), _ht_remove(), _ht_search(), HASH_TABLE::destroy_ht, HASH_TABLE::empty_ht, Free, HASH_CLASSIC, HASH_TABLE::hash_table, HASH_TABLE::ht_get_double, HASH_TABLE::ht_get_int, HASH_TABLE::ht_get_node, HASH_TABLE::ht_get_ptr, HASH_TABLE::ht_get_string, HASH_TABLE::ht_print, HASH_TABLE::ht_put_double, HASH_TABLE::ht_put_int, HASH_TABLE::ht_put_ptr, HASH_TABLE::ht_put_string, HASH_TABLE::ht_put_string_ptr, HASH_TABLE::ht_remove, HASH_TABLE::ht_search, list_destroy(), LOG_ERR, Malloc, MAX_LIST_ITEMS, HASH_TABLE::mode, n_log, HASH_TABLE::nb_keys, new_generic_list(), HASH_TABLE::seed, and HASH_TABLE::size.
Referenced by ht_duplicate(), init_nodup_log(), load_config_file(), main(), n_gui_new_ctx(), netw_new_pool(), and netw_parse_post_data().
| HASH_TABLE * new_ht_trie | ( | size_t | alphabet_length, |
| size_t | alphabet_offset ) |
create a new trie hash table with the given alphabet size and offset
create a new trie hash table with the given alphabet size and offset
| alphabet_length | of the alphabet |
| alphabet_offset | offset of each character in a key (i.e: to have 'a->z' with 'a' starting at zero, offset must be 32. |
Definition at line 2013 of file n_hash.c.
References __n_assert, _destroy_ht_trie(), _empty_ht_trie(), _ht_get_double_trie(), _ht_get_int_trie(), _ht_get_ptr_trie(), _ht_get_string_trie(), _ht_new_node_trie(), _ht_print_trie(), _ht_put_double_trie(), _ht_put_int_trie(), _ht_put_ptr_trie(), _ht_put_string_ptr_trie(), _ht_put_string_trie(), _ht_remove_trie(), _ht_search_trie(), HASH_TABLE::alphabet_length, HASH_TABLE::alphabet_offset, HASH_TABLE::destroy_ht, HASH_TABLE::empty_ht, Free, HASH_TABLE::hash_table, HASH_TRIE, HASH_TABLE::ht_get_double, HASH_TABLE::ht_get_int, HASH_TABLE::ht_get_ptr, HASH_TABLE::ht_get_string, HASH_TABLE::ht_print, HASH_TABLE::ht_put_double, HASH_TABLE::ht_put_int, HASH_TABLE::ht_put_ptr, HASH_TABLE::ht_put_string, HASH_TABLE::ht_put_string_ptr, HASH_TABLE::ht_remove, HASH_TABLE::ht_search, LOG_ERR, Malloc, HASH_TABLE::mode, n_log, HASH_TABLE::nb_keys, HASH_TABLE::root, HASH_TABLE::seed, and HASH_TABLE::size.
Referenced by main(), and main().
| size_t next_prime | ( | size_t | nb | ) |
return the next prime number greater than or equal to nb
return the next prime number greater than or equal to nb
| nb | number to test |
Definition at line 2575 of file n_hash.c.
References is_prime(), and next_prime().
Referenced by ht_get_optimal_size(), and next_prime().