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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
/*-----------------------------------------------------------------
SDCChast.h - contains support routines for hashtables/sets .
Written By - Sandeep Dutta . sandeep.dutta@usa.net (1998)
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, 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, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
In other words, you are welcome to use, share and improve this program.
You are forbidden to forbid anyone else to use, share and improve
what you give them. Help stamp out software-hoarding!
-------------------------------------------------------------------------*/
#ifndef SDCCHASHT_H
#define SDCCHASHT_H
/* hashtable item */
typedef struct hashtItem
{
int key;
/* Pointer to the key that was hashed for key.
Used for a hash table with unique keys. */
void *pkey;
void *item;
struct hashtItem *next;
}
hashtItem;
/* hashtable */
typedef struct hTab
{
int size; /* max number of items */
int minKey; /* minimum key value */
int maxKey; /* maximum key value */
hashtItem **table; /* the actual table */
int currKey; /* used for iteration */
hashtItem *currItem; /* current item within the list */
int nItems;
}
hTab;
typedef enum
{
DELETE_CHAIN = 1,
DELETE_ITEM
}
DELETE_ACTION;
/*-----------------------------------------------------------------*/
/* Forward definition for functions */
/*-----------------------------------------------------------------*/
/* hashtable related functions */
hTab *newHashTable (int);
void hTabAddItem (hTab **, int key, void *item);
/** Adds a new item to the hash table.
@param h The hash table to add to
@param key A hashed version of pkey
@param pkey A copy of the key. Owned by the
hash table after this function.
@param item Value for this key.
*/
void hTabAddItemLong (hTab ** h, int key, void *pkey, void *item);
/** Finds a item by exact key.
Searches all items in the key 'key' for a key that
according to 'compare' matches pkey.
@param h The hash table to search
@param key A hashed version of pkey.
@param pkey The key to search for
@param compare Returns 0 if pkey == this
*/
void *hTabFindByKey (hTab * h, int key, const void *pkey, int (*compare) (const void *, const void *));
/** Deletes an item with the exact key 'pkey'
@see hTabFindByKey
*/
int hTabDeleteByKey (hTab ** h, int key, const void *pkey, int (*compare) (const void *, const void *));
void hTabDeleteItem (hTab **, int key,
const void *item, DELETE_ACTION action,
int (*compareFunc) (const void *, const void *));
int hTabIsInTable (hTab *, int, void *,
int (*compareFunc) (void *, void *));
void *hTabFirstItem (hTab *, int *);
void *hTabNextItem (hTab *, int *);
hTab *hTabFromTable (hTab *);
int isHtabsEqual (hTab *, hTab *, int (*compareFunc) (void *, void *));
hashtItem *hTabSearch (hTab *, int);
/* return the first item with the given key */
void *hTabItemWithKey (hTab *, int);
void hTabAddItemIfNotP (hTab **, int, void *);
void hTabDeleteAll (hTab *);
void *hTabFirstItemWK (hTab * htab, int wk);
void *hTabNextItemWK (hTab * htab);
void hTabClearAll (hTab * htab);
int hTabMaxKey (hTab *htab);
/** Find the first item that either is 'item' or which
according to 'compareFunc' is the same as item.
@param compareFunc strcmp like compare function, may be null.
*/
void *hTabFindItem (hTab * htab, int key,
void *item, int (*compareFunc) (void *, void *));
void shash_add (hTab ** h, const char *szKey, const char *szValue);
const char *shash_find (hTab * h, const char *szKey);
#endif
|
