1ADDHT(3)              MBK HASH TABLE MANAGEMENT FUNCTIONS             ADDHT(3)
2
3
4

NAME

6       addht - create an hash table
7

SYNOPSIS

9       #include "mut.h"
10       ht ∗addht(len)
11       unsigned int len;
12

PARAMETER

14       len                 Number of entries in the hash table
15

DESCRIPTION

17       addht()  creates a new hash table in memory.  len is an estimate of the
18       maximum number of entries that the table will contain.  This number may
19       be  automatically  adjusted  when  using  access functions by a dynamic
20       reallocation, in order to warranty fast access time.
21

EXAMPLE

23       #include "mut.h"
24       ht ∗sigHtable(ptfig) /∗ h table suitable for signals ∗/
25       lofig_list ∗ptfig;
26       {
27       losig_list ∗ptsig = ptfig->LOSIG;
28       unsigned int i = 0;
29          while (ptsig) {
30             i++;
31             ptsig = ptsig->NEXT;
32          }
33          return addht(i);
34       }
35

ERROR

37       "∗∗∗ mbk error ∗∗∗ illegal addht : len is '0'"
38              The hash table size cannot be zero, guess why!
39

SEE ALSO

41       mbk(1),  delht(3),  addhtitem(3),  gethtitem(3),   sethtitem(3),   del‐
42       htitem(3), viewht(3).
43
44
45
46
47
48
49ASIM/LIP6                       October 1, 1997                       ADDHT(3)
Impressum