[prev] [index] [next]

Hashing (cont)

Possible concrete data representation:

#define NoItem distinguished Item value

typedef struct HashTabRep {
   Item *items; // array of Items
   int  nslots; // # elements in array
   int  nitems; // # items stored in array
} HashTabRep;

typedef HashTabRep *HashTable;

Assume:  key(NoItem) matches no real Key value