| /external/ceres-solver/internal/ceres/ |
| canonical_views_clustering_test.cc | 70 ComputeCanonicalViewsClustering(graph_, options_, ¢ers_, &membership_);
75 CanonicalViewsClusteringOptions options_; member in class:ceres::internal::CanonicalViewsTest
81 options_.min_views = 0;
82 options_.size_penalty_weight = 0.5;
83 options_.similarity_penalty_weight = 0.0;
84 options_.view_score_weight = 0.0;
102 options_.min_views = 0;
103 options_.size_penalty_weight = 2.0;
104 options_.similarity_penalty_weight = 0.0;
105 options_.view_score_weight = 0.0
[all...] |
| dogleg_strategy_test.cc | 50 TrustRegionStrategy::Options options_; member in class:ceres::internal::__anon3553::Fixture
87 options_.lm_min_diagonal = 1.0;
88 options_.lm_max_diagonal = 1.0;
115 options_.lm_min_diagonal = 1.0;
116 options_.lm_max_diagonal = 1.0;
131 options_.linear_solver = linear_solver.get();
135 options_.dogleg_type = TRADITIONAL_DOGLEG;
136 options_.initial_radius = 2.0;
137 options_.max_radius = 2.0;
139 DoglegStrategy strategy(options_);
[all...] |
| iterative_schur_complement_solver.cc | 54 : options_(options) {
70 new ImplicitSchurComplement(options_.elimination_groups[0],
71 options_.preconditioner_type == JACOBI));
85 cg_options.max_num_iterations = options_.max_num_iterations;
93 switch (options_.preconditioner_type) {
114 new VisibilityBasedPreconditioner(*A->block_structure(), options_));
|
| trust_region_minimizer.cc | 66 for (int i = 0; i < options_.callbacks.size(); ++i) {
68 (*options_.callbacks[i])(iteration_summary);
87 options_ = options;
88 sort(options_.lsqp_iterations_to_dump.begin(),
89 options_.lsqp_iterations_to_dump.end());
120 Evaluator* evaluator = CHECK_NOTNULL(options_.evaluator);
121 SparseMatrix* jacobian = CHECK_NOTNULL(options_.jacobian);
122 TrustRegionStrategy* strategy = CHECK_NOTNULL(options_.trust_region_strategy);
151 iteration_summary.eta = options_.eta;
176 if (options_.jacobi_scaling)
[all...] |
| cgnr_solver.cc | 43 : options_(options),
59 if (options_.preconditioner_type == JACOBI) {
65 } else if (options_.preconditioner_type != IDENTITY) {
72 ConjugateGradientsSolver conjugate_gradient_solver(options_);
|
| cgnr_solver.h | 58 const LinearSolver::Options options_; member in class:ceres::internal::CgnrSolver
|
| conjugate_gradients_solver.h | 67 const LinearSolver::Options options_; member in class:ceres::internal::ConjugateGradientsSolver
|
| dense_normal_cholesky_solver.h | 88 const LinearSolver::Options options_; member in class:ceres::internal::DenseNormalCholeskySolver
|
| dense_qr_solver.h | 93 const LinearSolver::Options options_; member in class:ceres::internal::DenseQRSolver
|
| iterative_schur_complement_solver.h | 85 LinearSolver::Options options_; member in class:ceres::internal::IterativeSchurComplementSolver
|
| trust_region_minimizer.h | 62 Minimizer::Options options_; member in class:ceres::internal::TrustRegionMinimizer
|
| schur_complement_solver.h | 105 : options_(options) {
119 const LinearSolver::Options& options() const { return options_; }
130 LinearSolver::Options options_; member in class:ceres::internal::SchurComplementSolver
|
| visibility_based_preconditioner.cc | 69 : options_(options),
73 CHECK_GT(options_.elimination_groups.size(), 1);
74 CHECK_GT(options_.elimination_groups[0], 0);
75 CHECK(options_.preconditioner_type == SCHUR_JACOBI ||
76 options_.preconditioner_type == CLUSTER_JACOBI ||
77 options_.preconditioner_type == CLUSTER_TRIDIAGONAL)
78 << "Unknown preconditioner type: " << options_.preconditioner_type;
79 num_blocks_ = bs.cols.size() - options_.elimination_groups[0];
87 block_size_[i] = bs.cols[i + options_.elimination_groups[0]].size;
91 switch (options_.preconditioner_type)
[all...] |
| canonical_views_clustering.cc | 71 CanonicalViewsClusteringOptions options_; member in class:ceres::internal::CanonicalViewsClustering
99 options_ = options;
128 (centers->size() >= options_.min_views)) {
161 options_.view_score_weight * graph_->VertexWeight(candidate);
179 difference -= options_.size_penalty_weight;
183 difference -= options_.similarity_penalty_weight *
|
| visibility_based_preconditioner_test.cc | 83 options_.elimination_groups.push_back(num_eliminate_blocks_);
84 options_.elimination_groups.push_back(
102 eliminator.reset(SchurEliminatorBase::Create(options_));
232 LinearSolver::Options options_; member in class:ceres::internal::VisibilityBasedPreconditionerTest
239 options_.preconditioner_type = SCHUR_JACOBI;
241 new VisibilityBasedPreconditioner(*A_->block_structure(), options_));
260 options_.preconditioner_type = CLUSTER_JACOBI;
262 new VisibilityBasedPreconditioner(*A_->block_structure(), options_));
307 options_.preconditioner_type = CLUSTER_JACOBI;
309 new VisibilityBasedPreconditioner(*A_->block_structure(), options_));
[all...] |
| system_test.cc | 216 options_.max_num_iterations = 10;
220 Solver::Options* mutable_solver_options() { return &options_; }
271 Solver::Options options_; member in class:ceres::internal::PowellsFunction
322 Solver::Options* mutable_solver_options() { return &options_; }
390 options_.linear_solver_ordering = new ParameterBlockOrdering;
394 options_.linear_solver_ordering->AddElementToGroup(points + 3 * i, 0);
398 options_.linear_solver_ordering->AddElementToGroup(cameras + 9 * i, 1);
401 options_.max_num_iterations = 25;
402 options_.function_tolerance = 1e-10;
403 options_.gradient_tolerance = 1e-10
462 Solver::Options options_; member in class:ceres::internal::BundleAdjustmentProblem
[all...] |
| dense_qr_solver.cc | 46 : options_(options) {}
|
| sparse_normal_cholesky_solver.h | 86 const LinearSolver::Options options_; member in class:ceres::internal::SparseNormalCholeskySolver
|
| program_evaluator.h | 99 : options_(options),
105 CHECK_EQ(1, options_.num_threads)
139 for (int i = 0; i < options_.num_threads; ++i) {
148 #pragma omp parallel for num_threads(options_.num_threads)
237 for (int i = 0; i < options_.num_threads; ++i) {
324 Evaluator::Options options_; member in class:ceres::internal::ProgramEvaluator
|
| sparse_normal_cholesky_solver.cc | 54 : options_(options) {
85 switch (options_.sparse_linear_algebra_library) {
92 << options_.sparse_linear_algebra_library;
96 << options_.sparse_linear_algebra_library;
195 if (options_.use_block_amd) {
|
| conjugate_gradients_solver.cc | 65 : options_(options) {
116 summary.num_iterations < options_.max_num_iterations;
176 if (summary.num_iterations % options_.residual_reset_period == 0) {
|
| /external/regex-re2/re2/ |
| set.cc | 16 options_.Copy(options);
35 options_.ParseFlags());
42 if (options_.log_errors())
77 options_.ParseFlags());
85 if (options_.log_errors())
90 prog_ = Prog::CompileSet(options_, anchor_, re);
|
| set.h | 43 RE2::Options options_; member in class:re2::RE2::Set
|
| /external/chromium/base/ |
| string_tokenizer.h | 115 void set_options(int options) { options_ = options; }
128 if (quotes_.empty() && options_ == 0)
163 options_ = 0;
197 if (options_ & RETURN_DELIMS) {
247 int options_; member in class:StringTokenizerT
|
| /external/chromium/third_party/libjingle/source/talk/p2p/base/ |
| relayport.h | 69 const std::vector<OptionValue>& options() const { return options_; }
108 std::vector<OptionValue> options_; member in class:cricket::RelayPort
|
