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
|
/*
#-----------------------------------------------------------------------------
# osm2pgsql - converts planet.osm file into PostgreSQL
# compatible output suitable to be rendered by mapnik
#-----------------------------------------------------------------------------
#
# 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 for 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
#-----------------------------------------------------------------------------
*/
#ifndef PARSE_OSMIUM_H
#define PARSE_OSMIUM_H
#include "config.h"
#include <boost/optional.hpp>
#include <ctime>
#include "osmtypes.hpp"
#include <osmium/osm/box.hpp>
#include <osmium/fwd.hpp>
#include <osmium/handler.hpp>
class reprojection;
class osmdata_t;
class parse_stats_t
{
struct Counter {
osmid_t count = 0;
osmid_t max = 0;
time_t start = 0;
bool add(osmid_t id, int frac)
{
if (id > max) {
max = id;
}
if (count == 0) {
time(&start);
}
count++;
return (count % frac == 0);
}
Counter& operator+=(const Counter& rhs)
{
count += rhs.count;
if (rhs.max > max) {
max = rhs.max;
}
if (start == 0) {
start = rhs.start;
}
return *this;
}
};
public:
void update(const parse_stats_t &other);
void print_summary() const;
void print_status() const;
inline void add_node(osmid_t id)
{
if (node.add(id, 10000)) {
print_status();
}
}
inline void add_way(osmid_t id)
{
if (way.add(id, 1000)) {
print_status();
}
}
inline void add_rel(osmid_t id)
{
if (rel.add(id, 10)) {
print_status();
}
}
private:
Counter node, way, rel;
};
class parse_osmium_t: public osmium::handler::Handler
{
public:
parse_osmium_t(bool extra_attrs, const boost::optional<std::string> &bbox,
const reprojection *proj, bool do_append, osmdata_t *osmdata);
void stream_file(const std::string &filename, const std::string &fmt);
void node(osmium::Node& node);
void way(osmium::Way& way);
void relation(osmium::Relation& rel);
parse_stats_t const &stats() const
{
return m_stats;
}
private:
void convert_tags(const osmium::OSMObject &obj);
void convert_nodes(const osmium::NodeRefList &in_nodes);
void convert_members(const osmium::RelationMemberList &in_rels);
osmium::Box parse_bbox(const boost::optional<std::string> &bbox);
osmdata_t *m_data;
bool m_append;
boost::optional<osmium::Box> m_bbox;
bool m_attributes;
const reprojection *m_proj;
parse_stats_t m_stats;
/* Since {node,way} elements are not nested we can guarantee that
elements are parsed sequentially and can therefore be cached.
*/
taglist_t tags;
idlist_t nds;
memberlist_t members;
};
#endif
|
