35 #include <xercesc/sax/HandlerBase.hpp> 36 #include <xercesc/sax/AttributeList.hpp> 37 #include <xercesc/sax/SAXParseException.hpp> 38 #include <xercesc/sax/SAXException.hpp> 64 myHaveWarnedAboutDeprecatedLanes(false),
65 myErrorMsgHandler(
OptionsCont::getOptions().getBool(
"ignore-errors.connections") ?
97 WRITE_WARNING(
"Target edge '" + toEdge->
getID() +
"' is not connected with '" + fromEdge->
getID() +
"'; the connection cannot be reset.");
105 if (!
parseLaneInfo(attrs, fromEdge, toEdge, &fromLane, &toLane)) {
111 WRITE_WARNING(
"Edge '" + fromEdge->
getID() +
"' has no connection to lane " +
toString(toLane) +
" of edge '" + toEdge->
getID() +
"'; the connection cannot be reset.");
132 if (toEdge == 0 && to.length() != 0) {
172 const std::string::size_type div = def.find(
"->");
173 if (div == std::string::npos) {
177 std::string fromDef = def.substr(0, div);
178 std::string toDef = def.substr(div + 2);
182 if (fromDef.find(
'_') != std::string::npos) {
183 fromDef = fromDef.substr(0, fromDef.find(
'_'));
185 if (toDef.find(
'_') != std::string::npos) {
186 toDef = toDef.substr(0, toDef.find(
'_'));
218 WRITE_ERROR(
"Unable to project shape for connection from edge '" + from->
getID() +
"' to edge '" + to->
getID() +
"'.");
233 from->
getID() +
"' to '" + to->
getID() +
"'.");
239 from->
getID() +
"' to '" + to->
getID() +
"'.");
245 if (!from->
addLane2LaneConnection(fromLane, to, toLane,
NBEdge::L2L_USER,
true, mayDefinitelyPass, keepClear, contPos, visibility, speed, customShape)) {
257 if (keepUncontrolled) {
264 int* fromLane,
int* toLane) {
276 int* fromLane,
int* toLane) {
287 if (!ok || st.size() != 2) {
289 from->
getID() +
"' to '" + to->
getID() +
"'.");
320 std::vector<std::string> edgeIDs;
325 WRITE_ERROR(
"Node '" + nodeID +
"' in crossing is not known.");
331 WRITE_ERROR(
"No edges specified for crossing at node '" + nodeID +
"'.");
339 for (std::vector<std::string>::const_iterator it = edgeIDs.begin(); it != edgeIDs.end(); ++it) {
342 WRITE_ERROR(
"Edge '" + (*it) +
"' for crossing at node '" + nodeID +
"' is not known.");
351 WRITE_ERROR(
"Edge '" + (*it) +
"' does not touch node '" + nodeID +
"'.");
356 WRITE_ERROR(
"Edge '" + (*it) +
"' does not touch node '" + nodeID +
"'.");
360 edges.push_back(edge);
365 WRITE_WARNING(
"Crossing at controlled node '" + nodeID +
"' must be prioritized");
370 WRITE_ERROR(
"Unable to project shape for crossing at node '" + node->
getID() +
"'.");
375 node->
addCrossing(edges, width, priority, tlIndex, customShape);
386 std::vector<std::string> edgeIDs;
388 WRITE_ERROR(
"No edges specified for walkingArea at node '" + nodeID +
"'.");
395 for (std::vector<std::string>::const_iterator it = edgeIDs.begin(); it != edgeIDs.end(); ++it) {
398 WRITE_ERROR(
"Edge '" + (*it) +
"' for walkingArea at node '" + nodeID +
"' is not known.");
407 WRITE_ERROR(
"Edge '" + (*it) +
"' does not touch node '" + nodeID +
"'.");
412 WRITE_ERROR(
"Edge '" + (*it) +
"' does not touch node '" + nodeID +
"'.");
416 edges.push_back(edge);
420 WRITE_ERROR(
"Unable to project shape for walkingArea at node '" + node->
getID() +
"'.");
static const PositionVector EMPTY
empty Vector
NBNode * retrieve(const std::string &id) const
Returns the node with the given name.
Whether vehicles must keep the junction clear.
static const double UNSPECIFIED_VISIBILITY_DISTANCE
unspecified foe visibility for connections
The relationships between edges are computed/loaded.
bool isConnectedTo(const NBEdge *e) const
Returns the information whethe a connection to the given edge has been added (or computed) ...
void addCrossing(const SUMOSAXAttributes &attrs)
Parses a crossing and updates the referenced node.
static const NBConnection InvalidConnection
A container for traffic light definitions and built programs.
bool myHaveWarnedAboutDeprecatedLanes
Information whether we have a deprecated attribute.
connectio between two lanes
bool parseLaneInfo(const SUMOSAXAttributes &attributes, NBEdge *fromEdge, NBEdge *toEdge, int *fromLane, int *toLane)
Parses information about lane-2-lane connection when it describes a lane-2-lane relationship.
The representation of a single edge during network building.
foe visibility distance of a link
void removeFromConnections(NBEdge *toEdge, int fromLane=-1, int toLane=-1, bool tryLater=false, const bool adaptToLaneRemoval=false)
Removes the specified connection(s)
static bool transformCoordinates(PositionVector &from, bool includeInBoundary=true, GeoConvHelper *from_srs=0)
NBEdge * getFrom() const
returns the from-edge (start of the connection)
void parseLaneBound(const SUMOSAXAttributes &attrs, NBEdge *from, NBEdge *to)
Parses a connection when it describes a lane-2-lane relationship.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
const std::string & getID() const
Returns the id.
SAX-handler base for SUMO-files.
bool parseLaneDefinition(const SUMOSAXAttributes &attributes, int *fromLane, int *toLane)
Parses information about lane-2-lane connection.
virtual bool hasAttribute(int id) const =0
Returns the information whether the named (by its enum-value) attribute is within the current list...
static const double UNSPECIFIED_WIDTH
unspecified lane width
prohibition of circulation between two edges
#define WRITE_WARNING(msg)
static OptionsCont & getOptions()
Retrieves the options.
static const double UNSPECIFIED_SPEED
unspecified lane speed
NBEdgeCont & myEdgeCont
The edge container to fill.
void invalidateTLS(NBTrafficLightLogicCont &tlCont, bool removedConnections, bool addedConnections)
causes the traffic light to be computed anew
bool parseDeprecatedLaneDefinition(const SUMOSAXAttributes &attributes, NBEdge *fromEdge, NBEdge *toEdge, int *fromLane, int *toLane)
Parses information about lane-2-lane connection in deprecated format.
bool addEdge2EdgeConnection(NBEdge *dest)
Adds a connection to another edge.
NBConnection parseConnection(const std::string &defRole, const std::string &def)
Returns the connection described by def.
bool isTLControlled() const
Returns whether this node is controlled by any tls.
static void parseStringVector(const std::string &def, std::vector< std::string > &into)
Splits the given string.
void removeCrossing(const EdgeVector &edges)
remove a pedestrian crossing from this node (identified by its edges)
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
Encapsulated SAX-Attributes.
T get(int attr, const char *objectid, bool &ok, bool report=true) const
Tries to read given attribute assuming it is an int.
std::string getLaneID(int lane) const
get Lane ID (Secure)
walking area for pedestrians
bool wasRemoved(std::string id) const
Returns whether the edge with the id was deleted explicitly.
static const double UNSPECIFIED_CONTPOS
unspecified internal junction position
bool hasConnectionTo(NBEdge *destEdge, int destLane, int fromLane=-1) const
Retrieves info about a connection to a certain lane of a certain edge.
void myStartElement(int element, const SUMOSAXAttributes &attrs)
Called on the opening of a tag;.
NBNodeCont & myNodeCont
The edge container to fill.
Storage for edges, including some functionality operating on multiple edges.
EdgeBuildingStep getStep() const
The building step of this edge.
edge: the shape in xml-definition
void discardAllCrossings(bool rejectAll)
discard all current (and optionally future) crossings
The connection was given by the user.
void addCrossing(EdgeVector edges, double width, bool priority, int tlIndex=-1, const PositionVector &customShape=PositionVector::EMPTY, bool fromSumoNet=false)
add a pedestrian crossing to this node
MsgHandler *const myErrorMsgHandler
the handler for loading errors
void addWalkingAreaShape(EdgeVector edges, const PositionVector &shape)
add custom shape for walkingArea
~NIXMLConnectionsHandler()
Destructor.
T getOpt(int attr, const char *objectid, bool &ok, T defaultValue, bool report=true) const
Tries to read given attribute assuming it is an int.
bool addLane2LaneConnection(int fromLane, NBEdge *dest, int toLane, Lane2LaneInfoType type, bool mayUseSameDestination=false, bool mayDefinitelyPass=false, bool keepClear=true, double contPos=UNSPECIFIED_CONTPOS, double visibility=UNSPECIFIED_VISIBILITY_DISTANCE, double speed=UNSPECIFIED_SPEED, const PositionVector &customShape=PositionVector::EMPTY)
Adds a connection between the specified this edge's lane and an approached one.
void disableConnection4TLS(int fromLane, NBEdge *toEdge, int toLane)
disable connections for TLS
std::vector< NBEdge * > EdgeVector
container for (sorted) edges
void addPostProcessConnection(const std::string &from, int fromLane, const std::string &to, int toLane, bool mayDefinitelyPass, bool keepClear, double contPos, double visibility, double speed, const PositionVector &customShape, bool warnOnly=false)
Adds a connection which could not be set during loading.
NBEdge * retrieve(const std::string &id, bool retrieveExtracted=false) const
Returns the edge that has the given id.
void inform(std::string msg, bool addType=true)
adds a new error to the list
A storage for options typed value containers)
SumoXMLNodeType getType() const
Returns the type of this node.
NIXMLConnectionsHandler(NBEdgeCont &ec, NBNodeCont &nc, NBTrafficLightLogicCont &tlc)
Constructor.
crossing between edges for pedestrians
void addWalkingArea(const SUMOSAXAttributes &attrs)
Parses a walkingArea and updates the referenced node.
Represents a single node (junction) during network building.
void addSortedLinkFoes(const NBConnection &mayDrive, const NBConnection &mustStop)
add shorted link FOES
link: the index of the link within the traffic light
NBNode * getFromNode() const
Returns the origin node of the edge.
bool wasIgnored(std::string id) const
Returns whether the edge with the id was ignored during parsing.
Container for nodes during the netbuilding process.
static int _2intSec(const E *const data, int def)
converts a 0-terminated char-type array into the integer value described by it
Lanes to edges - relationships are computed/loaded.
NBTrafficLightLogicCont & myTLLogicCont
The traffic lights container to add built tls to (when invalidating tls)
NBNode * getToNode() const
Returns the destination node of the edge.