59 if (!oc.
isSet(
"output-file")) {
63 std::map<SumoXMLAttr, std::string> attrs;
68 const int cornerDetail = oc.
getInt(
"junctions.corner-detail");
69 if (cornerDetail > 0) {
72 if (!oc.
isDefault(
"junctions.internal-link-detail")) {
75 if (oc.
getBool(
"rectangular-lane-cut")) {
81 if (oc.
getFloat(
"junctions.limit-turn-speed") > 0) {
84 if (!oc.
isDefault(
"check-lane-foes.all")) {
87 if (!oc.
isDefault(
"check-lane-foes.roundabout")) {
104 if (!oc.
getBool(
"no-internal-links")) {
106 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
115 bool noNames = !oc.
getBool(
"output.street-names");
116 for (std::map<std::string, NBEdge*>::const_iterator i = ec.
begin(); i != ec.
end(); ++i) {
117 writeEdge(device, *(*i).second, noNames);
125 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
129 const bool includeInternal = !oc.
getBool(
"no-internal-links");
130 if (includeInternal) {
133 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
142 int numConnections = 0;
143 for (std::map<std::string, NBEdge*>::const_iterator it_edge = ec.
begin(); it_edge != ec.
end(); it_edge++) {
144 NBEdge* from = it_edge->second;
145 const std::vector<NBEdge::Connection> connections = from->
getConnections();
146 numConnections += (int)connections.size();
147 for (std::vector<NBEdge::Connection>::const_iterator it_c = connections.begin(); it_c != connections.end(); it_c++) {
151 if (numConnections > 0) {
154 if (includeInternal) {
157 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
164 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
165 NBNode* node = (*i).second;
167 std::vector<NBNode::Crossing*> crossings = node->
getCrossings();
168 for (
auto c : crossings) {
173 for (
const std::string& cID : wa.nextCrossings) {
181 if (nextCrossing.
tlID !=
"") {
193 for (
const std::string& sw : wa.nextSidewalks) {
197 for (
const std::string& sw : wa.prevSidewalks) {
205 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
213 for (std::map<std::string, NBDistrict*>::const_iterator i = dc.
begin(); i != dc.
end(); i++) {
216 if (dc.
size() != 0) {
229 #ifdef DEBUG_OPPOSITE_INTERNAL 235 assert(succOpp != 0);
236 assert(predOpp != 0);
237 const std::vector<NBEdge::Connection>& connections = succOpp->
getConnections();
238 for (std::vector<NBEdge::Connection>::const_iterator it_c = connections.begin(); it_c != connections.end(); it_c++) {
241 && predOpp == conOpp.
toEdge 247 #ifdef DEBUG_OPPOSITE_INTERNAL 250 oppositeLength = conOpp.
length;
281 std::map<std::string, std::string> oppositeLaneID;
282 std::map<std::string, double> oppositeLengths;
283 for (
NBEdge* e : incoming) {
285 double oppositeLength = 0;
287 oppositeLaneID[c.getInternalLaneID()] = op;
289 oppositeLengths[c.id] = oppositeLength;
293 if (oppositeLengths.size() > 0) {
294 for (
NBEdge* e : incoming) {
296 if (oppositeLengths.count(c.id) > 0) {
297 c.length = (c.length + oppositeLengths[c.id]) / 2;
303 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
304 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
305 if (elv.size() > 0) {
306 bool haveVia =
false;
307 std::string edgeID =
"";
309 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
310 if ((*k).toEdge ==
nullptr) {
314 if (edgeID != (*k).id) {
327 const NBEdge::Lane& successor = (*k).toEdge->getLanes()[(*k).toLane];
328 const double width = n.
isConstantWidthTransition() && (*i)->getNumLanes() > (*k).toEdge->getNumLanes() ? (*i)->getLaneWidth((*k).fromLane) : successor.
width;
329 writeLane(into, (*k).getInternalLaneID(), (*k).vmax,
332 (*k).length, (*k).internalLaneIndex, oppositeLaneID[(*k).getInternalLaneID()]);
333 haveVia = haveVia || (*k).haveVia;
339 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
343 if ((*k).toEdge ==
nullptr) {
347 const NBEdge::Lane& successor = (*k).toEdge->getLanes()[(*k).toLane];
367 NBEdge::UNSPECIFIED_OFFSET, std::map<int, double>(), c->width, c->shape,
nullptr,
MAX2(c->shape.length(),
POSITION_EPS), 0,
"",
false, c->customShape.size() != 0);
371 const std::vector<NBNode::WalkingArea>& WalkingAreas = n.
getWalkingAreas();
372 for (std::vector<NBNode::WalkingArea>::const_iterator it = WalkingAreas.begin(); it != WalkingAreas.end(); it++) {
378 NBEdge::UNSPECIFIED_OFFSET, std::map<int, double>(), wa.
width, wa.
shape,
nullptr, wa.
length, 0,
"",
false, wa.
hasCustomShape);
419 const std::vector<NBEdge::Lane>& lanes = e.
getLanes();
422 for (
int i = 0; i < (int) lanes.size(); i++) {
424 std::map<int, double> stopOffsets;
441 double endOffset, std::map<SVCPermissions, double> stopOffsets,
double width,
PositionVector shape,
443 const std::string& oppositeID,
bool accelRamp,
bool customShape) {
455 WRITE_WARNING(
"Lane '" + lID +
"' has a maximum allowed speed of 0.");
456 }
else if (speed < 0) {
457 throw ProcessError(
"Negative allowed speed (" +
toString(speed) +
") on lane '" + lID +
"', use --speed.minimum to prevent this.");
460 length = length - endOffset;
479 if (stopOffsets.size() != 0) {
483 if (oppositeID !=
"" && oppositeID !=
"-") {
489 if (params !=
nullptr) {
504 std::string incLanes;
506 for (std::vector<NBEdge*>::const_iterator i = incoming.begin(); i != incoming.end(); ++i) {
507 int noLanes = (*i)->getNumLanes();
508 for (
int j = 0; j < noLanes; j++) {
509 incLanes += (*i)->getLaneID(j);
510 if (i != incoming.end() - 1 || j < noLanes - 1) {
515 std::vector<NBNode::Crossing*> crossings = n.
getCrossings();
516 std::set<std::string> prevWAs;
518 for (
auto c : crossings) {
519 if (prevWAs.count(c->prevWalkingArea) == 0) {
520 incLanes +=
' ' + c->prevWalkingArea +
"_0";
521 prevWAs.insert(c->prevWalkingArea);
526 std::string intLanes;
529 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
530 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
531 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
532 if ((*k).toEdge ==
nullptr) {
539 intLanes += (*k).getInternalLaneID();
541 intLanes += (*k).viaID +
"_0";
548 for (
auto c : crossings) {
549 intLanes +=
' ' + c->id +
"_0";
580 std::vector<std::string> internalLaneIDs;
581 std::map<std::string, std::string> viaIDs;
582 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
583 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
584 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
585 if ((*k).toEdge !=
nullptr) {
586 internalLaneIDs.push_back((*k).getInternalLaneID());
587 viaIDs[(*k).getInternalLaneID()] = ((*k).viaID);
592 internalLaneIDs.push_back(c->id +
"_0");
595 for (std::vector<NBEdge*>::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
596 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
597 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
598 if ((*k).toEdge ==
nullptr || !(*k).haveVia) {
605 std::string incLanes = (*k).getInternalLaneID();
606 std::vector<std::string> foeIDs;
607 for (std::string incLane : (*k).foeIncomingLanes) {
608 incLanes +=
" " + incLane;
609 if (incLane[0] ==
':' && viaIDs[incLane] !=
"") {
611 foeIDs.push_back(viaIDs[incLane] +
"_0");
615 const std::vector<int>& foes = (*k).foeInternalLinks;
616 for (std::vector<int>::const_iterator it = foes.begin(); it != foes.end(); ++it) {
617 foeIDs.push_back(internalLaneIDs[*it]);
658 if (style !=
PLAIN) {
659 if (includeInternal) {
687 for (std::vector<NBEdge*>::const_iterator i = incoming.begin(); i != incoming.end(); ++i) {
689 const std::vector<NBEdge::Connection>& connections = from->
getConnections();
690 for (std::vector<NBEdge::Connection>::const_iterator j = connections.begin(); j != connections.end(); ++j) {
711 const std::string& from,
const std::string& to,
712 int fromLane,
int toLane,
const std::string& via,
737 std::vector<std::vector<std::string> > edgeIDs;
738 for (std::set<EdgeSet>::const_iterator i = roundabouts.begin(); i != roundabouts.end(); ++i) {
739 std::vector<std::string> tEdgeIDs;
740 for (EdgeSet::const_iterator j = (*i).begin(); j != (*i).end(); ++j) {
743 tEdgeIDs.push_back((*j)->getID());
745 std::sort(tEdgeIDs.begin(), tEdgeIDs.end());
746 edgeIDs.push_back(tEdgeIDs);
748 std::sort(edgeIDs.begin(), edgeIDs.end());
750 for (std::vector<std::vector<std::string> >::const_iterator i = edgeIDs.begin(); i != edgeIDs.end(); ++i) {
753 if (roundabouts.size() != 0) {
762 std::vector<std::string> validEdgeIDs;
763 std::vector<std::string> invalidEdgeIDs;
764 std::vector<std::string> nodeIDs;
765 for (std::vector<std::string>::const_iterator i = edgeIDs.begin(); i != edgeIDs.end(); ++i) {
767 if (edge !=
nullptr) {
769 validEdgeIDs.push_back(edge->
getID());
771 invalidEdgeIDs.push_back(*i);
774 std::sort(nodeIDs.begin(), nodeIDs.end());
775 if (validEdgeIDs.size() > 0) {
780 if (invalidEdgeIDs.size() > 0) {
782 +
joinToString(invalidEdgeIDs,
" ") +
"' no longer exist'");
801 for (
int i = 0; i < (int)sources.size(); i++) {
808 for (
int i = 0; i < (int)sinks.size(); i++) {
821 if (time == std::floor(time)) {
831 for (NBConnectionProhibits::const_iterator j = prohibitions.begin(); j != prohibitions.end(); j++) {
834 for (NBConnectionVector::const_iterator k = prohibiting.begin(); k != prohibiting.end(); k++) {
853 std::vector<NBTrafficLightLogic*> logics = tllCont.
getComputed();
854 for (std::vector<NBTrafficLightLogic*>::iterator it = logics.begin(); it != logics.end(); it++) {
861 const bool varPhaseLength = (*it)->getType() !=
TLTYPE_STATIC;
862 const std::vector<NBTrafficLightLogic::PhaseDefinition>& phases = (*it)->getPhases();
863 for (std::vector<NBTrafficLightLogic::PhaseDefinition>::const_iterator j = phases.begin(); j != phases.end(); ++j) {
870 if (varPhaseLength) {
881 (*it)->writeParams(into);
884 if (logics.size() > 0) {
892 if (stopOffsets.size() == 0) {
895 assert(stopOffsets.size() == 1);
896 std::pair<int, double> offset = *stopOffsets.begin();
898 if (ss_vclasses.length() == 0) {
904 if (ss_vclasses.length() <= ss_exceptions.length()) {
907 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
bool isBidiRail(bool ignoreSpread=false) const
whether this edge is part of a bidirectional railway
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
double length
computed length (average of all internal lane shape lengths that share an internal edge) ...
bool hasLoadedLength() const
Returns whether a length was set explicitly.
NBEdge * getTurnDestination(bool possibleDestination=false) const
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.
static void writeTrafficLights(OutputDevice &into, const NBTrafficLightLogicCont &tllCont)
writes the traffic light logics to the given device
std::string getDescription(const NBEdge *parent) const
get string describing this connection
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
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.
How to compute right of way.
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)
bool writeLogic(OutputDevice &into) const
writes the XML-representation of the logic as a bitset-logic XML representation
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.
static std::string getOppositeInternalID(const NBEdgeCont &ec, const NBEdge *from, const NBEdge::Connection &con, double &oppositeLength)
retrieve the id of the opposite direction internal lane if it exists
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.
RightOfWay getRightOfWay() const
Returns hint on how to compute right of way.
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.
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
static void writeJunction(OutputDevice &into, const NBNode &n)
Writes a junction (<junction ...)
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.