diff options
Diffstat (limited to 'internal/ceres/schur_eliminator.cc')
| -rw-r--r-- | internal/ceres/schur_eliminator.cc | 32 |
1 files changed, 17 insertions, 15 deletions
diff --git a/internal/ceres/schur_eliminator.cc b/internal/ceres/schur_eliminator.cc index 44f5be3..31f8354 100644 --- a/internal/ceres/schur_eliminator.cc +++ b/internal/ceres/schur_eliminator.cc @@ -1,5 +1,5 @@ // Ceres Solver - A fast non-linear least squares minimizer -// Copyright 2010, 2011, 2012 Google Inc. All rights reserved. +// Copyright 2010, 2011, 2012, 2013 Google Inc. All rights reserved. // http://code.google.com/p/ceres-solver/ // // Redistribution and use in source and binary forms, with or without @@ -28,6 +28,8 @@ // // Author: sameeragarwal@google.com (Sameer Agarwal) // +// Template specialization of SchurEliminator. +// // ======================================== // THIS FILE IS AUTOGENERATED. DO NOT EDIT. // THIS FILE IS AUTOGENERATED. DO NOT EDIT. @@ -35,7 +37,7 @@ // THIS FILE IS AUTOGENERATED. DO NOT EDIT. //========================================= // -// This file is generated using generate_template_specializations.py. +// This file is generated using generate_eliminator_specializations.py. // Editing it manually is not recommended. #include "ceres/linear_solver.h" @@ -65,8 +67,8 @@ SchurEliminatorBase::Create(const LinearSolver::Options& options) { } if ((options.row_block_size == 2) && (options.e_block_size == 2) && - (options.f_block_size == Dynamic)) { - return new SchurEliminator<2, 2, Dynamic>(options); + (options.f_block_size == Eigen::Dynamic)) { + return new SchurEliminator<2, 2, Eigen::Dynamic>(options); } if ((options.row_block_size == 2) && (options.e_block_size == 3) && @@ -85,8 +87,8 @@ SchurEliminatorBase::Create(const LinearSolver::Options& options) { } if ((options.row_block_size == 2) && (options.e_block_size == 3) && - (options.f_block_size == Dynamic)) { - return new SchurEliminator<2, 3, Dynamic>(options); + (options.f_block_size == Eigen::Dynamic)) { + return new SchurEliminator<2, 3, Eigen::Dynamic>(options); } if ((options.row_block_size == 2) && (options.e_block_size == 4) && @@ -100,8 +102,8 @@ SchurEliminatorBase::Create(const LinearSolver::Options& options) { } if ((options.row_block_size == 2) && (options.e_block_size == 4) && - (options.f_block_size == Dynamic)) { - return new SchurEliminator<2, 4, Dynamic>(options); + (options.f_block_size == Eigen::Dynamic)) { + return new SchurEliminator<2, 4, Eigen::Dynamic>(options); } if ((options.row_block_size == 4) && (options.e_block_size == 4) && @@ -120,13 +122,13 @@ SchurEliminatorBase::Create(const LinearSolver::Options& options) { } if ((options.row_block_size == 4) && (options.e_block_size == 4) && - (options.f_block_size == Dynamic)) { - return new SchurEliminator<4, 4, Dynamic>(options); + (options.f_block_size == Eigen::Dynamic)) { + return new SchurEliminator<4, 4, Eigen::Dynamic>(options); } - if ((options.row_block_size == Dynamic) && - (options.e_block_size == Dynamic) && - (options.f_block_size == Dynamic)) { - return new SchurEliminator<Dynamic, Dynamic, Dynamic>(options); + if ((options.row_block_size == Eigen::Dynamic) && + (options.e_block_size == Eigen::Dynamic) && + (options.f_block_size == Eigen::Dynamic)) { + return new SchurEliminator<Eigen::Dynamic, Eigen::Dynamic, Eigen::Dynamic>(options); } #endif @@ -134,7 +136,7 @@ SchurEliminatorBase::Create(const LinearSolver::Options& options) { << options.row_block_size << "," << options.e_block_size << "," << options.f_block_size << ">"; - return new SchurEliminator<Dynamic, Dynamic, Dynamic>(options); + return new SchurEliminator<Eigen::Dynamic, Eigen::Dynamic, Eigen::Dynamic>(options); } } // namespace internal |