1 #ifndef __CMPH_BDZ_STRUCTS_H__
2 #define __CMPH_BDZ_STRUCTS_H__
3 
4 #include "hash_state.h"
5 
6 struct __bdz_data_t
7 {
8 	cmph_uint32 m; //edges (words) count
9 	cmph_uint32 n; //vertex count
10 	cmph_uint32 r; //partition vertex count
11 	cmph_uint8 *g;
12 	hash_state_t *hl; // linear hashing
13 
14 	cmph_uint32 k; //kth index in ranktable, $k = log_2(n=3r)/\varepsilon$
15 	cmph_uint8 b; // number of bits of k
16 	cmph_uint32 ranktablesize; //number of entries in ranktable, $n/k +1$
17 	cmph_uint32 *ranktable; // rank table
18 };
19 
20 
21 struct __bdz_config_data_t
22 {
23 	cmph_uint32 m; //edges (words) count
24 	cmph_uint32 n; //vertex count
25 	cmph_uint32 r; //partition vertex count
26 	cmph_uint8 *g;
27 	hash_state_t *hl; // linear hashing
28 
29 	cmph_uint32 k; //kth index in ranktable, $k = log_2(n=3r)/\varepsilon$
30 	cmph_uint8 b; // number of bits of k
31 	cmph_uint32 ranktablesize; //number of entries in ranktable, $n/k +1$
32 	cmph_uint32 *ranktable; // rank table
33 	CMPH_HASH hashfunc;
34 };
35 
36 #endif
37