lib_hash.h

   1 #ifndef LIB_HASH_H_
   2 #define LIB_HASH_H_
   3
   4 #define EMPTY 0
   5
   6 typedef struct hash {
   7         int * data;
   8         int size;
   9 } Hash;
  10
  11 /*
  12         create new hash with len length
  13         returns null pointer when hash could not be created.
  14 */
  15 Hash hash_new(int len);
  16
  17 /*
  18         same as hash_new accept:
  19         tests input length - determine if number is double prime.
  20         If not, finds next larger double prime for size of hash.
  21 */
  22 Hash hash_new_prime(int len);
  23
  24 /* insert data into hash, must be sent with size of data */
  25 int hash_insert(Hash h, void * data, size_t length);
  26
  27 /* search hash for data value, return address of data */
  28 void * hash_search(Hash h, void * data, size_t length);
  29
  30 /* remove data from hash, must be sent with size of data removed */
  31 int hash_remove(Hash h, void * data, size_t length);
  32
  33 /* test for empty hash - no data stored */
  34 int hash_empty(Hash h);
  35
  36 /* test for hash that is completely full */
  37 int hash_full(Hash h);
  38
  39 /* remove all data from hash */
  40 void hash_clear(Hash h);
  41
  42 /* print hash contents to stdout - used for debugging */
  43 void hash_print(Hash h);
  44
  45 /* delete hash and all its contents */
  46 void hash_delete(Hash h);
  47
  48 /* find next double prime number - used for lenth of arrays */
  49 int is_prime(int num);
  50
  51 /* find next prime number where number-2 is also prime */
  52 int next_twinprime(int num);
  53
  54 #endif /* LIB_HASH_H_ */