Searched refs:split_point (Results 1 – 6 of 6) sorted by relevance
845 int split_point, int inversed, float quality ) in new_split_ord() argument850 split->ord.split_point = split_point; in new_split_ord()1478 int split_point = node->split->ord.split_point; in calc_node_dir() local1481 assert( 0 <= split_point && split_point < n1-1 ); in calc_node_dir()1485 for( i = 0; i <= split_point; i++ ) in calc_node_dir()1492 L = split_point-1; in calc_node_dir()1493 R = n1 - split_point + 1; in calc_node_dir()1501 for( i = 0; i <= split_point; i++ ) in calc_node_dir()2471 int split_point = split->ord.split_point; in complete_node_dir() local2474 assert( 0 <= split_point && split_point < n-1 ); in complete_node_dir()[all …]
212 int split_point = node->split->ord.split_point; in calc_node_dir() local215 assert( 0 <= split_point && split_point < n1-1 ); in calc_node_dir()218 for( i = 0; i <= split_point; i++ ) in calc_node_dir()
1075 int split_point, int inversed, float quality ) in new_split_ord() argument1081 split->ord.split_point = split_point; in new_split_ord()1824 int split_point = node->split->ord.split_point; in calc_node_dir() local1834 assert( 0 <= split_point && split_point < n1-1 ); in calc_node_dir()1838 for( i = 0; i <= split_point; i++ ) in calc_node_dir()1845 L = split_point-1; in calc_node_dir()1846 R = n1 - split_point + 1; in calc_node_dir()1855 for( i = 0; i <= split_point; i++ ) in calc_node_dir()2084 split->ord.split_point = best_i; in find_split_ord_class()2429 split->ord.split_point = best_i; in find_split_ord_reg()[all …]
219 int split_point = node->split->ord.split_point; in calc_node_dir() local222 assert( 0 <= split_point && split_point < n1-1 ); in calc_node_dir()225 for( i = 0; i <= split_point; i++ ) in calc_node_dir()347 split->ord.split_point = best_i; in find_split_ord_class()543 split->ord.split_point = best_i; in find_split_ord_reg()
590 int split_point; member702 int split_point, int inversed, float quality );
664 int split_point; member785 int split_point, int inversed, float quality );