Searched refs:best_split (Results 1 – 4 of 4) sorted by relevance
99 CvDTreeSplit *best_split = 0, *split = 0, *t; in find_best_split() local148 if( !best_split || best_split->quality < split->quality ) in find_best_split()149 CV_SWAP( best_split, split, t ); in find_best_split()157 return best_split; in find_best_split()
1336 CvDTreeSplit* best_split = 0; in try_split_node() local1366 best_split = find_best_split(node); in try_split_node()1368 node->split = best_split; in try_split_node()1371 if( !can_split || !best_split ) in try_split_node()1388 if( vi == best_split->var_idx ) in try_split_node()1530 CvDTreeSplit *best_split = 0, *split = 0, *t; in find_best_split() local1555 if( !best_split || best_split->quality < split->quality ) in find_best_split()1556 CV_SWAP( best_split, split, t ); in find_best_split()1562 return best_split; in find_best_split()
421 WSplit split, best_split; in findBestSplit() local422 best_split.quality = 0.; in findBestSplit()441 if( split.quality > best_split.quality ) in findBestSplit()443 best_split = split; in findBestSplit()448 if( best_split.quality > 0 ) in findBestSplit()450 int best_vi = best_split.varIdx; in findBestSplit()451 CV_Assert( compVarIdx[best_split.varIdx] >= 0 && best_vi >= 0 ); in findBestSplit()456 best_split.subsetOfs = prevsz; in findBestSplit()457 w->wsplits.push_back(best_split); in findBestSplit()
1683 CvDTreeSplit* best_split = 0; in try_split_node() local1713 best_split = find_best_split(node); in try_split_node()1715 node->split = best_split; in try_split_node()1717 if( !can_split || !best_split ) in try_split_node()1733 if( vi == best_split->var_idx ) in try_split_node()