root/1.8.3/trunk/hdrs/htab.h

/* htab.h - Structures and declarations needed for table hashing */

#ifndef __HTAB_H
#define __HTAB_H

typedef struct hashtable HASHTAB;

/** Hash table bucket struct */
struct hash_bucket {
  const char *key;
  void *data;
};

/** A hash table.
 */
struct hashtable {
  int hashsize;                 /**< Size of buckets array */
  int entries;                  /**< Number of entries stored */
  int hashfunc_offset;          /**< Which pair of hash functions to use */
  struct hash_bucket *buckets;  /**< Buckets */
  int last_index;              /**< State for hashfirst & hashnext. */
  void (*free_data) (void *);   /**< Function to call on data when deleting
                                   a entry. */
};

typedef struct hash_bucket HASHENT;

#define hashinit(tab, size) hash_init((tab), (size), NULL)
#define hashfind(key,tab) hash_value(hash_find(tab,key))
#define hashadd(key,data,tab) hash_add(tab,key,data)
#define hashdelete(key,tab) hash_delete(tab,hash_find(tab,key))
#define hashflush(tab, size) hash_flush(tab,size)
#define hashfree(tab) hash_flush(tab, 0)
int hash_getmask(int *size);
void hash_init(HASHTAB *htab, int size, void (*)(void *));
HASHENT *hash_find(HASHTAB *htab, const char *key);
#define hash_value(entry) (entry) ? (entry)->data : NULL
#define hash_key(entry) (entry) ? (entry)->key : NULL
bool hash_resize(HASHTAB *htab, int size);
bool hash_add(HASHTAB *htab, const char *key, void *hashdata);
void hash_delete(HASHTAB *htab, HASHENT *entry);
void hash_flush(HASHTAB *htab, int size);
void *hash_firstentry(HASHTAB *htab);
void *hash_nextentry(HASHTAB *htab);
const char *hash_firstentry_key(HASHTAB *htab);
const char *hash_nextentry_key(HASHTAB *htab);
void hash_stats_header(dbref player);
void hash_stats(dbref player, HASHTAB *htab, const char *hashname);
#endif