Azinix

Hash_t Struct Reference

Hash table. More...

#include <st.h>


Data Fields

int(* compare )()
int(* hash )()
int num_bins
int num_entries
int max_density
int reorder_flag
double grow_factor
Hash_Entry_t ** bins
Hash_Generator_tgen


Detailed Description

Hash table.

The hashtable is based on collision chaining. The user is to provide the hash and compare functions. Pre-defined functions exists for numbers, pointers, and strings.

Definition at line 55 of file st.h.


Field Documentation

int(* Hash_t::compare)()

int(* Hash_t::hash)()

int Hash_t::num_bins

Definition at line 59 of file st.h.

int Hash_t::num_entries

Definition at line 60 of file st.h.

int Hash_t::max_density

Definition at line 61 of file st.h.

int Hash_t::reorder_flag

Definition at line 62 of file st.h.

double Hash_t::grow_factor

Definition at line 63 of file st.h.

Hash_Entry_t** Hash_t::bins

Definition at line 64 of file st.h.

Hash_Generator_t* Hash_t::gen

Definition at line 67 of file st.h.