哈希表操作代码（Hash table operation code）.docVIP

哈希表操作代码（Hash table operation code） # include ctype. H Include malloc. H / * malloc (), etc. * / # include limit.h / * INT_MAX, etc. * / # include stdio, h / * EOF (= ^ Z or F6), NULL * / # include stdlib. H / * atoi () * / # include IO. H eof () / * * / H # include math.h / * floor (), the ceil (), abs () * / # include process. H / * the exit () * / / * function result status code * / 1 # define TRUE # define FALSE 0 1 # define OK # define the ERROR 0 # define INFEASIBLE - 1 / * Status is the type of function, whose value is the function result Status code, such as OK, etc The # define NULLKEY 0 / * 0 is unmarked * / Number of data elements * / Typedef int KeyType; / * sets keywords for integer * / Typedef int the Status; Typedef struct { KeyType key; Int the word; } ElemType; / * data element type * / # define EQ (a, b) ((a) = = (b)) 11,19,29,37 int hashsize [] = {}; / * hash table volume increment table, a suitable prime number sequence * / Int m = 0; / * hash table length, global variable * / Typedef struct { ElemType * elem; / * data element storage base, dynamic allocation of arrays * / Int count; / * the number of current data elements * / Int sizeindex; / * hashsize [sizeindex] for current capacity * / } HashTable. # define SUCCESS 1 # define UNSUCCESS 0 # define DUPLICATE - 1 The Status InitHashTable (HashTable * H) {/ * operation results: construct an empty hash table * / Int I; (* H). The count = 0; / * the current number of elements is 0 * / (* H). The sizeindex = 0; / * the initial storage capacity is hashsize [0] * / M = hashsize [0]. (* H). Elem = (ElemType *) malloc sizeof (m * (ElemType)); If (! (* H). Elem) The exit (OVERFLOW); / * storage allocation failure * / For (I = 0; I m; i++) (* H). Elem [I] key = NULLKEY; / * unrecorded symbol * / Return OK; } Void DestroyHashTable (HashTable * H) {/ * initial conditions: hash table H exists. Operation result: destroy hash table H * / Free ((* H). Elem); (* H). Elem = NULL; (* H). The count