OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:num_iterations
(Results
1 - 25
of
36
) sorted by null
1
2
/external/valgrind/main/drd/tests/
omp_printf.c
26
int
num_iterations
= 2;
local
34
case 'i':
num_iterations
= atoi(optarg); break;
46
assert(
num_iterations
> 0);
53
for (i = 0; i <
num_iterations
; i++)
/external/ceres-solver/internal/ceres/
trust_region_strategy.h
108
num_iterations
(-1),
124
int
num_iterations
;
member in struct:ceres::internal::TrustRegionStrategy::Summary
conjugate_gradients_solver.cc
79
summary.
num_iterations
= 0;
116
for (summary.
num_iterations
= 1;
117
summary.
num_iterations
< options_.max_num_iterations;
118
++summary.
num_iterations
) {
135
if (summary.
num_iterations
== 1) {
175
if (summary.
num_iterations
% options_.residual_reset_period == 0) {
209
const double zeta = summary.
num_iterations
* (Q1 - Q0) / Q1;
sparse_normal_cholesky_solver.cc
132
summary.
num_iterations
= 0;
146
summary.
num_iterations
= 1;
229
summary.
num_iterations
= 0;
243
summary.
num_iterations
= 1;
311
summary.
num_iterations
= 0;
324
summary.
num_iterations
= 1;
schur_complement_solver.cc
120
summary.
num_iterations
= 0;
134
summary.
num_iterations
= 1;
277
summary.
num_iterations
= 0;
286
summary.
num_iterations
= 0;
301
summary.
num_iterations
= 1;
384
summary.
num_iterations
= 0;
393
summary.
num_iterations
= 0;
440
summary.
num_iterations
= 0;
452
summary.
num_iterations
= 0;
solver_test.cc
103
int
num_iterations
;
local
107
num_iterations
= summary.num_successful_steps +
109
EXPECT_GT(
num_iterations
, 1);
119
num_iterations
= summary.num_successful_steps +
121
EXPECT_GT(
num_iterations
, 1);
dense_normal_cholesky_solver.cc
97
summary.
num_iterations
= 1;
156
summary.
num_iterations
= 1;
dense_qr_solver.cc
105
summary.
num_iterations
= 1;
161
summary.
num_iterations
= 1;
iterative_schur_complement_solver.cc
90
cg_summary.
num_iterations
= 0;
159
cg_summary.
num_iterations
= 0;
levenberg_marquardt_strategy.cc
138
summary.
num_iterations
= linear_solver_summary.
num_iterations
;
line_search.h
184
num_iterations
(0) {}
190
int
num_iterations
;
member in struct:ceres::internal::LineSearch::Summary
linear_solver.h
267
num_iterations
(-1),
272
int
num_iterations
;
member in struct:ceres::internal::LinearSolver::Summary
line_search.cc
271
++summary->
num_iterations
;
272
if (summary->
num_iterations
>= options().max_num_iterations) {
490
++summary->
num_iterations
;
562
} else if (summary->
num_iterations
>= options().max_num_iterations) {
699
const int num_bracketing_iterations = summary->
num_iterations
;
708
if (summary->
num_iterations
>= options().max_num_iterations) {
731
++summary->
num_iterations
;
[
all
...]
symmetric_linear_solver_test.cc
75
ASSERT_EQ(summary.
num_iterations
, 1);
dogleg_strategy.cc
101
summary.
num_iterations
= 0;
135
summary.
num_iterations
= linear_solver_summary.
num_iterations
;
/external/zopfli/src/zopflipng/
zopflipng_lib.h
63
int
num_iterations
;
member in struct:ZopfliPNGOptions
/external/webrtc/src/system_wrappers/source/
cpu_measurement_harness.cc
99
int
num_iterations
= 0;
local
103
while (!cpu_usage_available && (++
num_iterations
< 10000)) {
cpu_wrapper_unittest.cc
45
int
num_iterations
= 0;
local
52
while (!cpu_usage_available && (++
num_iterations
< 10000)) {
/frameworks/ml/bordeaux/learning/multiclass_pa/native/
multiclass_pa.h
65
// Iteratively train the model for
num_iterations
on the given dataset.
67
int
num_iterations
);
70
int
num_iterations
);
multiclass_pa.cpp
172
int
num_iterations
) {
175
for (int t = 0; t <
num_iterations
; ++t) {
180
return total_loss / static_cast<float>(
num_iterations
);
185
int
num_iterations
) {
188
for (int t = 0; t <
num_iterations
; ++t) {
193
return total_loss / static_cast<float>(
num_iterations
);
/external/chromium_org/chrome/renderer/safe_browsing/
phishing_term_feature_extractor.cc
66
int
num_iterations
;
member in struct:safe_browsing::PhishingTermFeatureExtractor::ExtractionState
70
num_iterations
(0) {
141
++state_->
num_iterations
;
281
state_->
num_iterations
);
phishing_dom_feature_extractor.cc
69
int
num_iterations
;
member in struct:safe_browsing::PhishingDOMFeatureExtractor::PageFeatureState
86
num_iterations
(0) {}
149
++page_feature_state_->
num_iterations
;
363
page_feature_state_->
num_iterations
);
/external/harfbuzz_ng/util/
shape-consumer.hh
56
for (unsigned int n = shaper.
num_iterations
; n; n--)
/external/chromium_org/webkit/data/test_shell/sort/
sort.js
44
this.
num_iterations
= 0;
94
Math.floor((elapsed - this.processing_total) / this.
num_iterations
);
135
this.
num_iterations
++;
195
this.
num_iterations
= 0;
226
var step_avg = Math.floor(total / this.
num_iterations
);
228
var overhead_avg = Math.floor(overhead / this.
num_iterations
);
229
var processing_avg = Math.floor(this.processing_total / this.
num_iterations
);
/external/chromium_org/sdch/open-vcdiff/src/
addrcache_test.cc
609
const int
num_iterations
= 40; // run test 40 times and take average
local
614
BM_CacheEncode(
num_iterations
, test_size);
619
<< (encode_time_in_ms /
num_iterations
) << " ms" << std::endl;
624
BM_CacheDecode(
num_iterations
, test_size);
629
<< (decode_time_in_ms /
num_iterations
) << " ms" << std::endl;
Completed in 842 milliseconds
1
2