Clases |
struct | st_hash |
'defines' |
#define | HASH_OVERHEAD (sizeof(char*)*2) |
#define | hash_init(A, B, C, D, E, F, G, H) _hash_init(A,B,C,D,E,F,G, H CALLER_INFO) |
#define | hash_clear(H) bzero((char*) (H),sizeof(*(H))) |
#define | hash_inited(H) ((H)->array.buffer != 0) |
#define | hash_init_opt(A, B, C, D, E, F, G, H) (!hash_inited(A) && _hash_init(A,B,C,D,E,F,G, H CALLER_INFO)) |
'typedefs' |
typedef byte *(* | hash_get_key )(const byte *, uint *, my_bool) |
typedef void(* | hash_free_key )(void *) |
typedef struct st_hash | HASH |
typedef uint | HASH_SEARCH_STATE |
Funciones |
my_bool | _hash_init (HASH *hash, CHARSET_INFO *charset, uint default_array_elements, uint key_offset, uint key_length, hash_get_key get_key, void(*free_element)(void *), uint flags CALLER_INFO_PROTO) |
void | hash_free (HASH *tree) |
void | my_hash_reset (HASH *hash) |
byte * | hash_element (HASH *hash, uint idx) |
gptr | hash_search (const HASH *info, const byte *key, uint length) |
gptr | hash_first (const HASH *info, const byte *key, uint length, HASH_SEARCH_STATE *state) |
gptr | hash_next (const HASH *info, const byte *key, uint length, HASH_SEARCH_STATE *state) |
my_bool | my_hash_insert (HASH *info, const byte *data) |
my_bool | hash_delete (HASH *hash, byte *record) |
my_bool | hash_update (HASH *hash, byte *record, byte *old_key, uint old_key_length) |
void | hash_replace (HASH *hash, HASH_SEARCH_STATE *state, byte *new_row) |
my_bool | hash_check (HASH *hash) |