Searched defs:best_val (Results 1 - 4 of 4) sorted by relevance
/external/opencv/ml/src/ |
H A D | mlknearest.cpp | 239 Cv32suf best_val; local 258 best_val.i = 0; 266 best_val.i = sort_buf[j-1].i; 270 r = best_val.f;
|
H A D | mlboost.cpp | 255 double best_val = 0; local 290 if( best_val < val ) 292 best_val = val; 312 if( best_val < val ) 314 best_val = val; 323 0, (float)best_val ) : 0; 345 double best_val = 0; local 403 if( best_val < val ) 405 best_val = val; 416 if( best_val < va 449 double best_val = 0, lsum = 0, rsum = node->value*n; local 500 double L = 0, R = 0, best_val = 0, lsum = 0, rsum = 0; local 583 double best_val; local 649 double best_val = 0; local [all...] |
H A D | mltree.cpp | 1578 double lsum2 = 0, rsum2 = 0, best_val = 0; local 1612 if( best_val < val ) 1614 best_val = val; 1644 if( best_val < val ) 1646 best_val = val; 1655 0, (float)best_val ) : 0; 1773 double best_val = 0; 1892 if( best_val < val ) 1894 best_val = val; 1903 split = data->new_split_cat( vi, (float)best_val ); 1979 double best_val = 0, lsum = 0, rsum = 0; local 2059 double best_val; local 2173 double best_val = 0; local [all...] |
/external/libpng/contrib/tools/ |
H A D | pngcp.c | 469 int best_val; /* Best value found so far */ member in struct:display::stack 874 dp->stack[sp].best_val = dp->value[opt] = options[opt].values[entry].value; 1111 assert(val != dp->stack[sp].best_val); /* should be a new value */ 1141 if (dp->stack[sp].best_val < dp->value[opt]) 1147 else if (dp->stack[sp].best_val > dp->value[opt]) 1196 /* An option that is already on the stack; update best_size and best_val 1208 dp->stack[sp].best_val = dp->value[opt];
|
Completed in 175 milliseconds