58 if (!oc.
isSet(
"output-file")) {
62 std::map<SumoXMLAttr, std::string> attrs;
67 const int cornerDetail = oc.
getInt(
"junctions.corner-detail");
68 if (cornerDetail > 0) {
71 if (!oc.
isDefault(
"junctions.internal-link-detail")) {
74 if (oc.
getBool(
"rectangular-lane-cut")) {
80 if (oc.
getFloat(
"junctions.limit-turn-speed") > 0) {
97 if (!oc.
getBool(
"no-internal-links")) {
99 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
108 bool noNames = !oc.
getBool(
"output.street-names");
109 for (std::map<std::string, NBEdge*>::const_iterator i = ec.
begin(); i != ec.
end(); ++i) {
110 writeEdge(device, *(*i).second, noNames);
118 std::set<NBNode*> roundaboutNodes;
119 const bool checkLaneFoesAll = oc.
getBool(
"check-lane-foes.all");
120 const bool checkLaneFoesRoundabout = !checkLaneFoesAll && oc.
getBool(
"check-lane-foes.roundabout");
121 if (checkLaneFoesRoundabout) {
123 for (std::set<EdgeSet>::const_iterator i = roundabouts.begin(); i != roundabouts.end(); ++i) {
124 for (EdgeSet::const_iterator j = (*i).begin(); j != (*i).end(); ++j) {
125 roundaboutNodes.insert((*j)->getToNode());
129 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
130 const bool checkLaneFoes = checkLaneFoesAll || (checkLaneFoesRoundabout && roundaboutNodes.count((*i).second) > 0);
134 const bool includeInternal = !oc.
getBool(
"no-internal-links");
135 if (includeInternal) {
138 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
147 int numConnections = 0;
148 for (std::map<std::string, NBEdge*>::const_iterator it_edge = ec.
begin(); it_edge != ec.
end(); it_edge++) {
149 NBEdge* from = it_edge->second;
150 const std::vector<NBEdge::Connection> connections = from->
getConnections();
151 numConnections += (int)connections.size();
152 for (std::vector<NBEdge::Connection>::const_iterator it_c = connections.begin(); it_c != connections.end(); it_c++) {
156 if (numConnections > 0) {
159 if (includeInternal) {
162 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
169 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
170 NBNode* node = (*i).second;
172 std::vector<NBNode::Crossing*> crossings = node->
getCrossings();
173 for (
auto c : crossings) {
178 for (
const std::string& cID : wa.nextCrossings) {
186 if (nextCrossing.
tlID !=
"") {
198 for (
const std::string& sw : wa.nextSidewalks) {
202 for (
const std::string& sw : wa.prevSidewalks) {
210 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
218 for (std::map<std::string, NBDistrict*>::const_iterator i = dc.
begin(); i != dc.
end(); i++) {
221 if (dc.
size() != 0) {
236 assert(succOpp != 0);
237 assert(predOpp != 0);
238 const std::vector<NBEdge::Connection>& connections = succOpp->
getConnections();
239 for (std::vector<NBEdge::Connection>::const_iterator it_c = connections.begin(); it_c != connections.end(); it_c++) {
241 if (succOpp != from &&
243 predOpp == conOpp.
toEdge &&
261 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
262 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
263 if (elv.size() > 0) {
264 bool haveVia =
false;
265 std::string edgeID =
"";
267 std::map<std::string, double> lengthSum;
268 std::map<std::string, int> numLanes;
269 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
271 numLanes[(*k).id] += 1;
274 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
275 if ((*k).toEdge == 0) {
279 if (edgeID != (*k).id) {
292 const NBEdge::Lane& successor = (*k).toEdge->getLanes()[(*k).toLane];
293 const double length = lengthSum[edgeID] / numLanes[edgeID];
297 const double width = n.
isConstantWidthTransition() && (*i)->getNumLanes() > (*k).toEdge->getNumLanes() ? (*i)->getLaneWidth((*k).fromLane) : successor.
width;
298 writeLane(into, (*k).getInternalLaneID(), (*k).vmax,
302 haveVia = haveVia || (*k).haveVia;
308 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
312 if ((*k).toEdge == 0) {
316 const NBEdge::Lane& successor = (*k).toEdge->getLanes()[(*k).toLane];
336 NBEdge::UNSPECIFIED_OFFSET, std::map<int, double>(), c->width, c->shape, 0,
MAX2(c->shape.length(),
POSITION_EPS), 0,
"",
false, c->customShape.size() != 0);
340 const std::vector<NBNode::WalkingArea>& WalkingAreas = n.
getWalkingAreas();
341 for (std::vector<NBNode::WalkingArea>::const_iterator it = WalkingAreas.begin(); it != WalkingAreas.end(); it++) {
347 NBEdge::UNSPECIFIED_OFFSET, std::map<int, double>(), wa.
width, wa.
shape, 0, wa.
length, 0,
"",
false, wa.
hasCustomShape);
385 const std::vector<NBEdge::Lane>& lanes = e.
getLanes();
388 for (
int i = 0; i < (int) lanes.size(); i++) {
390 std::map<int, double> stopOffsets;
407 double endOffset, std::map<SVCPermissions, double> stopOffsets,
double width,
PositionVector shape,
409 const std::string& oppositeID,
bool accelRamp,
bool customShape) {
421 WRITE_WARNING(
"Lane '" + lID +
"' has a maximum allowed speed of 0.");
422 }
else if (speed < 0) {
423 throw ProcessError(
"Negative allowed speed (" +
toString(speed) +
") on lane '" + lID +
"', use --speed.minimum to prevent this.");
426 length = length - endOffset;
445 if (stopOffsets.size() != 0) {
449 if (oppositeID !=
"" && oppositeID !=
"-") {
470 std::string incLanes;
472 for (std::vector<NBEdge*>::const_iterator i = incoming.begin(); i != incoming.end(); ++i) {
473 int noLanes = (*i)->getNumLanes();
474 for (
int j = 0; j < noLanes; j++) {
475 incLanes += (*i)->getLaneID(j);
476 if (i != incoming.end() - 1 || j < noLanes - 1) {
481 std::vector<NBNode::Crossing*> crossings = n.
getCrossings();
482 std::set<std::string> prevWAs;
484 for (
auto c : crossings) {
485 if (prevWAs.count(c->prevWalkingArea) == 0) {
486 incLanes +=
' ' + c->prevWalkingArea +
"_0";
487 prevWAs.insert(c->prevWalkingArea);
492 std::string intLanes;
495 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
496 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
497 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
498 if ((*k).toEdge == 0) {
505 intLanes += (*k).getInternalLaneID();
507 intLanes += (*k).viaID +
"_0";
514 for (
auto c : crossings) {
515 intLanes +=
' ' + c->id +
"_0";
543 std::vector<std::string> internalLaneIDs;
544 std::map<std::string, std::string> viaIDs;
545 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
546 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
547 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
548 if ((*k).toEdge != 0) {
549 internalLaneIDs.push_back((*k).getInternalLaneID());
550 viaIDs[(*k).getInternalLaneID()] = ((*k).viaID);
555 internalLaneIDs.push_back(c->id +
"_0");
558 for (std::vector<NBEdge*>::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
559 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
560 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
561 if ((*k).toEdge == 0 || !(*k).haveVia) {
568 std::string incLanes = (*k).getInternalLaneID();
569 std::vector<std::string> foeIDs;
570 for (std::string incLane : (*k).foeIncomingLanes) {
571 incLanes +=
" " + incLane;
572 if (incLane[0] ==
':' && viaIDs[incLane] !=
"") {
574 foeIDs.push_back(viaIDs[incLane] +
"_0");
578 const std::vector<int>& foes = (*k).foeInternalLinks;
579 for (std::vector<int>::const_iterator it = foes.begin(); it != foes.end(); ++it) {
580 foeIDs.push_back(internalLaneIDs[*it]);
621 if (style !=
PLAIN) {
622 if (includeInternal) {
650 for (std::vector<NBEdge*>::const_iterator i = incoming.begin(); i != incoming.end(); ++i) {
652 const std::vector<NBEdge::Connection>& connections = from->
getConnections();
653 for (std::vector<NBEdge::Connection>::const_iterator j = connections.begin(); j != connections.end(); ++j) {
674 const std::string& from,
const std::string& to,
675 int fromLane,
int toLane,
const std::string& via,
700 std::vector<std::vector<std::string> > edgeIDs;
701 for (std::set<EdgeSet>::const_iterator i = roundabouts.begin(); i != roundabouts.end(); ++i) {
702 std::vector<std::string> tEdgeIDs;
703 for (EdgeSet::const_iterator j = (*i).begin(); j != (*i).end(); ++j) {
706 tEdgeIDs.push_back((*j)->getID());
708 std::sort(tEdgeIDs.begin(), tEdgeIDs.end());
709 edgeIDs.push_back(tEdgeIDs);
711 std::sort(edgeIDs.begin(), edgeIDs.end());
713 for (std::vector<std::vector<std::string> >::const_iterator i = edgeIDs.begin(); i != edgeIDs.end(); ++i) {
716 if (roundabouts.size() != 0) {
725 std::vector<std::string> validEdgeIDs;
726 std::vector<std::string> invalidEdgeIDs;
727 std::vector<std::string> nodeIDs;
728 for (std::vector<std::string>::const_iterator i = edgeIDs.begin(); i != edgeIDs.end(); ++i) {
732 validEdgeIDs.push_back(edge->
getID());
734 invalidEdgeIDs.push_back(*i);
737 std::sort(nodeIDs.begin(), nodeIDs.end());
738 if (validEdgeIDs.size() > 0) {
743 if (invalidEdgeIDs.size() > 0) {
745 +
joinToString(invalidEdgeIDs,
" ") +
"' no longer exist'");
764 for (
int i = 0; i < (int)sources.size(); i++) {
771 for (
int i = 0; i < (int)sinks.size(); i++) {
784 if (time == std::floor(time)) {
794 for (NBConnectionProhibits::const_iterator j = prohibitions.begin(); j != prohibitions.end(); j++) {
797 for (NBConnectionVector::const_iterator k = prohibiting.begin(); k != prohibiting.end(); k++) {
816 std::vector<NBTrafficLightLogic*> logics = tllCont.
getComputed();
817 for (std::vector<NBTrafficLightLogic*>::iterator it = logics.begin(); it != logics.end(); it++) {
824 const bool varPhaseLength = (*it)->getType() !=
TLTYPE_STATIC;
825 const std::vector<NBTrafficLightLogic::PhaseDefinition>& phases = (*it)->getPhases();
826 for (std::vector<NBTrafficLightLogic::PhaseDefinition>::const_iterator j = phases.begin(); j != phases.end(); ++j) {
833 if (varPhaseLength) {
844 (*it)->writeParams(into);
847 if (logics.size() > 0) {
855 if (stopOffsets.size() == 0) {
858 assert(stopOffsets.size() == 1);
859 std::pair<int, double> offset = *stopOffsets.begin();
861 if (ss_vclasses.length() == 0) {
867 if (ss_vclasses.length() <= ss_exceptions.length()) {
870 if (ss_exceptions.length() == 0) {
static void writeRoundabout(OutputDevice &into, const std::vector< std::string > &r, const NBEdgeCont &ec)
Writes a roundabout.
bool getKeepClear() const
Returns the keepClear flag.
LaneSpreadFunction getLaneSpreadFunction() const
Returns how this edge's lanes' lateral offset is computed.
std::string id
id of Connection
The information about how to spread the lanes from the given position.
std::string getVehicleClassNames(SVCPermissions permissions, bool expand)
Returns the ids of the given classes, divided using a ' '.
void writePermissions(OutputDevice &into, SVCPermissions permissions)
writes allowed disallowed attributes if needed;
OutputDevice & writeAttr(const SumoXMLAttr attr, const T &val)
writes a named attribute
void close()
Closes the device and removes it from the dictionary.
static void writeLocation(OutputDevice &into)
writes the location element
A structure which describes a connection between edges or lanes.
const std::vector< NBEdge * > & getSourceEdges() const
Returns the sources.
LinkState getLinkState(const NBEdge *incoming, NBEdge *outgoing, int fromLane, int toLane, bool mayDefinitelyPass, const std::string &tlID) const
get link state
int toLane
The lane the connections yields in.
a list of node ids, used for controlling joining
NBTypeCont & getTypeCont()
Returns a reference to the type container.
int getInt(const std::string &name) const
Returns the int-value of the named option (only for Option_Integer)
Whether vehicles must keep the junction clear.
PositionVector shape
The lane's shape.
whether a given shape is user-defined
a source within a district (connection road)
const std::map< int, double > & getStopOffsets() const
Returns the stopOffset to the end of the edge.
static void writeDistrict(OutputDevice &into, const NBDistrict &d)
Writes a district.
std::map< std::string, NBNode * >::const_iterator begin() const
Returns the pointer to the begin of the stored nodes.
std::string viaID
if Connection have a via, ID of it
NBEdge * toEdge
The edge the connections yields in.
begin/end of the description of a junction
begin/end of the description of a single lane
static const double UNSPECIFIED_VISIBILITY_DISTANCE
unspecified foe visibility for connections
std::map< std::string, NBNode * >::const_iterator end() const
Returns the pointer to the end of the stored nodes.
A container for traffic light definitions and built programs.
a traffic assignment zone
void writePreferences(OutputDevice &into, SVCPermissions preferred)
writes allowed disallowed attributes if needed;
connectio between two lanes
std::vector< Crossing * > getCrossings() const
return this junctions pedestrian crossings
int getPriority() const
Returns the priority of the edge.
double length
This lane's width.
const std::string & getTypeID() const
get ID of type
int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
bool hasCustomShape() const
return whether the shape was set by the user
std::map< std::string, NBDistrict * >::const_iterator end() const
Returns the pointer to the end of the stored districts.
The representation of a single edge during network building.
foe visibility distance of a link
static void writeProhibitions(OutputDevice &into, const NBConnectionProhibits &prohibitions)
writes the given prohibitions
static const double UNSPECIFIED_RADIUS
unspecified lane width
A container for districts.
static const double UNSPECIFIED_OFFSET
unspecified lane offset
link,node: the traffic light id responsible for this link
bool hasCustomShape
whether this walkingArea has a custom shape
bool hasLoadedLength() const
Returns whether a length was set explicitly.
static const SUMOTime UNSPECIFIED_DURATION
Crossing * getCrossing(const std::string &id) const
return the crossing with the given id
const std::vector< NBEdge::Lane > & getLanes() const
Returns the lane definitions.
bool mayDefinitelyPass
Information about being definitely free to drive (on-ramps)
double endOffset
This lane's offset to the intersection begin.
NBEdge * getFrom() const
returns the from-edge (start of the connection)
double visibility
custom foe visiblity for connection
std::string id
the (edge)-id of this walkingArea
std::map< std::string, NBEdge * >::const_iterator end() const
Returns the pointer to the end of the stored edges.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
maximum duration of a phase
const std::string & getID() const
Returns the id.
std::map< std::string, NBDistrict * >::const_iterator begin() const
Returns the pointer to the begin of the stored districts.
bool isDefault(const std::string &name) const
Returns the information whether the named option has still the default value.
const SVCPermissions SVCAll
all VClasses are allowed
static void writeTrafficLights(OutputDevice &into, const NBTrafficLightLogicCont &tllCont)
writes the traffic light logics to the given device
static std::string getOppositeInternalID(const NBEdgeCont &ec, const NBEdge *from, const NBEdge::Connection &con)
retrieve the id of the opposite direction internal lane if it exists
static const double UNSPECIFIED_WIDTH
unspecified lane width
prohibition of circulation between two edges
PositionVector customShape
custom shape for connection
#define WRITE_WARNING(msg)
static OptionsCont & getOptions()
Retrieves the options.
static void writeStopOffsets(OutputDevice &into, const std::map< SVCPermissions, double > &stopOffsets)
Write a stopOffset element into output device.
bool accelRamp
Whether this lane is an acceleration lane.
bool priority
whether the pedestrians have priority
LinkDirection
The different directions a link between two lanes may take (or a stream between two edges)...
The link is a straight direction.
static const double UNSPECIFIED_SPEED
unspecified lane speed
PositionVector shape
shape of Connection
A class representing a single district.
bool keepClear
whether the junction must be kept clear when using this connection
static std::string prohibitionConnection(const NBConnection &c)
the attribute value for a prohibition
An (internal) definition of a single lane of an edge.
bool isSet(const std::string &name, bool failOnNonExistant=true) const
Returns the information whether the named option is set.
SVCPermissions permissions
List of vehicle types that are allowed on this lane.
static void writeNetwork(const OptionsCont &oc, NBNetBuilder &nb)
Writes the network into a SUMO-file.
bool writeLogic(OutputDevice &into, const bool checkLaneFoes) const
writes the XML-representation of the logic as a bitset-logic XML representation
static const int InvalidTlIndex
The turning radius at an intersection in m.
std::map< std::string, NBEdge * >::const_iterator begin() const
Returns the pointer to the begin of the stored edges.
double speed
custom speed for connection
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
std::string tlID
The id of the traffic light that controls this connection.
SVCPermissions preferred
List of vehicle types that are preferred on this lane.
This is an uncontrolled, minor link, has to brake.
const PositionVector & getShape() const
Returns the shape.
std::string getLaneID(int lane) const
get Lane ID (Secure)
static bool writeInternalConnections(OutputDevice &into, const NBNode &n)
Writes inner connections within the node.
int fromLane
The lane the connections starts at.
bool writeXMLHeader(const std::string &rootElement, const std::string &schemaFile, std::map< SumoXMLAttr, std::string > attrs=std::map< SumoXMLAttr, std::string >())
Writes an XML header with optional configuration.
A point in 2D or 3D with translation and scaling methods.
NBEdgeCont & getEdgeCont()
static const double UNSPECIFIED_CONTPOS
unspecified internal junction position
std::string getString(const std::string &name) const
Returns the string-value of the named option (only for Option_String)
static void writeInternalConnection(OutputDevice &into, const std::string &from, const std::string &to, int fromLane, int toLane, const std::string &via, LinkDirection dir=LINKDIR_STRAIGHT, const std::string &tlID="", int linkIndex=NBConnection::InvalidTlIndex)
Writes a single internal connection.
bool isConstantWidthTransition() const
detects whether a given junction splits or merges lanes while keeping constant road width ...
bool hasDefaultGeometry() const
Returns whether the geometry consists only of the node positions.
LinkState
The right-of-way state of a link between two lanes used when constructing a NBTrafficLightLogic, in MSLink and GNEInternalLane.
roundabout defined in junction
Storage for edges, including some functionality operating on multiple edges.
const std::string & getStreetName() const
Returns the street name of this edge.
const std::set< EdgeSet > getRoundabouts() const
Returns the determined roundabouts.
static void writePositionLong(const Position &pos, OutputDevice &dev)
Writes the given position to device in long format (one attribute per dimension)
edge: the shape in xml-definition
PositionVector getSubpart(double beginOffset, double endOffset) const
get subpart of a position vector
begin/end of the description of a neighboring lane
An upper class for objects with additional parameters.
static std::string escapeXML(const std::string &orig, const bool maskDoubleHyphen=false)
Replaces the standard escapes by their XML entities.
double speed
The speed allowed on this lane.
double width
This lane's width.
double getFloat(const std::string &name) const
Returns the double-value of the named option (only for Option_Float)
double getFinalLength() const
get length that will be assigned to the lanes in the final network
int tlLinkIndex
The index of this connection within the controlling traffic light.
std::vector< NBConnection > NBConnectionVector
Definition of a connection vector.
void writeParams(OutputDevice &device) const
write Params in the given outputdevice
begin/end of the description of an edge
static void normaliseSum(std::vector< T > &v, T msum=1.0)
int size() const
Returns the number of districts inside the container.
LinkDirection getDirection(const NBEdge *const incoming, const NBEdge *const outgoing, bool leftHand=false) const
Returns the representation of the described stream's direction.
const PositionVector & getShape() const
retrieve the junction shape
PositionVector simplified() const
return the same shape with intermediate colinear points removed
NBEdge * getTo() const
returns the to-edge (end of the connection)
int internalLaneIndex
The lane index of this internal lane within the internal edge.
const PositionVector & getGeometry() const
Returns the geometry of the edge.
const std::vector< double > & getSinkWeights() const
Returns the weights of the sinks.
double length() const
Returns the length.
std::map< NBConnection, NBConnectionVector > NBConnectionProhibits
Definition of a container for connection block dependencies Includes a list of all connections which ...
std::vector< NBTrafficLightLogic * > getComputed() const
Returns a list of all computed logics.
double getRadius() const
Returns the turning radius of this node.
std::string oppositeID
An opposite lane ID, if given.
a sink within a district (connection road)
the edges crossed by a pedestrian crossing
const EdgeVector & getIncomingEdges() const
Returns this node's incoming edges (The edges which yield in this node)
const std::vector< Connection > & getConnections() const
Returns the connections.
NBNodeCont & getNodeCont()
Returns a reference to the node container.
std::map< int, double > stopOffsets
stopOffsets.second - The stop offset for vehicles stopping at the lane's end. Applies if vClass is in...
Instance responsible for building networks.
static OutputDevice & getDevice(const std::string &name)
Returns the described OutputDevice.
static void interpretLaneID(const std::string &lane_id, std::string &edge_id, int &index)
parses edge-id and index from lane-id
std::vector< NBEdge * > EdgeVector
container for (sorted) edges
static bool writeInternalNodes(OutputDevice &into, const NBNode &n)
Writes internal junctions (<junction with id[0]==':' ...) of the given node.
NBEdge * retrieve(const std::string &id, bool retrieveExtracted=false) const
Returns the edge that has the given id.
const std::vector< NBEdge * > & getSinkEdges() const
Returns the sinks.
A definition of a pedestrian walking area.
double contPos
custom position for internal junction on this connection
A storage for options typed value containers)
bool uncontrolled
check if Connection is uncontrolled
SumoXMLNodeType getType() const
Returns the type of this node.
This is an uncontrolled, major link, may pass.
NBTrafficLightLogicCont & getTLLogicCont()
Returns a reference to the traffic light logics container.
static void writeLane(OutputDevice &into, const std::string &lID, double speed, SVCPermissions permissions, SVCPermissions preferred, double endOffset, std::map< SVCPermissions, double > stopOffsets, double width, PositionVector shape, const Parameterised *params, double length, int index, const std::string &oppositeID, bool accelRamp=false, bool customShape=false)
Writes a lane (<lane ...) of an edge.
The abstract direction of a link.
int tlLinkIndex
the traffic light index of this crossing (if controlled)
const Position & getPosition() const
Represents a single node (junction) during network building.
A definition of a pedestrian crossing.
const std::vector< WalkingArea > & getWalkingAreas() const
return this junctions pedestrian walking areas
Static storage of an output device and its base (abstract) implementation.
bool closeTag(const std::string &comment="")
Closes the most recently opened tag and optionally adds a comment.
static void writeJunction(OutputDevice &into, const NBNode &n, const bool checkLaneFoes)
Writes a junction (<junction ...)
link: the index of the link within the traffic light
std::string tlID
The id of the traffic light that controls this connection.
bool isMacroscopicConnector() const
Returns whether this edge was marked as a macroscopic connector.
const std::vector< double > & getSourceWeights() const
Returns the weights of the sources.
NBNode * getFromNode() const
Returns the origin node of the edge.
Container for nodes during the netbuilding process.
std::string getInternalLaneID() const
get ID of internal lane
static bool writeInternalEdges(OutputDevice &into, const NBEdgeCont &ec, const NBNode &n)
Writes internal edges (<edge ... with id[0]==':') of the given node.
static void writeEdge(OutputDevice &into, const NBEdge &e, bool noNames)
Writes an edge (<edge ...)
bool haveVia
check if Connection have a Via
double getLoadedLength() const
Returns the length was set explicitly or the computed length if it wasn't set.
NBDistrictCont & getDistrictCont()
Returns a reference the districts container.
PositionVector customShape
A custom shape for this lane set by the user.
OutputDevice & writePadding(const std::string &val)
writes padding (ignored for binary output)
static const std::string MAJOR_VERSION
The version number for written files.
static void writeRoundabouts(OutputDevice &into, const std::set< EdgeSet > &roundabouts, const NBEdgeCont &ec)
Writes roundabouts.
NBNode * getToNode() const
Returns the destination node of the edge.
a single phase description
static std::string writeSUMOTime(SUMOTime time)
writes a SUMOTime as int if possible, otherwise as a float
std::string joinToString(const std::vector< T > &v, const T_BETWEEN &between, std::streamsize accuracy=gPrecision)
OutputDevice & openTag(const std::string &xmlElement)
Opens an XML tag.
void lf()
writes a line feed if applicable
const SVCPermissions SVC_UNSPECIFIED
permissions not specified
static void writeConnection(OutputDevice &into, const NBEdge &from, const NBEdge::Connection &c, bool includeInternal, ConnectionStyle style=SUMONET)
Writes connections outgoing from the given edge (also used in NWWriter_XML)
PositionVector shape
The polygonal shape.
void writeTypes(OutputDevice &into) const
writes all types a s XML
The link has no direction (is a dead end link)
double width
This lane's width.
Information on vClass specific stop offsets at lane end.