58 #ifdef CHECK_MEMORY_LEAKS 60 #endif // CHECK_MEMORY_LEAKS 69 myVehicleClasses2Keep(0),
70 myVehicleClasses2Remove(0),
71 myNeedGeoTransformedPrunningBoundary(false)
86 if (oc.
isSet(
"keep-edges.input-file")) {
89 if (oc.
isSet(
"remove-edges.input-file")) {
92 if (oc.
isSet(
"keep-edges.explicit")) {
93 const std::vector<std::string> edges = oc.
getStringVector(
"keep-edges.explicit");
96 if (oc.
isSet(
"remove-edges.explicit")) {
97 const std::vector<std::string> edges = oc.
getStringVector(
"remove-edges.explicit");
100 if (oc.
exists(
"keep-edges.by-vclass") && oc.
isSet(
"keep-edges.by-vclass")) {
103 if (oc.
exists(
"remove-edges.by-vclass") && oc.
isSet(
"remove-edges.by-vclass")) {
106 if (oc.
exists(
"keep-edges.by-type") && oc.
isSet(
"keep-edges.by-type")) {
107 const std::vector<std::string> types = oc.
getStringVector(
"keep-edges.by-type");
110 if (oc.
exists(
"remove-edges.by-type") && oc.
isSet(
"remove-edges.by-type")) {
111 const std::vector<std::string> types = oc.
getStringVector(
"remove-edges.by-type");
115 if (oc.
isSet(
"keep-edges.in-boundary") || oc.
isSet(
"keep-edges.in-geo-boundary")) {
117 "keep-edges.in-boundary" :
"keep-edges.in-geo-boundary");
119 std::vector<SUMOReal> poly;
120 for (std::vector<std::string>::iterator i = polyS.begin(); i != polyS.end(); ++i) {
123 if (poly.size() < 4) {
124 throw ProcessError(
"Invalid boundary: need at least 2 coordinates");
125 }
else if (poly.size() % 2 != 0) {
126 throw ProcessError(
"Invalid boundary: malformed coordinate");
127 }
else if (poly.size() == 4) {
134 for (std::vector<SUMOReal>::iterator j = poly.begin(); j != poly.end();) {
147 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
172 if (oc.
exists(
"dismiss-vclasses") && oc.
getBool(
"dismiss-vclasses")) {
230 WRITE_ERROR(
"Cannot prune edges using a geo-boundary because no projection has been loaded");
247 EdgeCont::const_iterator i =
myEdges.find(
id);
249 if (retrieveExtracted) {
290 if (downstream ==
true) {
314 hints.push_back(hintedge);
317 for (EdgeVector::iterator i = hints.begin(); i != hints.end(); i++) {
319 for (EdgeVector::iterator j = candidates.begin(); j != candidates.end(); j++) {
320 NBEdge* poss_searched = (*j);
322 ? poss_searched->
myTo : poss_searched->
myFrom;
325 if (find(cont.begin(), cont.end(), hintedge) != cont.end()) {
326 return poss_searched;
341 size_t maxLength = 0;
342 std::string tid =
id +
"[";
343 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
344 if ((*i).first.find(tid) == 0) {
345 maxLength =
MAX2(maxLength, (*i).first.length());
350 std::vector<std::string> names;
351 names.push_back(
id +
"[1]");
352 names.push_back(
id +
"[0]");
353 while (names.size() > 0) {
355 std::string cid = names.back();
361 if (cid.length() + 3 < maxLength) {
362 names.push_back(cid +
"[1]");
363 names.push_back(cid +
"[0]");
400 if (
myEdges.count(newID) != 0) {
401 throw ProcessError(
"Attempt to rename edge using existing id '" + newID +
"'");
413 (
unsigned int) edge->
myLanes.size(), (
unsigned int) edge->
myLanes.size());
419 const std::string& firstEdgeName,
420 const std::string& secondEdgeName,
421 unsigned int noLanesFirstEdge,
unsigned int noLanesSecondEdge,
423 const int changedLeft) {
434 return splitAt(dc, edge, pos, node, firstEdgeName, secondEdgeName,
435 noLanesFirstEdge, noLanesSecondEdge, speed, changedLeft);
442 const std::string& firstEdgeName,
443 const std::string& secondEdgeName,
444 unsigned int noLanesFirstEdge,
unsigned int noLanesSecondEdge,
446 const int changedLeft
449 assert(changedLeft > -((
int)noLanesFirstEdge));
450 assert(changedLeft < (
int)noLanesSecondEdge);
453 std::pair<PositionVector, PositionVector> geoms =
456 geoms.first.pop_back();
464 NBEdge* one =
new NBEdge(firstEdgeName, edge->
myFrom, node, edge, geoms.first, noLanesFirstEdge);
465 NBEdge* two =
new NBEdge(secondEdgeName, node, edge->
myTo, edge, geoms.second, noLanesSecondEdge);
482 for (
int i2 = 0; i2 < (int)two->
getNumLanes(); i2++) {
509 std::vector<std::string>
511 std::vector<std::string> ret;
512 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
513 ret.push_back((*i).first);
523 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
524 NBEdge* edge = (*i).second;
528 toRemove.push_back(edge);
531 for (EdgeVector::iterator j = toRemove.begin(); j != toRemove.end(); ++j) {
539 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
540 if ((*i).second->getGeometry().size() < 3) {
543 (*i).second->splitGeometry(*
this, nc);
550 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
551 (*i).second->reduceGeometry(minDist);
558 if (maxAngle > 0 || minRadius > 0) {
559 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
560 (*i).second->checkGeometry(maxAngle, minRadius, fix);
569 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
570 (*i).second->clearControllingTLInformation();
577 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
578 (*i).second->sortOutgoingConnectionsByAngle();
585 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
586 (*i).second->computeEdge2Edges(noLeftMovers);
593 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
594 (*i).second->computeLanes2Edges();
601 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
602 (*i).second->recheckLanes();
609 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
610 (*i).second->appendTurnaround(noTLSControlled);
617 for (std::set<std::string>::const_iterator it = ids.begin(); it != ids.end(); it++) {
618 myEdges[*it]->appendTurnaround(noTLSControlled);
625 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
626 (*i).second->computeEdgeShape();
633 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
634 (*i).second->computeLaneShapes();
649 unsigned int nolanes = 0;
655 NBEdge* tpledge = *(edges.begin());
656 NBNode* from = tpledge->getFromNode();
657 NBNode* to = tpledge->getToNode();
658 EdgeVector::const_iterator i;
659 for (i = edges.begin(); i != edges.end(); i++) {
661 assert((*i)->getFromNode() == from);
662 assert((*i)->getToNode() == to);
664 nolanes += (*i)->getNumLanes();
666 if (i != edges.begin()) {
671 speed += (*i)->getSpeed();
673 priority =
MAX2(priority, (*i)->getPriority());
675 speed /= edges.size();
677 NBEdge* newEdge =
new NBEdge(
id, from, to,
"", speed, nolanes, priority,
679 tpledge->getStreetName(), tpledge->myLaneSpreadFunction);
682 for (i = edges.begin(); i != edges.end(); ++i) {
683 const std::vector<NBEdge::Lane>& lanes = (*i)->
getLanes();
684 for (
int j = 0; j < (int)lanes.size(); ++j) {
698 for (i = edges.begin(); i != edges.end(); i++) {
700 for (EdgeVector::iterator j = ev.begin(); j != ev.end(); j++) {
705 unsigned int currLane = 0;
706 for (i = edges.begin(); i != edges.end(); i++) {
708 currLane += (*i)->getNumLanes();
712 for (i = edges.begin(); i != edges.end(); i++) {
713 unsigned int noLanes = (*i)->getNumLanes();
714 for (
unsigned int j = 0; j < noLanes; j++, currLane++) {
720 for (i = edges.begin(); i != edges.end(); i++) {
728 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
729 std::string oppositeID;
730 if ((*i).first[0] ==
'-') {
731 oppositeID = (*i).first.substr(1);
733 oppositeID =
"-" + (*i).first;
758 if (from != 0 && to != 0) {
760 WRITE_WARNING(
"Could not insert connection between '" + (*i).from +
"' and '" + (*i).to +
"' after build.");
766 for (EdgeCont::iterator it =
myEdges.begin(); it !=
myEdges.end(); ++it) {
767 NBEdge* edge = it->second;
770 std::vector<NBEdge::Connection> connections = edge->
getConnections();
771 for (std::vector<NBEdge::Connection>::iterator it_con = connections.begin(); it_con != connections.end(); ++it_con) {
775 "' to edge '" + c.
toEdge->
getID() +
"' via junction '" + to->
getID() +
"'.");
785 size_t len =
id.length();
787 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
788 std::string curr = (*i).first;
791 if (curr.length() <= len) {
796 if (curr.substr(0, len) ==
id && curr[len] ==
'[') {
797 ret.push_back((*i).second);
801 size_t pos = curr.find(
id);
803 if (pos == std::string::npos) {
808 if (curr[pos - 1] !=
']' && curr[pos - 1] !=
'+') {
813 if (pos +
id.length() < curr.length()) {
814 if (curr[pos +
id.length()] !=
'[' && curr[pos +
id.length()] !=
'+') {
819 ret.push_back((*i).second);
828 std::set<NBEdge*> loadedRoundaboutEdges;
830 loadedRoundaboutEdges.insert(it->begin(), it->end());
834 std::set<NBEdge*> candidates;
835 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
839 candidates.insert(e);
844 std::set<NBEdge*> visited;
845 for (std::set<NBEdge*>::const_iterator i = candidates.begin(); i != candidates.end(); ++i) {
852 if (visited.count(e) > 0) {
856 loopEdges.push_back(e);
861 if (edges.size() < 2) {
870 EdgeVector::const_iterator me = find(edges.begin(), edges.end(), e);
879 EdgeVector::const_iterator loopClosed = find(loopEdges.begin(), loopEdges.end(), left);
880 const size_t loopSize = loopEdges.end() - loopClosed;
885 }
else if (loopSize < loopEdges.size()) {
887 EdgeVector(loopEdges.begin() + (loopEdges.size() - loopSize), loopEdges.end()).swap(loopEdges);
891 for (EdgeVector::const_iterator j = loopEdges.begin(); j != loopEdges.end(); ++j) {
892 if ((*j)->getToNode()->getEdges().size() > 2) {
896 if (attachments < 3) {
901 if (visited.count(left) > 0) {
905 loopEdges.push_back(left);
924 for (EdgeVector::const_iterator it = loopEdges.begin(); it != loopEdges.end(); ++it) {
925 points.
append((*it)->getGeometry());
928 return 4 *
M_PI * points.
area() / (circumference * circumference);
932 const std::set<EdgeSet>
953 for (std::set<EdgeSet>::const_iterator it = roundabouts.begin(); it != roundabouts.end(); ++it) {
954 const EdgeSet roundaboutSet = *it;
955 for (std::set<NBEdge*>::const_iterator j = roundaboutSet.begin(); j != roundaboutSet.end(); ++j) {
957 NBNode* node = (*j)->getToNode();
959 for (EdgeVector::const_iterator k = incoming.begin(); k != incoming.end(); ++k) {
961 if (roundaboutSet.count(inEdge) > 0) {
970 (*j)->setJunctionPriority(node, 1000);
978 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
1016 int sidewalksCreated = 0;
1018 std::set<std::string> exclude(edges.begin(), edges.end());
1019 for (EdgeCont::iterator it =
myEdges.begin(); it !=
myEdges.end(); it++) {
1020 NBEdge* edge = it->second;
1022 exclude.count(edge->
getID()) == 0
1029 || (!fromPermissions && edge->
getSpeed() > minSpeed && edge->
getSpeed() <= maxSpeed)
1032 sidewalksCreated += 1;
1035 return sidewalksCreated;
int guessSidewalks(SUMOReal width, SUMOReal minSpeed, SUMOReal maxSpeed, bool fromPermissions)
add sidwalks to edges within the given limits or permissions and return the number of edges affected ...
std::vector< Lane > myLanes
Lane information.
void replaceIncoming(NBEdge *which, NBEdge *by, unsigned int laneOff)
Replaces occurences of the first edge within the list of incoming by the second Connections are remap...
std::vector< std::string > getStringVector(const std::string &name) const
Returns the list of string-vector-value of the named option (only for Option_String) ...
const EdgeVector & getIncomingEdges() const
Returns this node's incoming edges.
const std::string & getTypeID() const
A structure which describes a connection between edges or lanes.
void sortOutgoingLanesConnections()
Sorts all lanes of all edges within the container by their direction.
void markRoundabouts()
mark edge priorities and prohibit turn-arounds for all roundabout edges
void setRoundabout()
update the type of this node as a roundabout
NBEdge * retrievePossiblySplit(const std::string &id, bool downstream) const
Tries to retrieve an edge, even if it is splitted.
static const SUMOReal UNSPECIFIED_WIDTH
unspecified lane width
A class representing a single street sign.
bool x2cartesian_const(Position &from) const
Converts the given coordinate into a cartesian using the previous initialisation. ...
SUMOReal nearest_offset_to_point2D(const Position &p, bool perpendicular=true) const
std::vector< std::string > getAllNames() const
Returns all ids of known edges.
static bool transformCoordinates(Position &from, bool includeInBoundary=true, GeoConvHelper *from_srs=0)
transforms loaded coordinates handles projections, offsets (using GeoConvHelper) and import of height...
void addSign(NBSign sign)
NBEdge * toEdge
The edge the connections yields in.
const std::set< EdgeSet > getRoundabouts() const
Returns the determined roundabouts.
static SUMOReal _2SUMOReal(const E *const data)
bool myNeedGeoTransformedPrunningBoundary
whether a geo transform has been applied to the pruning boundary
A container for traffic light definitions and built programs.
int guessRoundabouts()
Determines which edges belong to roundabouts and increases their priority.
void setLaneWidth(int lane, SUMOReal width)
set lane specific width (negative lane implies set for all lanes)
bool myRemoveEdgesAfterJoining
Whether edges shall be joined first, then removed.
void setSpeed(int lane, SUMOReal speed)
set lane specific speed (negative lane implies set for all lanes)
const std::vector< NBEdge::Lane > & getLanes() const
Returns the lane definitions.
void moveOutgoingConnectionsFrom(NBEdge *e, unsigned int laneOff)
void addSidewalk(SUMOReal width)
add a pedestrian sidewalk of the given width and shift existing connctions
static GeoConvHelper & getProcessing()
the coordinate transformation to use for input conversion and processing
void removeEdge(NBEdge *edge, bool removeFromConnections=true)
Removes edge from this node and optionally removes connections as well.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
The representation of a single edge during network building.
bool addLane2LaneConnection(unsigned int fromLane, NBEdge *dest, unsigned int toLane, Lane2LaneInfoType type, bool mayUseSameDestination=false, bool mayDefinitelyPass=false, bool keepClear=true, SUMOReal contPos=UNSPECIFIED_CONTPOS)
Adds a connection between the specified this edge's lane and an approached one.
A container for districts.
static GeoConvHelper & getLoaded()
the coordinate transformation that was loaded fron an input file
void clearControllingTLInformation() const
Clears information about controlling traffic lights for all connenections of all edges.
void setPermissions(SVCPermissions permissions, int lane=-1)
set allowed/disallowed classes for the given lane or for all lanes if -1 is given ...
void generateStreetSigns()
assigns street signs to edges based on toNode types
void rename(NBEdge *edge, const std::string &newID)
Renames the edge. Throws exception if newID already exists.
bool splitAt(NBDistrictCont &dc, NBEdge *edge, NBNode *node)
Splits the edge at the position nearest to the given node.
void recheckPostProcessConnections()
Try to set any stored connections.
SUMOReal getFloat(const std::string &name) const
Returns the SUMOReal-value of the named option (only for Option_Float)
static void nextCW(const EdgeVector &edges, EdgeVector::const_iterator &from)
unsigned int myEdgesSplit
the number of splits of edges during the building
static const SUMOReal UNSPECIFIED_OFFSET
unspecified lane offset
static void loadEdgesFromFile(const std::string &file, std::set< std::string > &into)
Add edge ids defined in file (either ID or edge::ID per line) into the given set. ...
void computeLanes2Edges()
Computes for each edge which lanes approach the next edges.
std::vector< PostProcessConnection > myConnections
The list of connections to recheck.
#define WRITE_WARNING(msg)
static OptionsCont & getOptions()
Retrieves the options.
void checkGeometries(const SUMOReal maxAngle, const SUMOReal minRadius, bool fix)
NBEdgeCont(NBTypeCont &tc)
Constructor.
std::string getString(const std::string &name) const
Returns the string-value of the named option (only for Option_String)
const EdgeVector & getOutgoingEdges() const
Returns this node's outgoing edges.
const std::string & getID() const
Returns the id.
SUMOReal length2D() const
Returns the length.
bool addEdge2EdgeConnection(NBEdge *dest)
Adds a connection to another edge.
bool overlapsWith(const AbstractPoly &poly, SUMOReal offset=0) const
Returns whether the boundary overlaps with the given polygon.
SVCPermissions myVehicleClasses2Keep
Set of vehicle types which must be allowed on edges in order to keep them.
const Position & getPosition() const
Returns the position of this node.
void reduceGeometries(const SUMOReal minDist)
Lanes to lanes - relationships are loaded; no recheck is necessary/wished.
std::set< NBEdge * > EdgeSet
bool usingGeoProjection() const
Returns whether a transformation from geo to metric coordinates will be performed.
bool insert(NBEdge *edge, bool ignorePrunning=false)
Adds an edge to the dictionary.
void removeUnwishedEdges(NBDistrictCont &dc)
Removes unwished edges (not in keep-edges)
void extract(NBDistrictCont &dc, NBEdge *edge, bool remember=false)
Removes the given edge from the container like erase but does not delete it.
A point in 2D or 3D with translation and scaling methods.
void applyOptions(OptionsCont &oc)
Initialises the storage by applying given options.
unsigned int getNumLanes() const
Returns the number of lanes.
std::set< std::string > myEdges2Keep
Set of ids of edges which shall explicitly be kept.
SumoXMLNodeType getType() const
Returns the type of this node.
void computeEdge2Edges(bool noLeftMovers)
Computes for each edge the approached edges.
void computeLaneShapes()
Computes the shapes of all lanes of all edges stored in the container.
const EdgeVector & getEdges() const
Returns all edges which participate in this node.
void splitGeometry(NBNodeCont &nc)
Splits edges into multiple if they have a complex geometry.
EdgeCont myEdges
The instance of the dictionary (id->edge)
SVCPermissions parseVehicleClasses(const std::string &allowedS)
Parses the given definition of allowed vehicle classes into the given containers Deprecated classes g...
void clear()
Deletes all edges.
EdgeCont myExtractedEdges
The extracted nodes which are kept for reference.
bool knows(const std::string &type) const
Returns whether the named type is in the container.
std::string toString(const T &t, std::streamsize accuracy=OUTPUT_ACCURACY)
The connection was given by the user.
std::set< EdgeSet > myGuessedRoundabouts
Edges marked as belonging to a roundabout after guessing.
void removeFromConnections(NBEdge *toEdge, int fromLane=-1, int toLane=-1, bool tryLater=false)
Removes the specified connection(s)
std::set< EdgeSet > myRoundabouts
Edges marked as belonging to a roundabout by the user (each EdgeVector is a roundabout) ...
NBEdge * getConnectionTo(NBNode *n) const
int getJunctionPriority(const NBNode *const node) const
Returns the junction priority (normalised for the node currently build)
void joinSameNodeConnectingEdges(NBDistrictCont &dc, NBTrafficLightLogicCont &tlc, EdgeVector edges)
Joins the given edges because they connect the same nodes.
static SUMOReal formFactor(const EdgeVector &loopEdges)
compute the form factor for a loop of edges
std::pair< PositionVector, PositionVector > splitAt(SUMOReal where) const
Returns the two lists made when this list vector is splitted at the given point.
SVCPermissions myVehicleClasses2Remove
Set of vehicle types which need not be supported (edges which allow ONLY these are removed) ...
SVCPermissions getPermissions(int lane=-1) const
get the union of allowed classes over all lanes or for a specific lane
PositionVector myPrunningBoundary
Boundary within which an edge must be located in order to be kept.
SUMOReal length() const
Returns the length.
std::set< std::string > myTypes2Keep
Set of edges types which shall be kept.
Boundary & grow(SUMOReal by)
extends the boundary by the given amount
NBNode * getToNode() const
Returns the destination node of the edge.
SUMOReal myEdgesMinSpeed
The minimum speed an edge may have in order to be kept (default: -1)
void setID(const std::string &newID)
resets the id
void replaceOutgoing(NBEdge *which, NBEdge *by, unsigned int laneOff)
Replaces occurences of the first edge within the list of outgoing by the second Connections are remap...
NBEdge * retrieve(const std::string &id, bool retrieveExtracted=false) const
Returns the edge that has the given id.
void appendTurnarounds(bool noTLSControlled)
Appends turnarounds to all edges stored in the container.
std::vector< NBEdge * > EdgeVector
bool getShallBeDiscarded(const std::string &type) const
Returns the information whether edges of this type shall be discarded.
const PositionVector & getGeometry() const
Returns the geometry of the edge.
A storage for options typed value containers)
static SUMOReal nearest_offset_on_line_to_point2D(const Position &lineStart, const Position &lineEnd, const Position &p, bool perpendicular=true)
void erase(NBDistrictCont &dc, NBEdge *edge)
Removes the given edge from the container (deleting it)
A structure representing a connection between two lanes.
void computeEdgeShapes()
Computes the shapes of all edges stored in the container.
The connection was computed.
Represents a single node (junction) during network building.
void dismissVehicleClassInformation()
NBTypeCont & myTypeCont
The network builder; used to obtain type information.
void recheckLaneSpread()
Rechecks whether the lane spread is proper.
void setEndOffset(int lane, SUMOReal offset)
set lane specific end-offset (negative lane implies set for all lanes)
static SUMOReal relAngle(SUMOReal angle1, SUMOReal angle2)
void removeFromSinksAndSources(NBEdge *const e)
Removes the given edge from the lists of sources and sinks in all stored districts.
std::set< std::string > myTypes2Remove
Set of edges types which shall be removed.
void recheckLanes()
Rechecks whether all lanes have a successor for each of the stored edges.
SUMOReal getSpeed() const
Returns the speed allowed on this edge.
Container for nodes during the netbuilding process.
std::set< std::string > myIgnoredEdges
The ids of ignored edges.
EdgeVector getGeneratedFrom(const std::string &id) const
Returns the edges which have been built by splitting the edge of the given id.
void replaceRemoved(NBEdge *removed, int removedLane, NBEdge *by, int byLane)
Replaces occurences of the removed edge/lane in all definitions by the given edge.
SUMOReal area() const
Returns the area (0 for non-closed)
void addRoundabout(const EdgeSet &roundabout)
add user specified roundabout
void addPostProcessConnection(const std::string &from, int fromLane, const std::string &to, int toLane, bool mayDefinitelyPass, bool keepClear, SUMOReal contPos)
Adds a connection which could not be set during loading.
Boundary getBoxBoundary() const
Returns a boundary enclosing this list of lines.
const std::vector< Connection > & getConnections() const
Returns the connections.
NBNode * myFrom
The source and the destination node.
NBEdge * getTurnDestination(bool possibleDestination=false) const
bool exists(const std::string &name) const
Returns the information whether the named option is known.
void append(const PositionVector &v, SUMOReal sameThreshold=2.0)
void copyConnectionsFrom(NBEdge *src)
bool ignoreFilterMatch(NBEdge *edge)
Returns true if this edge matches one of the removal criteria.
A storage for available types of edges.
SUMOReal getLength() const
Returns the computed length of the edge.
bool isSet(const std::string &name, bool failOnNonExistant=true) const
Returns the information whether the named option is set.
SUMOReal getAngleAtNode(const NBNode *const node) const
Returns the angle of the edge's geometry at the given node.
std::set< std::string > myEdges2Remove
Set of ids of edges which shall explicitly be removed.
NBNode * getFromNode() const
Returns the origin node of the edge.