| … | |
… | |
| 23 | |
23 | |
| 24 | #include <string.h> |
24 | #include <string.h> |
| 25 | #include "MT.h" |
25 | #include "MT.h" |
| 26 | #include "MTpredicate.h" |
26 | #include "MTpredicate.h" |
| 27 | |
27 | |
| 28 | double MIN_UTIL; // minimum node utilization |
28 | double MIN_UTIL = 0.35; // minimum node utilization |
| 29 | pp_function PROMOTE_PART_FUNCTION; // promotion method |
29 | pp_function PROMOTE_PART_FUNCTION = CONFIRMED; // promotion method |
| 30 | pv_function PROMOTE_VOTE_FUNCTION; // confirmed promotion method (if needed) |
30 | pv_function PROMOTE_VOTE_FUNCTION = mM_RAD; // confirmed promotion method (if needed) |
| 31 | pp_function SECONDARY_PART_FUNCTION; // root promotion method (can't use stored distances): used only for confirmed and MAX_UB_DIST methods |
31 | pp_function SECONDARY_PART_FUNCTION = RANDOM; // root promotion method (can't use stored distances): used only for confirmed and MAX_UB_DIST methods |
| 32 | r_function RADIUS_FUNCTION; // mM_RAD promotion method (if needed) |
32 | r_function RADIUS_FUNCTION = LB; // mM_RAD promotion method (if needed) |
| 33 | int NUM_CANDIDATES; // number of candidates for sampling |
33 | int NUM_CANDIDATES = 10; // number of candidates for sampling |
| 34 | s_function SPLIT_FUNCTION; // split method |
34 | s_function SPLIT_FUNCTION = BAL_G_HYPERPL; // split method |
| 35 | |
35 | |
| 36 | extern int IOread; |
36 | extern int IOread; |
| 37 | |
37 | |
| 38 | // used to quick-sort the entries in a node according to their distance from the parent |
38 | // used to quick-sort the entries in a node according to their distance from the parent |
| 39 | int |
39 | int |
