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")) {
98 const std::vector<std::string> classes = oc.
getStringVector(
"keep-edges.by-vclass");
99 for (std::vector<std::string>::const_iterator i = classes.begin(); i != classes.end(); ++i) {
103 if (oc.
exists(
"remove-edges.by-vclass") && oc.
isSet(
"remove-edges.by-vclass")) {
104 const std::vector<std::string> classes = oc.
getStringVector(
"remove-edges.by-vclass");
105 for (std::vector<std::string>::const_iterator i = classes.begin(); i != classes.end(); ++i) {
109 if (oc.
exists(
"keep-edges.by-type") && oc.
isSet(
"keep-edges.by-type")) {
110 const std::vector<std::string> types = oc.
getStringVector(
"keep-edges.by-type");
113 if (oc.
exists(
"remove-edges.by-type") && oc.
isSet(
"remove-edges.by-type")) {
114 const std::vector<std::string> types = oc.
getStringVector(
"remove-edges.by-type");
118 if (oc.
isSet(
"keep-edges.in-boundary") || oc.
isSet(
"keep-edges.in-geo-boundary")) {
120 "keep-edges.in-boundary" :
"keep-edges.in-geo-boundary");
122 std::vector<SUMOReal> poly;
123 for (std::vector<std::string>::iterator i = polyS.begin(); i != polyS.end(); ++i) {
126 if (poly.size() < 4) {
127 throw ProcessError(
"Invalid boundary: need at least 2 coordinates");
128 }
else if (poly.size() % 2 != 0) {
129 throw ProcessError(
"Invalid boundary: malformed coordinate");
130 }
else if (poly.size() == 4) {
137 for (std::vector<SUMOReal>::iterator j = poly.begin(); j != poly.end();) {
150 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
178 if (oc.
exists(
"dismiss-vclasses") && oc.
getBool(
"dismiss-vclasses")) {
236 WRITE_ERROR(
"Cannot prune edges using a geo-boundary because no projection has been loaded");
252 EdgeCont::const_iterator i =
myEdges.find(
id);
254 if (retrieveExtracted) {
274 while (candidates->size() == 1) {
275 const std::string& nextID = candidates->front()->getID();
276 if (nextID.find(
id) != 0 || nextID.size() <=
id.size() + 1 || (nextID[
id.size()] !=
'.' && nextID[
id.size()] !=
'-')) {
279 edge = candidates->front();
300 hints.push_back(hintedge);
303 for (EdgeVector::iterator i = hints.begin(); i != hints.end(); i++) {
305 for (EdgeVector::iterator j = candidates.begin(); j != candidates.end(); j++) {
306 NBEdge* poss_searched = (*j);
308 ? poss_searched->
myTo : poss_searched->
myFrom;
311 if (find(cont.begin(), cont.end(), hintedge) != cont.end()) {
312 return poss_searched;
327 size_t maxLength = 0;
328 std::string tid =
id +
"[";
329 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
330 if ((*i).first.find(tid) == 0) {
331 maxLength =
MAX2(maxLength, (*i).first.length());
336 std::vector<std::string> names;
337 names.push_back(
id +
"[1]");
338 names.push_back(
id +
"[0]");
339 while (names.size() > 0) {
341 std::string cid = names.back();
347 if (cid.length() + 3 < maxLength) {
348 names.push_back(cid +
"[1]");
349 names.push_back(cid +
"[0]");
386 if (
myEdges.count(newID) != 0) {
387 throw ProcessError(
"Attempt to rename edge using existing id '" + newID +
"'");
405 const std::string& firstEdgeName,
406 const std::string& secondEdgeName,
407 unsigned int noLanesFirstEdge,
unsigned int noLanesSecondEdge) {
418 return splitAt(dc, edge, pos, node, firstEdgeName, secondEdgeName,
419 noLanesFirstEdge, noLanesSecondEdge);
426 const std::string& firstEdgeName,
427 const std::string& secondEdgeName,
428 unsigned int noLanesFirstEdge,
unsigned int noLanesSecondEdge) {
430 std::pair<PositionVector, PositionVector> geoms =
433 geoms.first.pop_back();
438 geoms.second.pop_front();
446 for (
unsigned int i = 0; i < noLanesFirstEdge && i < edge->
getNumLanes(); i++) {
453 for (
unsigned int i = 0; i < noLanesSecondEdge && i < edge->
getNumLanes(); i++) {
467 if (noLanesFirstEdge == noLanesSecondEdge - 1) {
468 for (
unsigned int i = 0; i < one->
getNumLanes(); i++) {
502 std::vector<std::string>
504 std::vector<std::string> ret;
505 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
506 ret.push_back((*i).first);
516 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
517 NBEdge* edge = (*i).second;
521 toRemove.push_back(edge);
524 for (EdgeVector::iterator j = toRemove.begin(); j != toRemove.end(); ++j) {
532 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
533 if ((*i).second->getGeometry().size() < 3) {
536 (*i).second->splitGeometry(*
this, nc);
543 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
544 (*i).second->reduceGeometry(minDist);
551 if (maxAngle > 0 || minRadius > 0) {
552 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
553 (*i).second->checkGeometry(maxAngle, minRadius, fix);
562 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
563 (*i).second->clearControllingTLInformation();
570 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
571 (*i).second->sortOutgoingConnectionsByAngle();
578 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
579 (*i).second->computeEdge2Edges(noLeftMovers);
586 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
587 (*i).second->computeLanes2Edges();
594 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
595 (*i).second->recheckLanes();
602 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
603 (*i).second->appendTurnaround(noTLSControlled);
610 for (std::set<std::string>::const_iterator it = ids.begin(); it != ids.end(); it++) {
611 myEdges[*it]->appendTurnaround(noTLSControlled);
618 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
619 (*i).second->computeEdgeShape();
626 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
627 (*i).second->computeLaneShapes();
642 unsigned int nolanes = 0;
648 NBEdge* tpledge = *(edges.begin());
649 NBNode* from = tpledge->getFromNode();
650 NBNode* to = tpledge->getToNode();
651 EdgeVector::const_iterator i;
652 for (i = edges.begin(); i != edges.end(); i++) {
654 assert((*i)->getFromNode() == from);
655 assert((*i)->getToNode() == to);
657 nolanes += (*i)->getNumLanes();
659 if (i != edges.begin()) {
664 speed += (*i)->getSpeed();
666 priority =
MAX2(priority, (*i)->getPriority());
668 speed /= edges.size();
672 NBEdge* newEdge =
new NBEdge(
id, from, to,
"", speed, nolanes, priority,
674 tpledge->getStreetName(), tpledge->myLaneSpreadFunction);
682 for (i = edges.begin(); i != edges.end(); i++) {
684 for (EdgeVector::iterator j = ev.begin(); j != ev.end(); j++) {
689 unsigned int currLane = 0;
690 for (i = edges.begin(); i != edges.end(); i++) {
692 currLane += (*i)->getNumLanes();
696 for (i = edges.begin(); i != edges.end(); i++) {
697 unsigned int noLanes = (*i)->getNumLanes();
698 for (
unsigned int j = 0; j < noLanes; j++, currLane++) {
704 for (i = edges.begin(); i != edges.end(); i++) {
712 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
713 std::string oppositeID;
714 if ((*i).first[0] ==
'-') {
715 oppositeID = (*i).first.substr(1);
717 oppositeID =
"-" + (*i).first;
742 if (from != 0 && to != 0) {
744 WRITE_WARNING(
"Could not insert connection between '" + (*i).from +
"' and '" + (*i).to +
"' after build.");
750 for (EdgeCont::iterator it =
myEdges.begin(); it !=
myEdges.end(); ++it) {
751 NBEdge* edge = it->second;
754 std::vector<NBEdge::Connection> connections = edge->
getConnections();
755 for (std::vector<NBEdge::Connection>::iterator it_con = connections.begin(); it_con != connections.end(); ++it_con) {
769 size_t len =
id.length();
771 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
772 std::string curr = (*i).first;
775 if (curr.length() <= len) {
780 if (curr.substr(0, len) ==
id && curr[len] ==
'[') {
781 ret.push_back((*i).second);
785 size_t pos = curr.find(
id);
787 if (pos == std::string::npos) {
792 if (curr[pos - 1] !=
']' && curr[pos - 1] !=
'+') {
797 if (pos +
id.length() < curr.length()) {
798 if (curr[pos +
id.length()] !=
'[' && curr[pos +
id.length()] !=
'+') {
803 ret.push_back((*i).second);
812 std::set<NBEdge*> candidates;
813 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
817 candidates.insert(e);
822 std::set<NBEdge*> visited;
823 for (std::set<NBEdge*>::const_iterator i = candidates.begin(); i != candidates.end(); ++i) {
830 if (visited.count(e) > 0) {
834 loopEdges.push_back(e);
839 if (edges.size() < 2) {
848 EdgeVector::const_iterator me = find(edges.begin(), edges.end(), e);
857 EdgeVector::const_iterator loopClosed = find(loopEdges.begin(), loopEdges.end(), left);
858 const size_t loopSize = loopEdges.end() - loopClosed;
863 }
else if (loopSize < loopEdges.size()) {
865 EdgeVector(loopEdges.begin() + (loopEdges.size() - loopSize), loopEdges.end()).swap(loopEdges);
869 for (EdgeVector::const_iterator j = loopEdges.begin(); j != loopEdges.end(); ++j) {
870 if ((*j)->getToNode()->getEdges().size() > 2) {
874 if (attachments < 3) {
879 if (visited.count(left) > 0) {
883 loopEdges.push_back(left);
889 std::set<NBEdge*> loopEdgesSet(loopEdges.begin(), loopEdges.end());
890 for (std::set<NBEdge*>::const_iterator j = loopEdgesSet.begin(); j != loopEdgesSet.end(); ++j) {
892 NBNode* node = (*j)->getToNode();
894 for (EdgeVector::const_iterator k = incoming.begin(); k != incoming.end(); ++k) {
896 if (loopEdgesSet.count(inEdge) > 0) {
905 (*j)->setJunctionPriority(node, 1000);
908 marked.push_back(loopEdges);
916 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
SUMOVehicleClass getVehicleClassID(const std::string &name)
Returns the class id of the abstract class given by its name.
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.
LaneSpreadFunction myLaneSpreadFunction
The information about how to spread the lanes.
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 setSpeed(int lane, SUMOReal speed)
set lane specific speed (negative lane implies set for all lanes)
void moveOutgoingConnectionsFrom(NBEdge *e, unsigned int laneOff)
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
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)
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.
SUMOReal mySpeed
The maximal speed.
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)
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.
int getPriority() const
Returns the priority of the edge.
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.
SUMOReal myLaneWidth
This width of this edge's lanes.
void splitGeometry(NBNodeCont &nc)
Splits edges into multiple if they have a complex geometry.
EdgeCont myEdges
The instance of the dictionary (id->edge)
SUMOReal myOffset
This edges's offset to the intersection begin (will be applied to all lanes)
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 erase(NBDistrictCont &dc, NBEdge *edge)
Removes the given edge from the container (deleting it)
std::string myType
The type of the edge.
A structure representing a connection between two lanes.
SUMOReal getLaneSpeed(unsigned int lane) const
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.
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.
Boundary getBoxBoundary() const
Returns a boundary enclosing this list of lines.
const std::string & getStreetName() const
Returns the street name of this edge.
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.