1 | /************************************************************************************ |
2 | Copyright (C) 2000, 2012 MySQL AB & MySQL Finland AB & TCX DataKonsult AB, |
3 | Monty Program AB |
4 | |
5 | This library is free software; you can redistribute it and/or |
6 | modify it under the terms of the GNU Library General Public |
7 | License as published by the Free Software Foundation; either |
8 | version 2 of the License, or (at your option) any later version. |
9 | |
10 | This library is distributed in the hope that it will be useful, |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
13 | Library General Public License for more details. |
14 | |
15 | You should have received a copy of the GNU Library General Public |
16 | License along with this library; if not see <http://www.gnu.org/licenses> |
17 | or write to the Free Software Foundation, Inc., |
18 | 51 Franklin St., Fifth Floor, Boston, MA 02110, USA |
19 | |
20 | Part of this code includes code from the PHP project which |
21 | is freely available from http://www.php.net |
22 | *************************************************************************************/ |
23 | |
24 | #ifndef _ma_hash_h |
25 | #define _ma_hash_h |
26 | #ifdef __cplusplus |
27 | extern "C" { |
28 | #endif |
29 | |
30 | typedef uchar *(*hash_get_key)(const uchar *,uint*,my_bool); |
31 | typedef void (*hash_free_key)(void *); |
32 | |
33 | /* flags for hash_init */ |
34 | #define HASH_CASE_INSENSITIVE 1 |
35 | |
36 | typedef struct st_hash_info { |
37 | uint next; /* index to next key */ |
38 | uchar *data; /* data for current entry */ |
39 | } HASH_LINK; |
40 | |
41 | typedef struct st_hash { |
42 | uint key_offset,key_length; /* Length of key if const length */ |
43 | uint records,blength,current_record; |
44 | uint flags; |
45 | DYNAMIC_ARRAY array; /* Place for hash_keys */ |
46 | hash_get_key get_key; |
47 | void (*free)(void *); |
48 | uint (*calc_hashnr)(const uchar *key,uint length); |
49 | } HASH; |
50 | |
51 | #define hash_init(A,B,C,D,E,F,G) _hash_init(A,B,C,D,E,F,G CALLER_INFO) |
52 | my_bool _hash_init(HASH *hash,uint default_array_elements, uint key_offset, |
53 | uint key_length, hash_get_key get_key, |
54 | void (*free_element)(void*), uint flags CALLER_INFO_PROTO); |
55 | void hash_free(HASH *tree); |
56 | uchar *hash_element(HASH *hash,uint idx); |
57 | void * hash_search(HASH *info,const uchar *key,uint length); |
58 | void * hash_next(HASH *info,const uchar *key,uint length); |
59 | my_bool hash_insert(HASH *info,const uchar *data); |
60 | my_bool hash_delete(HASH *hash,uchar *record); |
61 | my_bool hash_update(HASH *hash,uchar *record,uchar *old_key,uint old_key_length); |
62 | my_bool hash_check(HASH *hash); /* Only in debug library */ |
63 | |
64 | #define hash_clear(H) memset((char*) (H), 0,sizeof(*(H))) |
65 | #define hash_inited(H) ((H)->array.buffer != 0) |
66 | |
67 | #ifdef __cplusplus |
68 | } |
69 | #endif |
70 | #endif |
71 | |