/usr/include/osmium/osm/way_node_list.hpp is in libosmium-dev 0.0~20140910-9a069af-1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 | #ifndef OSMIUM_OSM_WAY_NODE_LIST_HPP
#define OSMIUM_OSM_WAY_NODE_LIST_HPP
/*
Copyright 2012 Jochen Topf <jochen@topf.org> and others (see README).
This file is part of Osmium (https://github.com/joto/osmium).
Osmium is free software: you can redistribute it and/or modify it under the
terms of the GNU Lesser General Public License or (at your option) the GNU
General Public License as published by the Free Software Foundation, either
version 3 of the Licenses, or (at your option) any later version.
Osmium 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 Lesser General Public License and the GNU
General Public License for more details.
You should have received a copy of the Licenses along with Osmium. If not, see
<http://www.gnu.org/licenses/>.
*/
#include <vector>
#include <osmium/osm/way_node.hpp>
namespace Osmium {
namespace OSM {
class WayNodeList {
public:
/**
* If a WayNodeList object is created and the number of nodes is
* not given to the constructor, space for this many nodes is
* reserved. 99.9% of all ways have 500 or less nodes.
*/
static const int default_size = 500;
WayNodeList(unsigned int size=default_size) :
m_list() {
m_list.reserve(size);
}
osm_sequence_id_t size() const {
return m_list.size();
}
bool empty() const {
return m_list.empty();
}
void clear() {
m_list.clear();
}
typedef std::vector<WayNode>::iterator iterator;
typedef std::vector<WayNode>::const_iterator const_iterator;
typedef std::vector<WayNode>::reverse_iterator reverse_iterator;
typedef std::vector<WayNode>::const_reverse_iterator const_reverse_iterator;
iterator begin() {
return m_list.begin();
}
const_iterator begin() const {
return m_list.begin();
}
iterator end() {
return m_list.end();
}
const_iterator end() const {
return m_list.end();
}
reverse_iterator rbegin() {
return m_list.rbegin();
}
const_reverse_iterator rbegin() const {
return m_list.rbegin();
}
reverse_iterator rend() {
return m_list.rend();
}
const_reverse_iterator rend() const {
return m_list.rend();
}
template <class TInputIterator>
void insert(iterator position, TInputIterator first, TInputIterator last) {
m_list.insert(position, first, last);
}
WayNode& operator[](int i) {
return m_list[i];
}
const WayNode& operator[](int i) const {
return m_list[i];
}
const WayNode& front() const {
return m_list.front();
}
WayNode& front() {
return m_list.front();
}
const WayNode& back() const {
return m_list.back();
}
WayNode& back() {
return m_list.back();
}
bool is_closed() const {
return m_list.front().ref() == m_list.back().ref();
}
bool has_position() const {
if (m_list.empty()) {
return false;
} else {
return m_list.back().has_position();
}
}
WayNodeList& push_back(const WayNode& way_node) {
m_list.push_back(way_node);
return *this;
}
WayNodeList& add(const WayNode& way_node) {
m_list.push_back(way_node);
return *this;
}
WayNodeList& push_back(osm_object_id_t ref) {
m_list.push_back(WayNode(ref));
return *this;
}
WayNodeList& add(osm_object_id_t ref) {
m_list.push_back(WayNode(ref));
return *this;
}
private:
std::vector<WayNode> m_list;
}; // class WayNodeList
} // namespace OSM
} // namespace Osmium
#endif // OSMIUM_OSM_WAY_NODE_LIST_HPP
|