/external/ceres-solver/include/ceres/ |
D | dynamic_numeric_diff_cost_function.h | 174 ParameterVector step_size = x.array().abs() * relative_step_size; in EvaluateJacobianForParameterBlock() local 178 double fallback_step_size = step_size.sum() / step_size.rows(); in EvaluateJacobianForParameterBlock() 188 if (step_size(j) == 0.0) { in EvaluateJacobianForParameterBlock() 193 step_size(j) = fallback_step_size; in EvaluateJacobianForParameterBlock() 195 x_plus_delta(j) = x(j) + step_size(j); in EvaluateJacobianForParameterBlock() 209 double one_over_h = 1 / step_size(j); in EvaluateJacobianForParameterBlock() 212 x_plus_delta(j) = x(j) - step_size(j); in EvaluateJacobianForParameterBlock()
|
D | iteration_callback.h | 57 step_size(0.0), in IterationSummary() 129 double step_size; member
|
/external/v8/test/unittests/heap/ |
D | gc-idle-time-handler-unittest.cc | 43 size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize(1, 0); in TEST() local 47 step_size); in TEST() 53 size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize( in TEST() local 57 step_size); in TEST() 62 size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize( in TEST() local 65 step_size); in TEST() 70 size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize( in TEST() local 73 step_size); in TEST()
|
/external/ceres-solver/include/ceres/internal/ |
D | numeric_diff.h | 122 ParameterVector step_size = x.array().abs() * relative_step_size; in EvaluateJacobianForParameterBlock() local 129 (step_size.sum() == 0) in EvaluateJacobianForParameterBlock() 131 : step_size.sum() / step_size.rows(); in EvaluateJacobianForParameterBlock() 139 (step_size(j) == 0.0) ? fallback_step_size : step_size(j); in EvaluateJacobianForParameterBlock()
|
/external/ceres-solver/internal/ceres/ |
D | line_search.cc | 213 double step_size = 0.0, unused_min_value = 0.0; in InterpolatingPolynomialMinimizingStepSize() local 215 &step_size, &unused_min_value); in InterpolatingPolynomialMinimizingStepSize() 216 return step_size; in InterpolatingPolynomialMinimizingStepSize() 282 const double step_size = in Search() local 291 if (step_size * descent_direction_max_norm < options().min_step_size) { in Search() 294 "with descent_direction_max_norm: %.5e.", step_size, in Search() 301 current.x = step_size; in Search() 597 const double step_size = in BracketingPhase() local 605 if (step_size * descent_direction_max_norm < options().min_step_size) { in BracketingPhase() 608 "with descent_direction_max_norm: %.5e", step_size, in BracketingPhase() [all …]
|
D | line_search_minimizer.h | 56 step_size(0.0) { in State() 65 double step_size; member
|
D | line_search_minimizer.cc | 328 current_state.step_size = line_search_summary.optimal_step_size; in Minimize() 329 delta = current_state.step_size * current_state.search_direction; in Minimize() 365 iteration_summary.step_size = current_state.step_size; in Minimize()
|
D | line_search_direction.cc | 120 previous.search_direction * previous.step_size, in NextDirection() 174 const Vector delta_x = previous.search_direction * previous.step_size; in NextDirection()
|
D | callbacks.cc | 75 summary.step_size, in operator ()()
|
/external/chromium-trace/catapult/dashboard/dashboard/ |
D | find_step.py | 70 step_size = abs(math_utils.Mean(left) - math_utils.Mean(right)) 71 if not step_size: 76 return step_size / distance
|
/external/llvm/test/CodeGen/PowerPC/ |
D | ldtoc-inv.ll | 8 define void @test(i32* nocapture %out, i32 zeroext %step_size) #0 { 10 %shl = shl i32 %step_size, 2 23 %shl1 = shl i32 %0, %step_size
|
/external/v8/src/profiler/ |
D | sampling-heap-profiler.h | 158 SamplingAllocationObserver(Heap* heap, intptr_t step_size, uint64_t rate, in SamplingAllocationObserver() argument 161 : AllocationObserver(step_size), in SamplingAllocationObserver()
|
/external/v8/src/heap/ |
D | incremental-marking.h | 223 Observer(IncrementalMarking& incremental_marking, intptr_t step_size) in Observer() argument 224 : AllocationObserver(step_size), in Observer()
|
D | heap.h | 2643 explicit AllocationObserver(intptr_t step_size) in AllocationObserver() argument 2644 : step_size_(step_size), bytes_to_next_step_(step_size) { in AllocationObserver() 2645 DCHECK(step_size >= kPointerSize); in AllocationObserver() 2663 intptr_t step_size() const { return step_size_; } in step_size() function
|
D | heap.cc | 59 IdleScavengeObserver(Heap& heap, intptr_t step_size) in IdleScavengeObserver() argument 60 : AllocationObserver(step_size), heap_(heap) {} in IdleScavengeObserver()
|
/external/speex/include/speex/ |
D | speex_jitter.h | 124 JitterBuffer *jitter_buffer_init(int step_size);
|
/external/webrtc/talk/app/webrtc/test/ |
D | fakeaudiocapturemodule.h | 138 int32_t SpeakerVolumeStepSize(uint16_t* step_size) const override; 146 int32_t MicrophoneVolumeStepSize(uint16_t* step_size) const override;
|
/external/webp/src/enc/ |
D | filter.c | 237 const int step_size = (delta_max - delta_min >= 4) ? 4 : 1; in VP8StoreFilterStats() local 252 for (d = delta_min; d <= delta_max; d += step_size) { in VP8StoreFilterStats()
|
/external/speex/libspeex/ |
D | jitter.c | 272 EXPORT JitterBuffer *jitter_buffer_init(int step_size) in jitter_buffer_init() argument 281 jitter->delay_step = step_size; in jitter_buffer_init() 282 jitter->concealment_size = step_size; in jitter_buffer_init()
|
/external/v8/test/cctest/heap/ |
D | test-spaces.cc | 550 explicit Observer(intptr_t step_size) in Observer() argument 551 : AllocationObserver(step_size), count_(0) {} in Observer()
|
/external/ceres-solver/docs/source/ |
D | solving.rst | 925 .. math:: f(\text{step_size}) \le f(0) + \text{sufficient_decrease} * [f'(0) * \text{step_size}] 935 .. math:: \text{new_step_size} >= \text{max_line_search_step_contraction} * \text{step_size} 947 .. math:: \text{new_step_size} <= \text{min_line_search_step_contraction} * \text{step_size} 993 .. math:: \|f'(\text{step_size})\| <= \text{sufficient_curvature_decrease} * \|f'(0)\| 1008 .. math:: \text{new_step_size} <= \text{max_step_expansion} * \text{step_size} 1698 .. member:: double IterationSummary::step_size
|