1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
/*
* Copyright (C) 1996-2009 Michael R. Elkins <me@mutt.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef _HASH_H
#define _HASH_H
union hash_key
{
const char *strkey;
unsigned int intkey;
};
struct hash_elem
{
union hash_key key;
void *data;
struct hash_elem *next;
};
typedef struct
{
int nelem;
unsigned int strdup_keys : 1; /* if set, the key->strkey is strdup'ed */
unsigned int allow_dups : 1; /* if set, duplicate keys are allowed */
struct hash_elem **table;
unsigned int (*gen_hash)(union hash_key, unsigned int);
int (*cmp_key)(union hash_key, union hash_key);
}
HASH;
/* flags for hash_create() */
#define MUTT_HASH_STRCASECMP (1<<0) /* use strcasecmp() to compare keys */
#define MUTT_HASH_STRDUP_KEYS (1<<1) /* make a copy of the keys */
#define MUTT_HASH_ALLOW_DUPS (1<<2) /* allow duplicate keys to be inserted */
HASH *hash_create (int nelem, int flags);
HASH *int_hash_create (int nelem, int flags);
int hash_insert (HASH * table, const char *key, void *data);
int int_hash_insert (HASH *table, unsigned int key, void *data);
void *hash_find (const HASH *table, const char *key);
struct hash_elem *hash_find_elem (const HASH *table, const char *strkey);
void *int_hash_find (const HASH *table, unsigned int key);
struct hash_elem *hash_find_bucket (const HASH *table, const char *key);
void hash_delete (HASH * table, const char *key, const void *data,
void (*destroy) (void *));
void int_hash_delete (HASH * table, unsigned int key, const void *data,
void (*destroy) (void *));
void hash_destroy (HASH ** hash, void (*destroy) (void *));
struct hash_walk_state {
int index;
struct hash_elem *last;
};
struct hash_elem *hash_walk(const HASH *table, struct hash_walk_state *state);
#endif
|
