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 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421
|
#include <boost/algorithm/string/predicate.hpp>
#include <cstdlib>
#include <cstring>
#include "options.hpp"
#include "taginfo_impl.hpp"
#include "tagtransform-c.hpp"
#include "wildcmp.hpp"
namespace {
static const struct
{
int offset;
const char *highway;
int roads;
} layers[] = {{1, "proposed", 0}, {2, "construction", 0},
{10, "steps", 0}, {10, "cycleway", 0},
{10, "bridleway", 0}, {10, "footway", 0},
{10, "path", 0}, {11, "track", 0},
{15, "service", 0},
{24, "tertiary_link", 0}, {25, "secondary_link", 1},
{27, "primary_link", 1}, {28, "trunk_link", 1},
{29, "motorway_link", 1},
{30, "raceway", 0}, {31, "pedestrian", 0},
{32, "living_street", 0}, {33, "road", 0},
{33, "unclassified", 0}, {33, "residential", 0},
{34, "tertiary", 0}, {36, "secondary", 1},
{37, "primary", 1}, {38, "trunk", 1},
{39, "motorway", 1}};
static const unsigned int nLayers = (sizeof(layers) / sizeof(*layers));
void add_z_order(taglist_t &tags, int *roads)
{
const std::string *layer = tags.get("layer");
const std::string *highway = tags.get("highway");
bool bridge = tags.get_bool("bridge", false);
bool tunnel = tags.get_bool("tunnel", false);
const std::string *railway = tags.get("railway");
const std::string *boundary = tags.get("boundary");
int z_order = 0;
int l = layer ? (int)strtol(layer->c_str(), NULL, 10) : 0;
z_order = 100 * l;
*roads = 0;
if (highway) {
for (unsigned i = 0; i < nLayers; i++) {
if (!strcmp(layers[i].highway, highway->c_str())) {
z_order += layers[i].offset;
*roads = layers[i].roads;
break;
}
}
}
if (railway && !railway->empty()) {
z_order += 35;
*roads = 1;
}
/* Administrative boundaries are rendered at low zooms so we prefer to use the roads table */
if (boundary && *boundary == "administrative")
*roads = 1;
if (bridge)
z_order += 100;
if (tunnel)
z_order -= 100;
char z[13];
snprintf(z, sizeof(z), "%d", z_order);
tags.push_back(tag_t("z_order", z));
}
} // anonymous namespace
c_tagtransform_t::c_tagtransform_t(options_t const *options)
: m_options(options)
{
}
bool c_tagtransform_t::check_key(std::vector<taginfo> const &infos,
char const *k, bool *filter, int *flags,
bool strict)
{
//go through the actual tags found on the item and keep the ones in the export list
size_t i = 0;
for (; i < infos.size(); i++) {
const taginfo &info = infos[i];
if (info.flags & FLAG_DELETE) {
if (wildMatch(info.name.c_str(), k)) {
return false;
}
} else if (strcmp(info.name.c_str(), k) == 0) {
*filter = false;
*flags |= info.flags;
return true;
}
}
// if we didn't find any tags that we wanted to export
// and we aren't strictly adhering to the list
if (!strict) {
if (m_options->hstore_mode != HSTORE_NONE) {
/* ... but if hstore_match_only is set then don't take this
as a reason for keeping the object */
if (!m_options->hstore_match_only)
*filter = false;
/* with hstore, copy all tags... */
return true;
} else if (m_options->hstore_columns.size() > 0) {
/* does this column match any of the hstore column prefixes? */
size_t j = 0;
for (; j < m_options->hstore_columns.size(); ++j) {
if (boost::starts_with(k, m_options->hstore_columns[j])) {
/* ... but if hstore_match_only is set then don't take this
as a reason for keeping the object */
if (!m_options->hstore_match_only) {
*filter = false;
}
return true;
}
}
}
}
return false;
}
bool c_tagtransform_t::filter_tags(osmium::OSMObject const &o, int *polygon,
int *roads, export_list const &exlist,
taglist_t &out_tags, bool strict)
{
//assume we dont like this set of tags
bool filter = true;
int flags = 0;
int add_area_tag = 0;
auto export_type = o.type();
if (o.type() == osmium::item_type::relation) {
export_type = osmium::item_type::way;
}
const std::vector<taginfo> &infos = exlist.get(export_type);
/* We used to only go far enough to determine if it's a polygon or not,
but now we go through and filter stuff we don't need
pop each tag off and keep it in the temp list if we like it */
for (auto const &item : o.tags()) {
char const *k = item.key();
char const *v = item.value();
//if we want to do more than the export list says
if (!strict) {
if (o.type() == osmium::item_type::relation &&
strcmp("type", k) == 0) {
out_tags.emplace_back(k, v);
filter = false;
continue;
}
/* Allow named islands to appear as polygons */
if (strcmp("natural", k) == 0 && strcmp("coastline", v) == 0) {
add_area_tag = 1;
/* Discard natural=coastline tags (we render these from a shapefile instead) */
if (!m_options->keep_coastlines) {
continue;
}
}
}
//go through the actual tags found on the item and keep the ones in the export list
if (check_key(infos, k, &filter, &flags, strict)) {
out_tags.emplace_back(k, v);
}
}
if (m_options->extra_attributes && o.version() > 0) {
out_tags.add_attributes(o);
}
if (polygon) {
if (add_area_tag) {
/* If we need to force this as a polygon, append an area tag */
out_tags.push_dedupe(tag_t("area", "yes"));
*polygon = 1;
} else {
auto const *area = o.tags()["area"];
if (area)
*polygon = taglist_t::value_to_bool(area, flags & FLAG_POLYGON);
else
*polygon = flags & FLAG_POLYGON;
}
}
if (roads && !filter && (o.type() == osmium::item_type::way)) {
add_z_order(out_tags, roads);
}
return filter;
}
bool c_tagtransform_t::filter_rel_member_tags(
taglist_t const &rel_tags, osmium::memory::Buffer const &members,
rolelist_t const &member_roles, int *member_superseded, int *make_boundary,
int *make_polygon, int *roads, export_list const &exlist,
taglist_t &out_tags, bool allow_typeless)
{
auto const &infos = exlist.get(osmium::item_type::way);
//if it has a relation figure out what kind it is
const std::string *type = rel_tags.get("type");
bool is_route = false, is_boundary = false, is_multipolygon = false;
if (type) {
//what kind of relation is it
if (*type == "route")
is_route = true;
else if (*type == "boundary")
is_boundary = true;
else if (*type == "multipolygon")
is_multipolygon = true;
else if (!allow_typeless)
return true;
} //you didnt have a type and it was required
else if (!allow_typeless) {
return true;
}
/* Clone tags from relation */
for (const auto &rel_tag : rel_tags) {
//copy the name tag as "route_name"
if (is_route && (rel_tag.key == "name"))
out_tags.push_dedupe(tag_t("route_name", rel_tag.value));
//copy all other tags except for "type"
if (rel_tag.key != "type")
out_tags.push_dedupe(rel_tag);
}
if (is_route) {
const std::string *netw = rel_tags.get("network");
int networknr = -1;
if (netw != nullptr) {
const std::string *state = rel_tags.get("state");
std::string statetype("yes");
if (state) {
if (*state == "alternate")
statetype = "alternate";
else if (*state == "connection")
statetype = "connection";
}
if (*netw == "lcn") {
networknr = 10;
out_tags.push_dedupe(tag_t("lcn", statetype));
} else if (*netw == "rcn") {
networknr = 11;
out_tags.push_dedupe(tag_t("rcn", statetype));
} else if (*netw == "ncn") {
networknr = 12;
out_tags.push_dedupe(tag_t("ncn", statetype));
} else if (*netw == "lwn") {
networknr = 20;
out_tags.push_dedupe(tag_t("lwn", statetype));
} else if (*netw == "rwn") {
networknr = 21;
out_tags.push_dedupe(tag_t("rwn", statetype));
} else if (*netw == "nwn") {
networknr = 22;
out_tags.push_dedupe(tag_t("nwn", statetype));
}
}
const std::string *prefcol = rel_tags.get("preferred_color");
if (prefcol != NULL && prefcol->size() == 1) {
if ((*prefcol)[0] == '0' || (*prefcol)[0] == '1' ||
(*prefcol)[0] == '2' || (*prefcol)[0] == '3' ||
(*prefcol)[0] == '4') {
out_tags.push_dedupe(tag_t("route_pref_color", *prefcol));
} else {
out_tags.push_dedupe(tag_t("route_pref_color", "0"));
}
} else {
out_tags.push_dedupe(tag_t("route_pref_color", "0"));
}
const std::string *relref = rel_tags.get("ref");
if (relref != NULL) {
if (networknr == 10) {
out_tags.push_dedupe(tag_t("lcn_ref", *relref));
} else if (networknr == 11) {
out_tags.push_dedupe(tag_t("rcn_ref", *relref));
} else if (networknr == 12) {
out_tags.push_dedupe(tag_t("ncn_ref", *relref));
} else if (networknr == 20) {
out_tags.push_dedupe(tag_t("lwn_ref", *relref));
} else if (networknr == 21) {
out_tags.push_dedupe(tag_t("rwn_ref", *relref));
} else if (networknr == 22) {
out_tags.push_dedupe(tag_t("nwn_ref", *relref));
}
}
} else if (is_boundary) {
/* Boundaries will get converted into multiple geometries:
- Linear features will end up in the line and roads tables (useful for admin boundaries)
- Polygon features also go into the polygon table (useful for national_forests)
The edges of the polygon also get treated as linear fetaures allowing these to be rendered seperately. */
*make_boundary = 1;
} else if (is_multipolygon && out_tags.contains("boundary")) {
/* Treat type=multipolygon exactly like type=boundary if it has a boundary tag. */
*make_boundary = 1;
} else if (is_multipolygon) {
*make_polygon = 1;
// Check if the relation has any polygon-like tags. In that case
// we have a new-style polygon.
bool newstyle_mp = false;
for (const auto &tag : out_tags) {
if (tag.key == "area") {
newstyle_mp = true;
} else {
for (const auto &info : infos) {
if (info.name == tag.key) {
newstyle_mp = info.flags & FLAG_POLYGON;
break;
}
}
}
if (newstyle_mp) {
break;
}
}
// Old-style MP: copy the tags from the outer way(s). Only use tags
// that appear in all outer rings.
if (!newstyle_mp) {
taglist_t poly_tags;
bool first_outerway = true;
size_t i = 0;
for (auto const &w : members.select<osmium::Way>()) {
if (member_roles[i] && strcmp(member_roles[i], "inner") == 0)
continue;
/* insert all tags of the first outerway to the potential list of copied tags. */
if (first_outerway) {
for (auto const &tag : w.tags()) {
poly_tags.emplace_back(tag.key(), tag.value());
}
first_outerway = false;
} else {
/* Check if all of the tags in the list of potential tags are present on this way,
otherwise remove from the list of potential tags. Tags need to be present on
all outer ways to be copied over to the relation */
auto it = poly_tags.begin();
while (it != poly_tags.end()) {
if (!w.tags().has_key(it->key.c_str()))
/* This tag is not present on all member outer ways, so don't copy it over to relation */
it = poly_tags.erase(it);
else
++it;
}
}
++i;
}
// Copy the list identified outer way tags over to the relation
// filtering for wanted tags on the way.
bool filter;
int flags = 0;
for (const auto &poly_tag : poly_tags) {
if (check_key(infos, poly_tag.key.c_str(), &filter, &flags,
false)) {
out_tags.push_dedupe(poly_tag);
}
}
if (!(flags & FLAG_POLYGON)) {
out_tags.clear();
return true;
}
}
}
if (out_tags.empty()) {
return true;
}
/* If we are creating a multipolygon then we
mark each member so that we can skip them during iterate_ways
but only if the polygon-tags look the same as the outer ring */
if (make_polygon) {
size_t i = 0;
for (auto const &w : members.select<osmium::Way>()) {
member_superseded[i] = 1;
for (const auto &member_tag : w.tags()) {
auto const *v = out_tags.get(member_tag.key());
bool filt;
int flag;
if ((!v && check_key(infos, member_tag.key(), &filt, &flag, false))
|| (v && *v != member_tag.value())) {
/* z_order and osm_ are automatically generated tags, so ignore them */
if (strcmp(member_tag.key(), "z_order") &&
strcmp(member_tag.key(), "osm_user") &&
strcmp(member_tag.key(), "osm_version") &&
strcmp(member_tag.key(), "osm_uid") &&
strcmp(member_tag.key(), "osm_changeset") &&
strcmp(member_tag.key(), "osm_timestamp")) {
member_superseded[i] = 0;
break;
}
}
}
++i;
}
}
add_z_order(out_tags, roads);
return 0;
}
|