| 1 |
#ifndef __CMPH_CHD_PH_STRUCTS_H__ |
| 2 |
#define __CMPH_CHD_PH_STRUCTS_H__ |
| 3 |
|
| 4 |
#include "hash_state.h" |
| 5 |
#include "compressed_seq.h" |
| 6 |
|
| 7 |
struct __chd_ph_data_t |
| 8 |
{ |
| 9 |
compressed_seq_t * cs; // compressed displacement values |
| 10 |
cmph_uint32 nbuckets; // number of buckets |
| 11 |
cmph_uint32 n; // number of bins |
| 12 |
hash_state_t *hl; // linear hash function |
| 13 |
}; |
| 14 |
|
| 15 |
struct __chd_ph_config_data_t |
| 16 |
{ |
| 17 |
CMPH_HASH hashfunc; // linear hash function to be used |
| 18 |
compressed_seq_t * cs; // compressed displacement values |
| 19 |
cmph_uint32 nbuckets; // number of buckets |
| 20 |
cmph_uint32 n; // number of bins |
| 21 |
hash_state_t *hl; // linear hash function |
| 22 |
|
| 23 |
cmph_uint32 m; // number of keys |
| 24 |
cmph_uint8 use_h; // flag to indicate the of use of a heuristic (use_h = 1) |
| 25 |
cmph_uint32 keys_per_bin;//maximum number of keys per bin |
| 26 |
cmph_uint32 keys_per_bucket; // average number of keys per bucket |
| 27 |
cmph_uint8 *occup_table; // table that indicates occupied positions |
| 28 |
}; |
| 29 |
#endif |