| /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/ |
| conjugate_gradients_solver.cc | 80 summary.num_iterations = 0;
115 for (summary.num_iterations = 1;
116 summary.num_iterations < options_.max_num_iterations;
117 ++summary.num_iterations) {
118 VLOG(3) << "cg iteration " << summary.num_iterations;
137 if (summary.num_iterations == 1) {
176 if (summary.num_iterations % options_.residual_reset_period == 0) {
210 double zeta = summary.num_iterations * (Q1 - Q0) / Q1;
|
| trust_region_strategy.h | 108 num_iterations(-1),
124 int num_iterations; member in struct:ceres::internal::TrustRegionStrategy::Summary
|
| iterative_schur_complement_solver.cc | 86 cg_summary.num_iterations = 0;
156 cg_summary.num_iterations = 0;
170 VLOG(2) << "CG Iterations : " << cg_summary.num_iterations;
|
| linear_solver.h | 245 num_iterations(-1),
250 int num_iterations; member in struct:ceres::internal::LinearSolver::Summary
|
| dense_normal_cholesky_solver.cc | 97 summary.num_iterations = 1;
149 summary.num_iterations = 1;
|
| dense_qr_solver.cc | 112 summary.num_iterations = 1;
163 summary.num_iterations = 1;
|
| levenberg_marquardt_strategy.cc | 135 summary.num_iterations = linear_solver_summary.num_iterations;
|
| line_search.h | 183 num_iterations(0) {}
189 int num_iterations; member in struct:ceres::internal::LineSearch::Summary
|
| line_search.cc | 261 ++summary->num_iterations;
262 if (summary->num_iterations >= options().max_num_iterations) {
354 summary->num_iterations < options().max_num_iterations) {
372 << ", bracket_high: " << bracket_high << ", num_iterations: "
373 << summary->num_iterations << ", max_num_iterations: "
459 ++summary->num_iterations;
510 } else if (summary->num_iterations >= options().max_num_iterations) {
615 const int num_bracketing_iterations = summary->num_iterations;
626 if (summary->num_iterations >= options().max_num_iterations) {
649 ++summary->num_iterations;
[all...] |
| symmetric_linear_solver_test.cc | 75 ASSERT_EQ(summary.num_iterations, 1);
|
| sparse_normal_cholesky_solver.cc | 104 summary.num_iterations = 1;
225 summary.num_iterations = 1;
|
| dogleg_strategy.cc | 101 summary.num_iterations = 0;
135 summary.num_iterations = linear_solver_summary.num_iterations;
|
| /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 | 68 int num_iterations; member in struct:safe_browsing::PhishingTermFeatureExtractor::ExtractionState
74 num_iterations(0) {
145 ++state_->num_iterations;
293 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;
366 page_feature_state_->num_iterations);
|
| /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/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;
|
| /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;
|
| /external/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;
|
| /external/chromium_org/cc/scheduler/ |
| delay_based_time_source_unittest.cc | 309 int num_iterations = 10; local
320 for (int i = 0; i < num_iterations; ++i) {
331 total_frame_time / static_cast<double>(num_iterations);
|
| /external/ceres-solver/examples/ |
| bundle_adjuster.cc | 102 DEFINE_int32(num_iterations, 5, "Number of iterations.");
|
