OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:new_cost
(Results
1 - 5
of
5
) sorted by null
/external/ceres-solver/internal/ceres/
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
< cost
[
all
...]
/external/valgrind/callgrind/
events.h
102
Bool CLG_(add_diff_cost)(EventSet*,ULong* dst, ULong* old, ULong*
new_cost
);
103
Bool CLG_(add_diff_cost_lz)(EventSet*,ULong** pdst, ULong* old, ULong*
new_cost
);
events.c
359
Bool CLG_(add_diff_cost)(EventSet* es, ULong* dst, ULong* old, ULong*
new_cost
)
365
CLG_ASSERT(old &&
new_cost
);
368
if (
new_cost
[i] == old[i]) continue;
369
dst[i] +=
new_cost
[i] - old[i];
370
old[i] =
new_cost
[i];
377
Bool CLG_(add_diff_cost_lz)(EventSet* es, ULong** pdst, ULong* old, ULong*
new_cost
)
384
CLG_ASSERT(old &&
new_cost
);
393
if (
new_cost
[i] == old[i]) continue;
394
dst[i] +=
new_cost
[i] - old[i];
395
old[i] =
new_cost
[i]
[
all
...]
/external/opencv3/3rdparty/libwebp/enc/
frame.c
196
const int
new_cost
= BranchCost(nb, total, new_p)
local
199
const int use_new_p = (old_cost >
new_cost
);
/external/webp/src/enc/
frame.c
159
const int
new_cost
= BranchCost(nb, total, new_p)
local
162
const int use_new_p = (old_cost >
new_cost
);
Completed in 3561 milliseconds