all: remove useless namespace bp::

include/eigenpy/angle-axis.hpp

@@ -9,8 +9,6 @@
 
 namespace eigenpy {
 
-namespace bp = boost::python;
-
 template <typename AngleAxis>
 class AngleAxisVisitor;
 

include/eigenpy/copyable.hpp

@@ -9,8 +9,6 @@
 
 namespace eigenpy {
 
-namespace bp = boost::python;
-
 ///
 /// \brief Add the Python method copy to allow a copy of this by calling the
 /// copy constructor.

include/eigenpy/decompositions/EigenSolver.hpp

@@ -23,7 +23,6 @@ struct EigenSolverVisitor
 
   template <class PyClass>
   void visit(PyClass& cl) const {
-    namespace bp = boost::python;
     cl.def(bp::init<>("Default constructor"))
         .def(bp::init<Eigen::DenseIndex>(
             bp::arg("size"), "Default constructor with memory preallocation"))
@@ -76,7 +75,6 @@ struct EigenSolverVisitor
   }
 
   static void expose(const std::string& name) {
-    namespace bp = boost::python;
     bp::class_<Solver>(name.c_str(), bp::no_init).def(EigenSolverVisitor());
   }
 

include/eigenpy/decompositions/LDLT.hpp

@@ -28,7 +28,6 @@ struct LDLTSolverVisitor
 
   template <class PyClass>
   void visit(PyClass &cl) const {
-    namespace bp = boost::python;
     cl.def(bp::init<>(bp::arg("self"), "Default constructor"))
         .def(bp::init<Eigen::DenseIndex>(
             bp::args("self", "size"),
@@ -106,7 +105,6 @@ struct LDLTSolverVisitor
   }
 
   static void expose(const std::string &name) {
-    namespace bp = boost::python;
     bp::class_<Solver>(
         name.c_str(),
         "Robust Cholesky decomposition of a matrix with pivoting.\n\n"

include/eigenpy/decompositions/LLT.hpp

@@ -28,7 +28,6 @@ struct LLTSolverVisitor
 
   template <class PyClass>
   void visit(PyClass &cl) const {
-    namespace bp = boost::python;
     cl.def(bp::init<>(bp::arg("self"), "Default constructor"))
         .def(bp::init<Eigen::DenseIndex>(
             bp::args("self", "size"),
@@ -99,7 +98,6 @@ struct LLTSolverVisitor
   }
 
   static void expose(const std::string &name) {
-    namespace bp = boost::python;
     bp::class_<Solver>(
         name.c_str(),
         "Standard Cholesky decomposition (LL^T) of a matrix and associated "

include/eigenpy/decompositions/SelfAdjointEigenSolver.hpp

@@ -24,7 +24,6 @@ struct SelfAdjointEigenSolverVisitor
 
   template <class PyClass>
   void visit(PyClass& cl) const {
-    namespace bp = boost::python;
     cl.def(bp::init<>(bp::arg("self"), "Default constructor"))
         .def(bp::init<Eigen::DenseIndex>(
             bp::args("self", "size"),
@@ -84,7 +83,6 @@ struct SelfAdjointEigenSolverVisitor
   }
 
   static void expose(const std::string& name) {
-    namespace bp = boost::python;
     bp::class_<Solver>(name.c_str(), bp::no_init)
         .def(SelfAdjointEigenSolverVisitor());
   }

include/eigenpy/decompositions/minres.hpp

@@ -28,7 +28,6 @@ struct IterativeSolverBaseVisitor
 
   template <class PyClass>
   void visit(PyClass& cl) const {
-    namespace bp = boost::python;
     cl.def("analyzePattern",
            (Solver & (Solver::*)(const Eigen::EigenBase<MatrixType>& matrix)) &
                Solver::analyzePattern,
@@ -137,7 +136,6 @@ struct MINRESSolverVisitor
 
   template <class PyClass>
   void visit(PyClass& cl) const {
-    namespace bp = boost::python;
     cl.def(bp::init<>(bp::arg("self"), "Default constructor"))
         .def(bp::init<MatrixType>(
             bp::args("self", "matrix"),
@@ -155,7 +153,6 @@ struct MINRESSolverVisitor
   }
 
   static void expose(const std::string& name) {
-    namespace bp = boost::python;
     bp::class_<Solver, boost::noncopyable>(
         name.c_str(),
         "A minimal residual solver for sparse symmetric problems.\n"

include/eigenpy/eigen-to-python.hpp

@@ -59,7 +59,6 @@ struct to_python_indirect<
 }  // namespace boost
 
 namespace eigenpy {
-namespace bp = boost::python;
 
 template <typename MatType, typename _Scalar>
 struct EigenToPy {

include/eigenpy/fwd.hpp

@@ -70,6 +70,12 @@
 #include <boost/python.hpp>
 #include <boost/python/scope.hpp>
 
+namespace eigenpy {
+
+namespace bp = boost::python;
+
+}
+
 #define NO_IMPORT_ARRAY
 #include "eigenpy/numpy.hpp"
 #undef NO_IMPORT_ARRAY
@@ -91,8 +97,6 @@
 
 #define EIGENPY_UNUSED_VARIABLE(var) (void)(var)
 
-#include "eigenpy/expose.hpp"
-
 #ifdef EIGENPY_WITH_CXX11_SUPPORT
 #include <memory>
 #define EIGENPY_SHARED_PTR_HOLDER_TYPE(T) ::std::shared_ptr<T>
@@ -113,5 +117,6 @@ struct EigenFromPy;
 }  // namespace eigenpy
 
 #include "eigenpy/alignment.hpp"
+#include "eigenpy/expose.hpp"
 
 #endif  // ifndef __eigenpy_fwd_hpp__

include/eigenpy/geometry-conversion.hpp

@@ -10,8 +10,6 @@
 
 namespace eigenpy {
 
-namespace bp = boost::python;
-
 template <typename Scalar, int Options = 0>
 struct EulerAnglesConvertor {
   typedef typename Eigen::Matrix<Scalar, 3, 1, Options> Vector3;

include/eigenpy/numpy-type.hpp

@@ -14,7 +14,6 @@
 #include "eigenpy/scalar-conversion.hpp"
 
 namespace eigenpy {
-namespace bp = boost::python;
 
 template <typename Scalar>
 bool np_type_is_convertible_into_scalar(const int np_type) {

include/eigenpy/quaternion.hpp

@@ -65,8 +65,6 @@ class ExceptionIndex : public Exception {
   }
 };
 
-namespace bp = boost::python;
-
 template <typename QuaternionDerived>
 class QuaternionVisitor;
 

include/eigenpy/register.hpp

@@ -31,7 +31,6 @@ struct EIGENPY_DLLAPI Register {
 
   template <typename Scalar>
   static PyTypeObject *getPyType() {
-    namespace bp = boost::python;
     if (!isNumpyNativeType<Scalar>()) {
       const PyTypeObject *const_py_type_ptr =
           bp::converter::registered_pytype<Scalar>::get_pytype();
@@ -53,7 +52,6 @@ struct EIGENPY_DLLAPI Register {
 
   template <typename Scalar>
   static PyArray_Descr *getPyArrayDescr() {
-    namespace bp = boost::python;
     if (!isNumpyNativeType<Scalar>()) {
       return getPyArrayDescr(getPyType<Scalar>());
     } else {

include/eigenpy/registration.hpp

@@ -3,12 +3,13 @@
  * Copyright 2018-2019, INRIA
  */
 
-#include "eigenpy/fwd.hpp"
-
 #ifndef __eigenpy_registration_hpp__
 #define __eigenpy_registration_hpp__
 
+#include "eigenpy/fwd.hpp"
+
 namespace eigenpy {
+
 ///
 /// \brief Check at runtime the registration of the type T inside the boost
 /// python registry.
@@ -19,8 +20,6 @@ namespace eigenpy {
 ///
 template <typename T>
 inline bool check_registration() {
-  namespace bp = boost::python;
-
   const bp::type_info info = bp::type_id<T>();
   const bp::converter::registration* reg = bp::converter::registry::query(info);
   if (reg == NULL)
@@ -40,8 +39,6 @@ inline bool check_registration() {
 ///
 template <typename T>
 inline bool register_symbolic_link_to_registered_type() {
-  namespace bp = boost::python;
-
   if (eigenpy::check_registration<T>()) {
     const bp::type_info info = bp::type_id<T>();
     const bp::converter::registration* reg =

include/eigenpy/solvers/BFGSPreconditioners.hpp

@@ -24,8 +24,6 @@
 
 namespace eigenpy {
 
-namespace bp = boost::python;
-
 template <typename Preconditioner>
 struct BFGSPreconditionerBaseVisitor
     : public bp::def_visitor<BFGSPreconditionerBaseVisitor<Preconditioner> > {

include/eigenpy/solvers/BasicPreconditioners.hpp

@@ -23,8 +23,6 @@
 
 namespace eigenpy {
 
-namespace bp = boost::python;
-
 template <typename Preconditioner>
 struct PreconditionerBaseVisitor
     : public bp::def_visitor<PreconditionerBaseVisitor<Preconditioner> > {

include/eigenpy/solvers/ConjugateGradient.hpp

@@ -24,8 +24,6 @@
 
 namespace eigenpy {
 
-namespace bp = boost::python;
-
 template <typename ConjugateGradient>
 struct ConjugateGradientVisitor
     : public boost::python::def_visitor<

include/eigenpy/solvers/IterativeSolverBase.hpp

@@ -22,8 +22,6 @@
 
 namespace eigenpy {
 
-namespace bp = boost::python;
-
 template <typename IterativeSolver>
 struct IterativeSolverVisitor : public boost::python::def_visitor<
                                     IterativeSolverVisitor<IterativeSolver> > {

include/eigenpy/solvers/LeastSquaresConjugateGradient.hpp

@@ -24,8 +24,6 @@
 
 namespace eigenpy {
 
-namespace bp = boost::python;
-
 template <typename LeastSquaresConjugateGradient>
 struct LeastSquaresConjugateGradientVisitor
     : public boost::python::def_visitor<LeastSquaresConjugateGradientVisitor<

include/eigenpy/solvers/SparseSolverBase.hpp

@@ -21,8 +21,6 @@
 
 namespace eigenpy {
 
-namespace bp = boost::python;
-
 template <typename SparseSolver>
 struct SparseSolverVisitor
     : public bp::def_visitor<SparseSolverVisitor<SparseSolver> > {