22 |
|
int ndel; /* number of deleted entries */ |
23 |
|
} LUTAB; |
24 |
|
|
25 |
+ |
#undef strcmp |
26 |
|
#define LU_SINIT(fk,fd) {lu_shash,strcmp,(void (*)())(fk),\ |
27 |
|
(void (*)())(fd),0,NULL,0} |
28 |
|
|
57 |
|
* The lu_delete routine frees an entry's data (if any) by calling |
58 |
|
* the freed member function, but does not free the key field. This |
59 |
|
* will be freed later during (or instead of) table reallocation. |
60 |
+ |
* It is therefore an error to reuse or do anything with the key |
61 |
+ |
* field after calling lu_delete. |
62 |
|
* |
63 |
+ |
* The lu_doall routine loops through every filled table entry, calling |
64 |
+ |
* the given function once on each entry. If a NULL pointer is passed |
65 |
+ |
* for this function, then lu_doall simply returns the total number of |
66 |
+ |
* active entries. Otherwise, it returns the sum of all the function |
67 |
+ |
* evaluations. |
68 |
+ |
* |
69 |
|
* The lu_done routine calls the given free function once for each |
70 |
|
* assigned table entry (i.e. each entry with an assigned key value). |
71 |
|
* The user must define these routines to free the key and the data |
76 |
|
extern int lu_init(); |
77 |
|
extern LUENT *lu_find(); |
78 |
|
extern void lu_delete(); |
79 |
+ |
extern int lu_doall(); |
80 |
|
extern void lu_done(); |
81 |
|
extern long lu_shash(); |
82 |
|
|