.. _program_listing_file_include_eigenpy_solvers_LeastSquaresConjugateGradient.hpp:

Program Listing for File LeastSquaresConjugateGradient.hpp
==========================================================

|exhale_lsh| :ref:`Return to documentation for file <file_include_eigenpy_solvers_LeastSquaresConjugateGradient.hpp>` (``include/eigenpy/solvers/LeastSquaresConjugateGradient.hpp``)

.. |exhale_lsh| unicode:: U+021B0 .. UPWARDS ARROW WITH TIP LEFTWARDS

.. code-block:: cpp

   /*
    * Copyright 2017-2018 CNRS
    */
   
   #ifndef __eigenpy_least_square_conjugate_gradient_hpp__
   #define __eigenpy_least_square_conjugate_gradient_hpp__
   
   #include <Eigen/IterativeLinearSolvers>
   
   #include "eigenpy/fwd.hpp"
   #include "eigenpy/solvers/IterativeSolverBase.hpp"
   
   namespace eigenpy {
   
   template <typename LeastSquaresConjugateGradient>
   struct LeastSquaresConjugateGradientVisitor
       : public boost::python::def_visitor<
             LeastSquaresConjugateGradientVisitor<LeastSquaresConjugateGradient>> {
     typedef Eigen::MatrixXd MatrixType;
   
     template <class PyClass>
     void visit(PyClass& cl) const {
       cl.def(bp::init<>("Default constructor"))
           .def(bp::init<MatrixType>(
               bp::arg("A"),
               "Initialize the solver with matrix A for further || Ax - b || "
               "solving.\n"
               "This constructor is a shortcut for the default constructor "
               "followed by a call to compute()."));
     }
   
     static void expose() {
       bp::class_<LeastSquaresConjugateGradient, boost::noncopyable>(
           "LeastSquaresConjugateGradient", bp::no_init)
           .def(IterativeSolverVisitor<LeastSquaresConjugateGradient>())
           .def(LeastSquaresConjugateGradientVisitor<
                LeastSquaresConjugateGradient>())
           .def(IdVisitor<LeastSquaresConjugateGradient>());
     }
   };
   
   }  // namespace eigenpy
   
   #endif  // ifndef __eigenpy_least_square_conjugate_gradient_hpp__