constraint-inequality.hpp

Go to the documentation of this file.

//
// Copyright (c) 2018 CNRS
//
// This file is part of tsid
// tsid is free software: you can redistribute it
// and/or modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation, either version
// 3 of the License, or (at your option) any later version.
// tsid is distributed in the hope that it will be
// useful, but WITHOUT ANY WARRANTY; without even the implied warranty
// of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// General Lesser Public License for more details. You should have
// received a copy of the GNU Lesser General Public License along with
// tsid If not, see
// <http://www.gnu.org/licenses/>.
//
#ifndef __tsid_python_constriant_inequality_hpp__
#define __tsid_python_constriant_inequality_hpp__

#include "tsid/bindings/python/fwd.hpp"

#include "tsid/math/constraint-inequality.hpp"

namespace tsid {
namespace python {
namespace bp = boost::python;

template <typename ConstraintInequality>
struct ConstraintIneqPythonVisitor
 : public boost::python::def_visitor<
 ConstraintIneqPythonVisitor<ConstraintInequality> > {
 template <class PyClass>

 void visit(PyClass& cl) const {
 cl.def(bp::init<std::string>((bp::arg("name")),
 "Default constructor with name."))
 .def(bp::init<std::string, unsigned int, unsigned int>(
 (bp::arg("name"), bp::arg("row"), bp::arg("col")),
 "Default constructor with name and size."))
 .def(bp::init<std::string, Eigen::MatrixXd, Eigen::VectorXd,
 Eigen::VectorXd>(
 (bp::arg("name"), bp::arg("A"), bp::arg("lb"), bp::arg("ub")),
 "Default constructor with name and constraint."))

 .add_property("rows", &ConstraintInequality::rows)
 .add_property("cols", &ConstraintInequality::cols)
 .def("resize", &ConstraintInequality::resize,
 (bp::arg("r"), bp::arg("c")), "Resize constraint size.")

 .add_property("isEquality", &ConstraintInequality::isEquality)
 .add_property("isInequality", &ConstraintInequality::isInequality)
 .add_property("isBound", &ConstraintInequality::isBound)

 .add_property("matrix", &ConstraintIneqPythonVisitor::matrix)
 .add_property("vector", &ConstraintIneqPythonVisitor::vector)
 .add_property("lowerBound", &ConstraintIneqPythonVisitor::lowerBound)
 .add_property("upperBound", &ConstraintIneqPythonVisitor::upperBound)

 .def("setMatrix",
 (bool (ConstraintInequality::*)(
 const Eigen::Ref<
 const Eigen::MatrixXd>))&ConstraintInequality::setMatrix,
 bp::args("matrix"), "Set Matrix")
 .def("setVector",
 (bool (ConstraintInequality::*)(
 const Eigen::Ref<
 const Eigen::VectorXd>))&ConstraintInequality::setVector,
 bp::args("vector"), "Set Vector")
 .def(
 "setLowerBound",
 (bool (ConstraintInequality::*)(
 const Eigen::Ref<const Eigen::VectorXd>))&ConstraintInequality::
 setLowerBound,
 bp::args("lb"), "Set LowerBound")
 .def(
 "setUpperBound",
 (bool (ConstraintInequality::*)(
 const Eigen::Ref<const Eigen::VectorXd>))&ConstraintInequality::
 setUpperBound,
 bp::args("ub"), "Set UpperBound");
 }
 static Eigen::MatrixXd matrix(const ConstraintInequality& self) {
 return self.matrix();
 }
 static Eigen::VectorXd vector(const ConstraintInequality& self) {
 return self.vector();
 }
 static Eigen::VectorXd lowerBound(const ConstraintInequality& self) {
 return self.lowerBound();
 }
 static Eigen::VectorXd upperBound(const ConstraintInequality& self) {
 return self.upperBound();
 }

 static void expose(const std::string& class_name) {
 std::string doc = "Constraint Inequality info.";
 bp::class_<ConstraintInequality>(class_name.c_str(), doc.c_str(),
 bp::no_init)
 .def(ConstraintIneqPythonVisitor<ConstraintInequality>());
 }
};
} // namespace python
} // namespace tsid

#endif // ifndef __tsid_python_constriant_inequality_hpp__