| 4 |
|
*/ |
| 5 |
|
#ifndef _RAD_LOOKUP_H_ |
| 6 |
|
#define _RAD_LOOKUP_H_ |
| 7 |
+ |
|
| 8 |
+ |
#include <string.h> /* strcmp() */ |
| 9 |
+ |
|
| 10 |
|
#ifdef __cplusplus |
| 11 |
|
extern "C" { |
| 12 |
|
#endif |
| 13 |
|
|
| 14 |
+ |
typedef void lut_free_t(void*); |
| 15 |
|
|
| 12 |
– |
#include "copyright.h" |
| 13 |
– |
|
| 16 |
|
typedef struct { |
| 17 |
|
char *key; /* key name */ |
| 18 |
|
unsigned long hval; /* key hash value (for efficiency) */ |
| 20 |
|
} LUENT; |
| 21 |
|
|
| 22 |
|
typedef struct { |
| 23 |
< |
unsigned long (*hashf)(); /* key hash function */ |
| 24 |
< |
int (*keycmp)(); /* key comparison function */ |
| 25 |
< |
void (*freek)(); /* free a key */ |
| 26 |
< |
void (*freed)(); /* free the data */ |
| 23 |
> |
unsigned long (*hashf)(char*); /* key hash function */ |
| 24 |
> |
int (*keycmp)(const char*, const char*); /* key comparison function */ |
| 25 |
> |
lut_free_t *freek; /* free a key */ |
| 26 |
> |
lut_free_t *freed; /* free the data */ |
| 27 |
|
int tsiz; /* current table size */ |
| 28 |
|
LUENT *tabl; /* table, if allocated */ |
| 29 |
|
int ndel; /* number of deleted entries */ |
| 30 |
|
} LUTAB; |
| 31 |
|
|
| 32 |
|
#undef strcmp |
| 33 |
< |
#define LU_SINIT(fk,fd) {lu_shash,strcmp,(void (*)())(fk),\ |
| 34 |
< |
(void (*)())(fd),0,NULL,0} |
| 33 |
> |
#define LU_SINIT(fk,fd) {lu_shash,strcmp,fk,\ |
| 34 |
> |
fd,0,NULL,0} |
| 35 |
|
|
| 36 |
|
/* |
| 37 |
|
* The lu_init routine is called to initialize a table. The number of |
| 80 |
|
* allocated table itself. |
| 81 |
|
*/ |
| 82 |
|
|
| 81 |
– |
#include <string.h> /* strcmp() */ |
| 82 |
– |
|
| 83 |
|
extern int lu_init(LUTAB *tbl, int nel); |
| 84 |
|
extern unsigned long lu_shash(char *s); |
| 85 |
|
extern LUENT *lu_find(LUTAB *tbl, char *key); |
| 86 |
|
extern void lu_delete(LUTAB *tbl, char *key); |
| 87 |
< |
extern int lu_doall(LUTAB *tbl, int (*f)()); |
| 87 |
> |
extern int lu_doall(LUTAB *tbl, int (*f)(LUENT*)); |
| 88 |
|
extern void lu_done(LUTAB *tbl); |
| 89 |
|
|
| 90 |
|
|
