76 std::map<std::string, std::size_t> counter;
78 for (
const auto& tag :
way->tags()) {
79 std::string kv{tag.key()};
81 kv.append(tag.value());
86 const std::size_t num_ways = ways.size();
87 for (
const auto& t_c : counter) {
89 std::cerr <<
" tag " << t_c.first <<
" is used " << t_c.second <<
" times in " << num_ways <<
" ways\n";
91 if (t_c.second == num_ways) {
92 const std::size_t len = std::strlen(t_c.first.c_str());
93 tl_builder.
add_tag(t_c.first.c_str(), t_c.first.c_str() + len + 1);
179 set_num_members(members.size());
183 const bool area_okay = create_rings();
184 if (area_okay || config().create_empty_areas) {
188 add_rings_to_area(builder);
193 config().problem_reporter->report_way(*
way);
197 return area_okay || config().create_empty_areas;
214 if (!config().create_way_polygons) {
218 if (
way.tags().has_tag(
"area",
"no")) {
222 if (config().problem_reporter) {
224 config().problem_reporter->set_nodes(
way.nodes().size());
228 if (
way.nodes().size() < 2) {
229 ++stats().short_ways;
233 if (!
way.ends_have_same_id()) {
234 ++stats().duplicate_nodes;
235 if (config().problem_reporter) {
236 config().problem_reporter->report_duplicate_node(
way.nodes().front().ref(),
way.nodes().back().ref(),
way.nodes().front().location());
241 stats().invalid_locations = segment_list().extract_segments_from_way(config().problem_reporter,
242 stats().duplicate_nodes,
244 if (!config().ignore_invalid_locations && stats().invalid_locations > 0) {
248 if (config().debug_level > 0) {
249 std::cerr <<
"\nAssembling way " <<
way.id() <<
" containing " << segment_list().size() <<
" nodes\n";
258 out_buffer.rollback();
262 std::cerr <<
"Done: " << stats() <<
"\n";
276 assert(
relation.members().size() >= members.size());
278 if (config().problem_reporter) {
283 ++stats().no_way_in_mp_relation;
287 ++stats().from_relations;
288 stats().invalid_locations = segment_list().extract_segments_from_ways(config().problem_reporter,
289 stats().duplicate_nodes,
290 stats().duplicate_ways,
293 if (!config().ignore_invalid_locations && stats().invalid_locations > 0) {
296 stats().member_ways = members.size();
298 if (stats().member_ways == 1) {
299 ++stats().single_way_in_mp_relation;
302 if (config().debug_level > 0) {
303 std::cerr <<
"\nAssembling relation " <<
relation.id() <<
" containing " << members.size() <<
" way members with " << segment_list().size() <<
" nodes\n";
306 const std::size_t area_offset = out_buffer.committed();
312 if ((config().create_new_style_polygons && stats().no_tags_on_relation == 0) ||
313 (config().create_old_style_polygons && stats().no_tags_on_relation != 0)) {
316 out_buffer.rollback();
319 out_buffer.rollback();
328 std::vector<const osmium::Way*> ways_that_should_be_areas;
329 if (stats().wrong_role == 0) {
331 if (!std::strcmp(member.
role(),
"inner")) {
332 if (!way.nodes().empty() && way.is_closed() && !way.tags().empty()) {
333 const auto d = std::count_if(way.tags().cbegin(), way.tags().cend(), std::cref(filter()));
335 const osmium::tags::KeyFilter::iterator way_fi_begin(std::cref(filter()), way.tags().cbegin(), way.tags().cend());
336 const osmium::tags::KeyFilter::iterator way_fi_end(std::cref(filter()), way.tags().cend(), way.tags().cend());
337 const osmium::tags::KeyFilter::iterator area_fi_begin(std::cref(filter()), area_tags.cbegin(), area_tags.cend());
338 const osmium::tags::KeyFilter::iterator area_fi_end(std::cref(filter()), area_tags.cend(), area_tags.cend());
339#ifdef __cpp_lib_robust_nonmodifying_seq_ops
340 if (!std::equal(way_fi_begin, way_fi_end, area_fi_begin, area_fi_end)) {
342 if (d != std::distance(area_fi_begin, area_fi_end) || !std::equal(way_fi_begin, way_fi_end, area_fi_begin)) {
344 ways_that_should_be_areas.push_back(&way);
346 ++stats().inner_with_same_tags;
347 if (config().problem_reporter) {
348 config().problem_reporter->report_inner_with_same_tags(way);
358 std::cerr <<
"Done: " << stats() <<
"\n";
364 if (!assembler(*
way, out_buffer)) {
367 stats() += assembler.stats();