File: Way.h

package info (click to toggle)
osm2pgrouting 3.0.0-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 1,036 kB
  • sloc: cpp: 3,754; python: 3,105; xml: 504; sh: 61; sql: 54; ansic: 46; makefile: 18
file content (138 lines) | stat: -rw-r--r-- 4,557 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
/***************************************************************************
 *   Copyright (C) 2016 by pgRouting developers                            *
 *   project@pgrouting.org                                                 *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program 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 Public License t &or more details.                        *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/

#ifndef SRC_WAY_H_
#define SRC_WAY_H_

#include <boost/lexical_cast.hpp>
#include <vector>
#include <map>
#include <string>
#include "./osm_element.h"
#include "./Node.h"

namespace osm2pgr {


/**
  \code
  <way id="20215432" visible="true" timestamp="2008-01-09T22:35:16+00:00" user="Pferdo">
  <nd ref="213794929"/>
  <nd ref="213795470"/>
  <nd ref="213795483"/>
  <nd ref="213795493"/>
  <nd ref="213795506"/>
  <nd ref="213795517"/>
  <nd ref="213795527"/>
  <nd ref="213795541"/>
  <nd ref="213795552"/>
  <nd ref="213795561"/>
  <nd ref="213795571"/>
  <tag k="name" v="Pfnderweg"/>
  <tag k="created_by" v="JOSM"/>
  <tag k="highway" v="residential"/>
  </way>
  \endcode
  */
class Way : public Element {
 public:
     Way() = default;
     ~Way() {};

     /**
      *  @param atts attributes read py the parser
      */
     explicit Way(const char **atts);
     Tag add_tag(const Tag &tag);
     void add_node(Node* node);
     void add_node(int64_t node_id);

     std::vector<Node*>& nodeRefs() {return m_NodeRefs;}
     const std::vector<Node*> nodeRefs() const {return m_NodeRefs;}


     std::string members_str() const;

 public:
     inline void maxspeed_forward(double p_max) {m_maxspeed_forward = p_max;}
     inline void maxspeed_backward(double p_max) {m_maxspeed_backward = p_max;}

     inline std::string name() const {return has_tag("name")? get_tag("name") : "";}


     std::string oneWay() const;
     std::string oneWayType_str() const;
     inline bool is_oneway() const { return m_oneWay == "YES";}
     inline bool is_reversed() const { return m_oneWay == "REVERSED";}

     inline double maxspeed_forward() const {return m_maxspeed_forward;}
     inline double maxspeed_backward() const { return m_maxspeed_backward;}

     std::string get_geometry() const;
     std::string length_str() const;


     inline std::string maxspeed_forward_str() const {
         return boost::lexical_cast<std::string>(m_maxspeed_forward);
     }
     inline std::string maxspeed_backward_str() const {
         return boost::lexical_cast<std::string>(m_maxspeed_backward);
     }


     //! splits the way
     std::vector<std::vector<Node*>> split_me();
     std::string geometry_str(const std::vector<Node*> &) const;
     std::string length_str(const std::vector<Node*> &) const;

     /**
      * to insert the relations tags
      */
     void insert_tags(const std::map<std::string, std::string> &tags);

#ifndef NDEBUG
     friend
     std::ostream& operator<<(std::ostream &, const Way &);
#endif


 private:
     bool is_number(const std::string& s) const;
     double get_kph(const std::string &value) const;
     void max_speed(const Tag& tag);
     void oneWay(const Tag& tag);
     void implied_oneWay(const Tag& tag);


 private:
     /** references to node that its on the file */
     std::vector<Node*> m_NodeRefs;

     /** node identifiers found as part of the way */
     std::vector<int64_t> m_node_ids;

     double m_maxspeed_forward;
     double m_maxspeed_backward;
     std::string m_oneWay;
};


}  // end namespace osm2pgr
#endif  // SRC_WAY_H_