#include "eg_config.h"#include "eg_macros.h"#include "eg_elist.h"#include "eg_mem.h"
Include dependency graph for eg_ehash.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Data Structures | |
| struct | EGeHashInfo_t |
| structure to store in the hash table, for a key we store a key, this should be general enough More... | |
| struct | EGeHashTable_t |
Defines | |
| #define | EGeHashFunc(__key, __maxsize) |
| this is the hashing function. | |
| #define | EGeHashTableAdd(__htable, __hinfo) |
| insert an element to the hash table. | |
| #define | EGeHashTableClear(__htable) EGfree((__htable)->table) |
| Clear a hash table (free internally allocated memory too). | |
| #define | EGeHashTableDel(__htable, __hinfo) |
| this is to eliminate an element from the hash table. | |
| #define | EGeHashTableFind(__htable, __hkey) |
| this is to find an element in the hash table, if the key is not found, it return 0, otherwise, it will return the pointer to the first EGeHashInfo_t structure that has the sought after key. | |
| #define | EGeHashTableFindNext(__htable, __hinfo) |
| Given a hash info pointer in a table, find the next EGeHashInfo_t structure in the table with the same key. If no more structures with the same key are found, return 0. | |
| #define | EGeHashTableInit(__htable, __maxsz) |
| Initialize a hash table as a table of the given max_size. | |
| #define | EGeHashTableResize(__htable, __maxsz) |
| Given an initialized hash table, resize the table array and move all members from the old array to the new one. | |
Typedefs | |
| typedef struct EGeHashInfo_t | EGeHashInfo_t |
| structure to store in the hash table, for a key we store a key, this should be general enough | |
| typedef struct EGeHashTable_t | EGeHashTable_t |
| typedef uint64_t | EGkey_t |
Variables | |
| const EGkey_t | EGhashA |
| const EGkey_t | EGhashB |
| const EGkey_t | EGhashPrime |
Detailed Description
Definition in file eg_ehash.h.
