hpp-core  6.0.0
Implement basic classes for canonical path planning for kinematic chains.
node.hh
Go to the documentation of this file.
1 //
2 // Copyright (c) 2014 CNRS
3 // Authors: Florent Lamiraux
4 //
5 
6 // Redistribution and use in source and binary forms, with or without
7 // modification, are permitted provided that the following conditions are
8 // met:
9 //
10 // 1. Redistributions of source code must retain the above copyright
11 // notice, this list of conditions and the following disclaimer.
12 //
13 // 2. Redistributions in binary form must reproduce the above copyright
14 // notice, this list of conditions and the following disclaimer in the
15 // documentation and/or other materials provided with the distribution.
16 //
17 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 // HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
28 // DAMAGE.
29 
30 #ifndef HPP_CORE_NODE_HH
31 #define HPP_CORE_NODE_HH
32 
33 #include <hpp/core/config.hh>
34 #include <hpp/core/fwd.hh>
35 #include <hpp/pinocchio/fwd.hh>
36 #include <hpp/util/serialization-fwd.hh>
37 
38 namespace hpp {
39 namespace core {
42 
47  public:
48  typedef std::list<EdgePtr_t> Edges_t;
53  Node(ConfigurationIn_t configuration);
57  Node(ConfigurationIn_t configuration,
58  ConnectedComponentPtr_t connectedComponent);
59  void addOutEdge(EdgePtr_t edge);
60  void addInEdge(EdgePtr_t edge);
65  const Edges_t& outEdges() const;
67  const Edges_t& inEdges() const;
71  bool isOutNeighbor(const NodePtr_t& n) const;
75  bool isInNeighbor(const NodePtr_t& n) const;
76 
79  std::ostream& print(std::ostream& os) const;
80 
81  virtual ~Node() {};
82 
83  protected:
84  Node() {}
85 
86  private:
87  Configuration_t configuration_;
88  Edges_t outEdges_;
89  Edges_t inEdges_;
90  ConnectedComponentPtr_t connectedComponent_;
91 
92  HPP_SERIALIZABLE();
93 }; // class Node
94 std::ostream& operator<<(std::ostream& os, const Node& n);
96 } // namespace core
97 } // namespace hpp
98 #endif // HPP_CORE_NODE_HH
Definition: edge.hh:46
Definition: node.hh:46
const Edges_t & outEdges() const
Access to outEdges.
void addInEdge(EdgePtr_t edge)
const Configuration_t & configuration() const
void addOutEdge(EdgePtr_t edge)
std::ostream & print(std::ostream &os) const
Print node in a stream.
std::list< EdgePtr_t > Edges_t
Definition: node.hh:48
Node(ConfigurationIn_t configuration)
bool isInNeighbor(const NodePtr_t &n) const
Node()
Definition: node.hh:84
virtual ~Node()
Definition: node.hh:81
void connectedComponent(const ConnectedComponentPtr_t &cc)
Store the connected component the node belongs to.
bool isOutNeighbor(const NodePtr_t &n) const
const Edges_t & inEdges() const
Access to inEdges.
ConnectedComponentPtr_t connectedComponent() const
Node(ConfigurationIn_t configuration, ConnectedComponentPtr_t connectedComponent)
#define HPP_CORE_DLLAPI
Definition: config.hh:88
std::ostream & operator<<(std::ostream &os, const Constraint &constraint)
Definition: constraint.hh:99
std::list< Edge * > Edges_t
Definition: fwd.hh:145
pinocchio::ConfigurationIn_t ConfigurationIn_t
Definition: fwd.hh:108
shared_ptr< ConnectedComponent > ConnectedComponentPtr_t
Definition: fwd.hh:117
pinocchio::Configuration_t Configuration_t
Definition: fwd.hh:107
Definition: bi-rrt-planner.hh:35