61 #ifdef CHECK_MEMORY_LEAKS
63 #endif // CHECK_MEMORY_LEAKS
72 myVehicleClasses2Keep(0),
73 myVehicleClasses2Remove(0),
74 myNeedGeoTransformedPrunningBoundary(false)
89 if (oc.
isSet(
"keep-edges.explicit")) {
90 const std::vector<std::string> edges = oc.
getStringVector(
"keep-edges.explicit");
93 if (oc.
isSet(
"remove-edges.explicit")) {
94 const std::vector<std::string> edges = oc.
getStringVector(
"remove-edges.explicit");
97 if (oc.
exists(
"keep-edges.by-vclass") && oc.
isSet(
"keep-edges.by-vclass")) {
100 if (oc.
exists(
"remove-edges.by-vclass") && oc.
isSet(
"remove-edges.by-vclass")) {
103 if (oc.
exists(
"keep-edges.by-type") && oc.
isSet(
"keep-edges.by-type")) {
104 const std::vector<std::string> types = oc.
getStringVector(
"keep-edges.by-type");
107 if (oc.
exists(
"remove-edges.by-type") && oc.
isSet(
"remove-edges.by-type")) {
108 const std::vector<std::string> types = oc.
getStringVector(
"remove-edges.by-type");
112 if (oc.
isSet(
"keep-edges.in-boundary") || oc.
isSet(
"keep-edges.in-geo-boundary")) {
114 "keep-edges.in-boundary" :
"keep-edges.in-geo-boundary");
116 std::vector<SUMOReal> poly;
117 for (std::vector<std::string>::iterator i = polyS.begin(); i != polyS.end(); ++i) {
120 if (poly.size() < 4) {
121 throw ProcessError(
"Invalid boundary: need at least 2 coordinates");
122 }
else if (poly.size() % 2 != 0) {
123 throw ProcessError(
"Invalid boundary: malformed coordinate");
124 }
else if (poly.size() == 4) {
131 for (std::vector<SUMOReal>::iterator j = poly.begin(); j != poly.end();) {
144 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");
246 EdgeCont::const_iterator i =
myEdges.find(
id);
248 if (retrieveExtracted) {
268 while (candidates->size() == 1) {
269 const std::string& nextID = candidates->front()->getID();
270 if (nextID.find(
id) != 0 || nextID.size() <=
id.size() + 1 || (nextID[
id.size()] !=
'.' && nextID[
id.size()] !=
'-')) {
273 edge = candidates->front();
294 hints.push_back(hintedge);
297 for (EdgeVector::iterator i = hints.begin(); i != hints.end(); i++) {
299 for (EdgeVector::iterator j = candidates.begin(); j != candidates.end(); j++) {
300 NBEdge* poss_searched = (*j);
302 ? poss_searched->
myTo : poss_searched->
myFrom;
305 if (find(cont.begin(), cont.end(), hintedge) != cont.end()) {
306 return poss_searched;
321 size_t maxLength = 0;
322 std::string tid =
id +
"[";
323 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
324 if ((*i).first.find(tid) == 0) {
325 maxLength =
MAX2(maxLength, (*i).first.length());
330 std::vector<std::string> names;
331 names.push_back(
id +
"[1]");
332 names.push_back(
id +
"[0]");
333 while (names.size() > 0) {
335 std::string cid = names.back();
341 if (cid.length() + 3 < maxLength) {
342 names.push_back(cid +
"[1]");
343 names.push_back(cid +
"[0]");
380 if (
myEdges.count(newID) != 0) {
381 throw ProcessError(
"Attempt to rename edge using existing id '" + newID +
"'");
399 const std::string& firstEdgeName,
400 const std::string& secondEdgeName,
401 unsigned int noLanesFirstEdge,
unsigned int noLanesSecondEdge) {
412 return splitAt(dc, edge, pos, node, firstEdgeName, secondEdgeName,
413 noLanesFirstEdge, noLanesSecondEdge);
420 const std::string& firstEdgeName,
421 const std::string& secondEdgeName,
422 unsigned int noLanesFirstEdge,
unsigned int noLanesSecondEdge) {
424 std::pair<PositionVector, PositionVector> geoms =
427 geoms.first.pop_back();
432 geoms.second.pop_front();
436 NBEdge* one =
new NBEdge(firstEdgeName, edge->
myFrom, node, edge, geoms.first, noLanesFirstEdge);
437 NBEdge* two =
new NBEdge(secondEdgeName, node, edge->
myTo, edge, geoms.second, noLanesSecondEdge);
449 if (noLanesFirstEdge == noLanesSecondEdge - 1) {
450 for (
unsigned int i = 0; i < one->
getNumLanes(); i++) {
484 std::vector<std::string>
486 std::vector<std::string> ret;
487 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
488 ret.push_back((*i).first);
498 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
499 NBEdge* edge = (*i).second;
503 toRemove.push_back(edge);
506 for (EdgeVector::iterator j = toRemove.begin(); j != toRemove.end(); ++j) {
514 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
515 if ((*i).second->getGeometry().size() < 3) {
518 (*i).second->splitGeometry(*
this, nc);
525 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
526 (*i).second->reduceGeometry(minDist);
533 if (maxAngle > 0 || minRadius > 0) {
534 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
535 (*i).second->checkGeometry(maxAngle, minRadius, fix);
544 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
545 (*i).second->clearControllingTLInformation();
552 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
553 (*i).second->sortOutgoingConnectionsByAngle();
560 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
561 (*i).second->computeEdge2Edges(noLeftMovers);
568 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
569 (*i).second->computeLanes2Edges(buildCrossingsAndWalkingAreas);
576 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
577 (*i).second->recheckLanes(buildCrossingsAndWalkingAreas);
584 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
585 (*i).second->appendTurnaround(noTLSControlled);
592 for (std::set<std::string>::const_iterator it = ids.begin(); it != ids.end(); it++) {
593 myEdges[*it]->appendTurnaround(noTLSControlled);
600 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
601 (*i).second->computeEdgeShape();
608 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
609 (*i).second->computeLaneShapes();
624 unsigned int nolanes = 0;
630 NBEdge* tpledge = *(edges.begin());
631 NBNode* from = tpledge->getFromNode();
632 NBNode* to = tpledge->getToNode();
633 EdgeVector::const_iterator i;
634 for (i = edges.begin(); i != edges.end(); i++) {
636 assert((*i)->getFromNode() == from);
637 assert((*i)->getToNode() == to);
639 nolanes += (*i)->getNumLanes();
641 if (i != edges.begin()) {
646 speed += (*i)->getSpeed();
648 priority =
MAX2(priority, (*i)->getPriority());
650 speed /= edges.size();
654 NBEdge* newEdge =
new NBEdge(
id, from, to,
"", speed, nolanes, priority,
656 tpledge->getStreetName(), tpledge->myLaneSpreadFunction);
664 for (i = edges.begin(); i != edges.end(); i++) {
666 for (EdgeVector::iterator j = ev.begin(); j != ev.end(); j++) {
671 unsigned int currLane = 0;
672 for (i = edges.begin(); i != edges.end(); i++) {
674 currLane += (*i)->getNumLanes();
678 for (i = edges.begin(); i != edges.end(); i++) {
679 unsigned int noLanes = (*i)->getNumLanes();
680 for (
unsigned int j = 0; j < noLanes; j++, currLane++) {
686 for (i = edges.begin(); i != edges.end(); i++) {
694 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
695 std::string oppositeID;
696 if ((*i).first[0] ==
'-') {
697 oppositeID = (*i).first.substr(1);
699 oppositeID =
"-" + (*i).first;
724 if (from != 0 && to != 0) {
726 WRITE_WARNING(
"Could not insert connection between '" + (*i).from +
"' and '" + (*i).to +
"' after build.");
732 for (EdgeCont::iterator it =
myEdges.begin(); it !=
myEdges.end(); ++it) {
733 NBEdge* edge = it->second;
736 std::vector<NBEdge::Connection> connections = edge->
getConnections();
737 for (std::vector<NBEdge::Connection>::iterator it_con = connections.begin(); it_con != connections.end(); ++it_con) {
751 size_t len =
id.length();
753 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
754 std::string curr = (*i).first;
757 if (curr.length() <= len) {
762 if (curr.substr(0, len) ==
id && curr[len] ==
'[') {
763 ret.push_back((*i).second);
767 size_t pos = curr.find(
id);
769 if (pos == std::string::npos) {
774 if (curr[pos - 1] !=
']' && curr[pos - 1] !=
'+') {
779 if (pos +
id.length() < curr.length()) {
780 if (curr[pos +
id.length()] !=
'[' && curr[pos +
id.length()] !=
'+') {
785 ret.push_back((*i).second);
794 std::set<NBEdge*> candidates;
795 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
799 candidates.insert(e);
804 std::set<NBEdge*> visited;
805 for (std::set<NBEdge*>::const_iterator i = candidates.begin(); i != candidates.end(); ++i) {
812 if (visited.count(e) > 0) {
816 loopEdges.push_back(e);
821 if (edges.size() < 2) {
830 EdgeVector::const_iterator me = find(edges.begin(), edges.end(), e);
839 EdgeVector::const_iterator loopClosed = find(loopEdges.begin(), loopEdges.end(), left);
840 const size_t loopSize = loopEdges.end() - loopClosed;
845 }
else if (loopSize < loopEdges.size()) {
847 EdgeVector(loopEdges.begin() + (loopEdges.size() - loopSize), loopEdges.end()).swap(loopEdges);
851 for (EdgeVector::const_iterator j = loopEdges.begin(); j != loopEdges.end(); ++j) {
852 if ((*j)->getToNode()->getEdges().size() > 2) {
856 if (attachments < 3) {
861 if (visited.count(left) > 0) {
865 loopEdges.push_back(left);
871 std::set<NBEdge*> loopEdgesSet(loopEdges.begin(), loopEdges.end());
872 for (std::set<NBEdge*>::const_iterator j = loopEdgesSet.begin(); j != loopEdgesSet.end(); ++j) {
874 NBNode* node = (*j)->getToNode();
876 for (EdgeVector::const_iterator k = incoming.begin(); k != incoming.end(); ++k) {
878 if (loopEdgesSet.count(inEdge) > 0) {
887 (*j)->setJunctionPriority(node, 1000);
890 marked.push_back(loopEdges);
898 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
936 int sidewalksCreated = 0;
937 for (EdgeCont::iterator it =
myEdges.begin(); it !=
myEdges.end(); it++) {
938 NBEdge* edge = it->second;
941 sidewalksCreated += 1;
944 return sidewalksCreated;
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.
bool myAmLeftHanded
Whether the network is left-handed.
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.
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.
bool myRemoveEdgesAfterJoining
Whether edges shall be joined first, then removed.
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.
A container for districts.
static GeoConvHelper & getLoaded()
the coordinate transformation that was loaded fron an input file
bool addLane2LaneConnection(unsigned int fromLane, NBEdge *dest, unsigned int toLane, Lane2LaneInfoType type, bool mayUseSameDestination=false, bool mayDefinitelyPass=false)
Adds a connection between the specified this edge's lane and an approached one.
void clearControllingTLInformation() const
Clears information about controlling traffic lights for all connenections of all edges.
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
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)
void guessRoundabouts(std::vector< EdgeVector > &marked)
Determines which edges belong to roundabouts and increases their priority.
NBEdgeCont(NBTypeCont &tc)
Constructor.
const EdgeVector & getOutgoingEdges() const
Returns this node's outgoing edges.
const std::string & getID() const
Returns the id.
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.
static SUMOReal nearest_offset_on_line_to_point2D(const Position &l1, const Position &l2, const Position &p, bool perpendicular=true)
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)
void computeLanes2Edges(const bool buildCrossingsAndWalkingAreas)
Computes for each edge which lanes approach the next edges.
Lanes to lanes - relationships are loaded; no recheck is necessary/wished.
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.
void setLeftHanded()
Marks this edge to be left-handed.
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.
The connection was given by the user.
void removeFromConnections(NBEdge *toEdge, int fromLane=-1, int toLane=-1, bool tryLater=false)
Removes the specified connection(s)
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.
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.
void push_back(const PositionVector &p)
Appends all positions from the given vector.
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)
void recheckLanes(const bool buildCrossingsAndWalkingAreas)
Rechecks whether all lanes have a successor for each of the stored edges.
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.
NBEdge * getTurnDestination() const
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.
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.
int guessSidewalks(SUMOReal width, SUMOReal minSpeed, SUMOReal maxSpeed)
add sidwalks to edges within the given limits and return the number of edges affected ...
void replaceRemoved(NBEdge *removed, int removedLane, NBEdge *by, int byLane)
Replaces occurences of the removed edge/lane in all definitions by the given edge.
Boundary getBoxBoundary() const
Returns a boundary enclosing this list of lines.
const std::vector< Connection > & getConnections() const
Returns the connections.
void addPostProcessConnection(const std::string &from, int fromLane, const std::string &to, int toLane, bool mayDefinitelyPass)
Adds a connection which could not be set during loading.
NBNode * myFrom
The source and the destination node.
bool exists(const std::string &name) const
Returns the information whether the named option is known.
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.