Searched refs:new_cost (Results 1 - 5 of 5) sorted by relevance
/external/ceres-solver/internal/ceres/ |
H A D | trust_region_minimizer.cc | 395 double new_cost = std::numeric_limits<double>::max(); local 398 &new_cost, 404 new_cost = numeric_limits<double>::max(); 411 if (new_cost < std::numeric_limits<double>::max()) { 416 const double x_plus_delta_cost = new_cost; 423 &new_cost, 426 new_cost = x_plus_delta_cost; 431 model_cost_change += x_plus_delta_cost - new_cost; 435 << " Inner iteration cost: " << new_cost; local 437 inner_iterations_were_useful = new_cost < cos [all...] |
/external/valgrind/main/callgrind/ |
H A D | events.c | 404 Bool CLG_(add_diff_cost)(EventSet* es, ULong* dst, ULong* old, ULong* new_cost) argument 410 CLG_ASSERT(old && new_cost); 413 if (new_cost[i] == old[i]) continue; 414 dst[i] += new_cost[i] - old[i]; 415 old[i] = new_cost[i]; 422 Bool CLG_(add_diff_cost_lz)(EventSet* es, ULong** pdst, ULong* old, ULong* new_cost) argument 429 CLG_ASSERT(old && new_cost); 438 if (new_cost[i] == old[i]) continue; 439 dst[i] += new_cost[i] - old[i]; 440 old[i] = new_cost[ [all...] |
H A D | events.h | 106 Bool CLG_(add_diff_cost)(EventSet*,ULong* dst, ULong* old, ULong* new_cost); 107 Bool CLG_(add_diff_cost_lz)(EventSet*,ULong** pdst, ULong* old, ULong* new_cost);
|
/external/chromium_org/third_party/libwebp/enc/ |
H A D | frame.c | 163 const int new_cost = BranchCost(nb, total, new_p) local 166 const int use_new_p = (old_cost > new_cost);
|
/external/webp/src/enc/ |
H A D | frame.c | 163 const int new_cost = BranchCost(nb, total, new_p) local 166 const int use_new_p = (old_cost > new_cost);
|
Completed in 212 milliseconds