58 std::set<std::string> result;
59 result.insert(
"highway");
60 result.insert(
"railway");
61 result.insert(
"railway:position");
62 result.insert(
"railway:position:exact");
63 result.insert(
"waterway");
64 result.insert(
"aeroway");
65 result.insert(
"aerialway");
66 result.insert(
"power");
67 result.insert(
"man_made");
68 result.insert(
"building");
69 result.insert(
"leisure");
70 result.insert(
"amenity");
71 result.insert(
"shop");
72 result.insert(
"tourism");
73 result.insert(
"historic");
74 result.insert(
"landuse");
75 result.insert(
"natural");
76 result.insert(
"military");
77 result.insert(
"boundary");
78 result.insert(
"admin_level");
79 result.insert(
"sport");
80 result.insert(
"polygon");
81 result.insert(
"place");
82 result.insert(
"population");
83 result.insert(
"barrier");
84 result.insert(
"openGeoDB:population");
85 result.insert(
"openGeoDB:name");
91 if (!oc.
isSet(
"osm-files")) {
97 std::map<long long int, PCOSMNode*> nodes;
98 bool withAttributes = oc.
getBool(
"all-attributes");
101 for (std::vector<std::string>::const_iterator file = files.begin(); file != files.end(); ++file) {
109 for (std::map<long long int, PCOSMNode*>::const_iterator i = nodes.begin(); i != nodes.end(); ++i) {
119 std::set<long long int> innerEdges;
120 RelationsHandler relationsHandler(additionalWays, relations, innerEdges, withAttributes, *m);
121 for (std::vector<std::string>::const_iterator file = files.begin(); file != files.end(); ++file) {
130 EdgesHandler edgesHandler(nodes, edges, additionalWays, withAttributes, *m);
131 for (std::vector<std::string>::const_iterator file = files.begin(); file != files.end(); ++file) {
139 const bool useName = oc.
getBool(
"osm.use-name");
142 if (mergeRelationsThreshold >= 0) {
144 if (!rel->keep || rel->myWays.empty()) {
149 for (
auto it = rel->myWays.begin(); it != rel->myWays.end();) {
150 if (edges.count(*it) == 0 || edges[*it]->myCurrentNodes.empty()) {
151 it = rel->myWays.erase(it);
152 }
else if (innerEdges.count(*it) > 0) {
156 edges[*it]->standalone =
true;
157 it = rel->myWays.erase(it);
159 numNodes += (int)edges[*it]->myCurrentNodes.size();
164 WRITE_WARNINGF(
TL(
"Could not import polygon from relation '%' (missing ways)"), rel->id);
174 std::vector<std::vector<long long int> > snippets;
175 for (
const long long int wayID : rel->myWays) {
181 while (snippets.size() > 1) {
183 if (maxDist > mergeRelationsThreshold) {
191 double frontBackDist = 0;
197 if (frontBackDist < mergeRelationsThreshold) {
202 std::string frontBackMsg =
"";
203 if (frontBackDist > 0) {
204 frontBackMsg =
TLF(
", (front-to-back dist: %)", frontBackDist);
208 WRITE_WARNINGF(
TL(
"Could not import polygon from relation '%' (name:% reason: found gap of %m)."), rel->id, rel->name, maxDist)
211 for (
long long int wayID : rel->myWays) {
220 for (EdgeMap::iterator i = edges.begin(); i != edges.end(); ++i) {
226 if (!e->
standalone && mergeRelationsThreshold >= 0) {
247 std::string unknownPolyType =
"";
248 bool isInner = mergeRelationsThreshold >= 0 && innerEdges.count(e->
id) != 0 && tm.
has(
"inner");
249 for (std::map<std::string, std::string>::iterator it = e->
myAttributes.begin(); it != e->
myAttributes.end(); ++it) {
250 const std::string& key = it->first;
251 const std::string& value = it->second;
252 const std::string fullType = key +
"." + value;
253 if (tm.
has(key +
"." + value)) {
254 auto def = tm.
get(isInner ?
"inner" : fullType);
255 index =
addPolygon(e, vec, def, fullType, index, useName, toFill, ignorePruning, withAttributes);
256 }
else if (tm.
has(key)) {
257 auto def = tm.
get(isInner ?
"inner" : key);
258 index =
addPolygon(e, vec, def, fullType, index, useName, toFill, ignorePruning, withAttributes);
260 unknownPolyType = fullType;
264 if (index == 0 && !def.
discard && unknownPolyType !=
"") {
265 addPolygon(e, vec, def, unknownPolyType, index, useName, toFill, ignorePruning, withAttributes);
271 for (std::map<long long int, PCOSMNode*>::iterator i = nodes.begin(); i != nodes.end(); ++i) {
284 std::string unKnownPOIType =
"";
285 for (std::map<std::string, std::string>::iterator it = n->
myAttributes.begin(); it != n->
myAttributes.end(); ++it) {
286 const std::string& key = it->first;
287 const std::string& value = it->second;
288 const std::string fullType = key +
"." + value;
289 if (tm.
has(key +
"." + value)) {
290 index =
addPOI(n, pos, tm.
get(fullType), fullType, index, useName, toFill, ignorePruning, withAttributes);
291 }
else if (tm.
has(key)) {
292 index =
addPOI(n, pos, tm.
get(key), fullType, index, useName, toFill, ignorePruning, withAttributes);
294 unKnownPOIType = fullType;
298 if (index == 0 && !def.
discard && unKnownPOIType !=
"") {
299 addPOI(n, pos, def, unKnownPOIType, index, useName, toFill, ignorePruning, withAttributes);
303 for (std::map<long long int, PCOSMNode*>::const_iterator i = nodes.begin(); i != nodes.end(); ++i) {
307 for (EdgeMap::iterator i = edges.begin(); i != edges.end(); ++i) {
311 for (Relations::iterator i = relations.begin(); i != relations.end(); ++i) {
330 const bool closedShape = vec.front() == vec.back();
331 const std::string idSuffix = (index == 0 ?
"" :
"#" +
toString(index));
338 if (withAttributes) {
341 if (!toFill.
add(poly, ignorePruning)) {
352 int index,
bool useName,
PCPolyContainer& toFill,
bool ignorePruning,
bool withAttributes) {
356 const std::string idSuffix = (index == 0 ?
"" :
"#" +
toString(index));
362 if (withAttributes) {
365 if (!toFill.
add(poi, ignorePruning)) {
378 bool withAttributes,
MsgHandler& errorHandler) :
379 SUMOSAXHandler(
"osm - file"), myWithAttributes(withAttributes), myErrorHandler(errorHandler),
380 myToFill(toFill), myLastNodeID(-1) {}
388 myParentElements.push_back(element);
391 long long int id = attrs.
get<
long long int>(
SUMO_ATTR_ID,
nullptr, ok);
396 if (myToFill.find(
id) == myToFill.end()) {
408 myToFill[toAdd->
id] = toAdd;
411 if (element ==
SUMO_TAG_TAG && myParentElements.size() > 2 && myParentElements[myParentElements.size() - 2] ==
SUMO_TAG_NODE
412 && myLastNodeID != -1) {
417 myToFill[myLastNodeID]->name = value;
418 }
else if (key ==
"") {
419 myErrorHandler.inform(
"Empty key in a a tag while parsing node '" +
toString(myLastNodeID) +
"' occurred.");
425 myToFill[myLastNodeID]->myAttributes[key] = value;
435 myParentElements.pop_back();
444 std::set<long long int>& innerEdges,
448 myAdditionalWays(additionalWays),
449 myRelations(relations),
450 myInnerEdges(innerEdges),
451 myWithAttributes(withAttributes),
452 myErrorHandler(errorHandler),
453 myCurrentRelation(nullptr) {
463 myParentElements.push_back(element);
466 myCurrentWays.clear();
469 if (action ==
"delete" || !ok) {
470 myCurrentRelation =
nullptr;
473 myCurrentRelation->keep =
false;
474 myCurrentRelation->id = attrs.
get<
long long int>(
SUMO_ATTR_ID,
nullptr, ok);
475 myRelations.push_back(myCurrentRelation);
478 }
else if (myCurrentRelation ==
nullptr) {
486 if (role ==
"outer" || role ==
"inner") {
488 if (memberType ==
"way") {
489 myCurrentWays.push_back(ref);
490 if (role ==
"inner") {
491 myInnerEdges.insert(ref);
499 && myCurrentRelation !=
nullptr) {
504 myErrorHandler.inform(
"Empty key in a a tag while parsing way '" +
toString(myCurrentRelation) +
"' occurred.");
511 myCurrentRelation->name = value;
513 myCurrentRelation->keep =
true;
514 for (std::vector<long long int>::iterator it = myCurrentWays.begin(); it != myCurrentWays.end(); ++it) {
515 myAdditionalWays[*it] = myCurrentRelation;
518 myCurrentRelation->myAttributes[key] = value;
525 myParentElements.pop_back();
527 myCurrentRelation->myWays = myCurrentWays;
528 myCurrentRelation =
nullptr;
529 myCurrentWays.clear();
540 bool withAttributes,
MsgHandler& errorHandler) :
542 myWithAttributes(withAttributes),
543 myErrorHandler(errorHandler),
544 myOSMNodes(osmNodes),
546 myAdditionalWays(additionalWays) {
556 myParentElements.push_back(element);
560 const long long int id = attrs.
get<
long long int>(
SUMO_ATTR_ID,
nullptr, ok);
562 if (action ==
"delete" || !ok) {
563 myCurrentEdge =
nullptr;
567 myCurrentEdge->id = id;
568 myCurrentEdge->myIsClosed =
false;
569 myCurrentEdge->standalone =
false;
570 myKeep = (myAdditionalWays.find(
id) != myAdditionalWays.end());
573 if (element ==
SUMO_TAG_ND && myCurrentEdge !=
nullptr) {
575 const long long int ref = attrs.
get<
long long int>(
SUMO_ATTR_REF,
nullptr, ok);
577 if (myOSMNodes.find(ref) == myOSMNodes.end()) {
578 WRITE_WARNINGF(
TL(
"The referenced geometry information (ref='%') is not known"), ref);
581 myCurrentEdge->myCurrentNodes.push_back(ref);
585 if (element ==
SUMO_TAG_TAG && myParentElements.size() > 2 && myParentElements[myParentElements.size() - 2] ==
SUMO_TAG_WAY
586 && myCurrentEdge !=
nullptr) {
591 myErrorHandler.inform(
"Empty key in a a tag while parsing way '" +
toString(myCurrentEdge->id) +
"' occurred.");
598 myCurrentEdge->name = value;
601 myCurrentEdge->standalone =
true;
603 myCurrentEdge->myAttributes[key] = value;
610 myParentElements.pop_back();
611 if (element ==
SUMO_TAG_WAY && myCurrentEdge !=
nullptr) {
613 RelationsMap::const_iterator it = myAdditionalWays.find(myCurrentEdge->id);
614 if (it != myAdditionalWays.end()) {
615 myCurrentEdge->myAttributes.insert((*it).second->myAttributes.begin(), (*it).second->myAttributes.end());
617 myEdgeMap[myCurrentEdge->id] = myCurrentEdge;
619 delete myCurrentEdge;
621 myCurrentEdge =
nullptr;
628 double best = std::numeric_limits<double>::max();
634 for (
int i = 0; i < (int)snippets.size(); i++) {
635 for (
int j = i + 1; j < (int)snippets.size(); j++) {
674 std::vector<long long int> merged;
676 merged.insert(merged.end(), snippets[best_i].begin(), snippets[best_i].end());
678 merged.insert(merged.end(), snippets[best_i].rbegin(), snippets[best_i].rend());
681 merged.insert(merged.end(), snippets[best_j].begin(), snippets[best_j].end());
683 merged.insert(merged.end(), snippets[best_j].rbegin(), snippets[best_j].rend());
685 snippets.erase(snippets.begin() + best_j);
686 snippets.erase(snippets.begin() + best_i);
687 snippets.push_back(merged);
#define WRITE_WARNINGF(...)
#define WRITE_MESSAGEF(...)
#define WRITE_ERRORF(...)
#define PROGRESS_BEGIN_TIME_MESSAGE(msg)
#define PROGRESS_TIME_MESSAGE(before)
@ SUMO_TAG_NODE
alternative definition for junction
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
static bool isReadable(std::string path)
Checks whether the given file is readable.
bool x2cartesian(Position &from, bool includeInBoundary=true)
Converts the given coordinate into a cartesian and optionally update myConvBoundary.
static GeoConvHelper & getProcessing()
the coordinate transformation to use for input conversion and processing
static MsgHandler * getErrorInstance()
Returns the instance to add errors to.
static MsgHandler * getWarningInstance()
Returns the instance to add warnings to.
A storage for options typed value containers)
bool isSet(const std::string &name, bool failOnNonExistant=true) const
Returns the information whether the named option is set.
double getFloat(const std::string &name) const
Returns the double-value of the named option (only for Option_Float)
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
const StringVector & getStringVector(const std::string &name) const
Returns the list of string-value of the named option (only for Option_StringVector)
static OptionsCont & getOptions()
Retrieves the options.
bool isInStringVector(const std::string &optionName, const std::string &itemName) const
Returns the named option is a list of string values containing the specified item.
A class which extracts OSM-edges from a parsed OSM-file.
void myStartElement(int element, const SUMOSAXAttributes &attrs)
Called on the opening of a tag;.
void myEndElement(int element)
Called when a closing tag occurs.
~EdgesHandler()
Destructor.
EdgesHandler(const std::map< long long int, PCOSMNode * > &osmNodes, EdgeMap &toFill, const RelationsMap &additionalWays, bool withAttributes, MsgHandler &errorHandler)
Constructor.
A class which extracts OSM-nodes from a parsed OSM-file.
NodesHandler(std::map< long long int, PCOSMNode * > &toFill, bool withAttributes, MsgHandler &errorHandler)
Contructor.
void myEndElement(int element)
Called when a closing tag occurs.
void myStartElement(int element, const SUMOSAXAttributes &attrs)
Called on the opening of a tag;.
~NodesHandler()
Destructor.
A class which extracts relevant way-ids from relations in a parsed OSM-file.
void myEndElement(int element)
Called when a closing tag occurs.
void myStartElement(int element, const SUMOSAXAttributes &attrs)
Called on the opening of a tag;.
~RelationsHandler()
Destructor.
RelationsHandler(RelationsMap &additionalWays, Relations &relations, std::set< long long int > &innerEdges, bool withAttributes, MsgHandler &errorHandler)
Constructor.
static int addPolygon(const PCOSMEdge *edge, const PositionVector &vec, const PCTypeMap::TypeDef &def, const std::string &fullType, int index, bool useName, PCPolyContainer &toFill, bool ignorePruning, bool withAttributes)
try add the polygon and return the next index on success
std::map< long long int, PCOSMEdge * > EdgeMap
static Position convertNodePosition(PCOSMNode *n)
retrieve cartesian coordinate for given node
static int addPOI(const PCOSMNode *node, const Position &pos, const PCTypeMap::TypeDef &def, const std::string &fullType, int index, bool useName, PCPolyContainer &toFill, bool ignorePruning, bool withAttributes)
try add the POI and return the next index on success
static double mergeClosest(const std::map< long long int, PCOSMNode * > &nodes, std::vector< std::vector< long long int > > &snippets)
static void loadIfSet(OptionsCont &oc, PCPolyContainer &toFill, PCTypeMap &tm)
Loads pois/polygons assumed to be stored as OSM-XML.
std::vector< PCOSMRelation * > Relations
static const std::set< std::string > MyKeysToInclude
std::map< long long int, PCOSMRelation * > RelationsMap
static std::set< std::string > initMyKeysToInclude()
A storage for loaded polygons and pois.
bool add(SUMOPolygon *poly, bool ignorePruning=false)
Adds a polygon to the storage.
A storage for type mappings.
const TypeDef & getDefault()
get the default type according to the given options
const TypeDef & get(const std::string &id)
Returns a type definition.
bool has(const std::string &id)
Returns the information whether the named type is known.
void updateParameters(const Parameterised::Map &mapArg)
Adds or updates all given parameters from the map.
A point in 2D or 3D with translation and scaling methods.
double distanceTo2D(const Position &p2) const
returns the euclidean distance in the x-y-plane
void push_back_noDoublePos(const Position &p)
insert in back a non double position
Encapsulated SAX-Attributes.
T getOpt(int attr, const char *objectid, bool &ok, T defaultValue=T(), bool report=true) const
Tries to read given attribute assuming it is an int.
virtual std::string getStringSecure(int id, const std::string &def) const =0
Returns the string-value of the named (by its enum-value) attribute.
T get(int attr, const char *objectid, bool &ok, bool report=true) const
Tries to read given attribute assuming it is an int.
virtual bool hasAttribute(int id) const =0
Returns the information whether the named (by its enum-value) attribute is within the current list.
SAX-handler base for SUMO-files.
static std::string escapeXML(const std::string &orig, const bool maskDoubleHyphen=false)
Replaces the standard escapes by their XML entities.
static bool runParser(GenericSAXHandler &handler, const std::string &file, const bool isNet=false, const bool isRoute=false, const bool isExternal=false, const bool catchExceptions=true)
Runs the given handler on the given file; returns if everything's ok.
An internal definition of a loaded edge.
bool myIsClosed
Information whether this area is closed.
long long int id
The edge's id.
std::map< std::string, std::string > myAttributes
Additional attributes.
std::vector< long long int > myCurrentNodes
The list of nodes this edge is made of.
std::string name
The edge's name (if any)
An internal representation of an OSM-node.
double lat
The latitude the node is located at.
double lon
The longitude the node is located at.
std::string name
The nodes name (if any)
long long int id
The node's id.
std::map< std::string, std::string > myAttributes
Additional attributes.
An internal definition of a loaded relation.
A single definition of values that shall be used for a given type.
std::string icon
the icon to use
bool discard
Information whether polygons of this type shall be discarded.
std::string prefix
The prefix to use.
double layer
The layer to use.
std::string id
The new type id to use.
RGBColor color
The color to use.
Filltype allowFill
Information whether polygons of this type can be filled.