53#define JOIN_TRAM_MAX_ANGLE 10
54#define JOIN_TRAM_MIN_LENGTH 3
58#define DEBUG_EDGE_ID ""
65 myVehicleClasses2Keep(0),
66 myVehicleClasses2Remove(0),
67 myNeedGeoTransformedPruningBoundary(false) {
82 if (oc.
isSet(
"keep-edges.input-file")) {
85 if (oc.
isSet(
"remove-edges.input-file")) {
88 if (oc.
isSet(
"keep-edges.explicit")) {
89 const std::vector<std::string> edges = oc.
getStringVector(
"keep-edges.explicit");
92 if (oc.
isSet(
"remove-edges.explicit")) {
93 const std::vector<std::string> edges = oc.
getStringVector(
"remove-edges.explicit");
96 if (oc.
exists(
"keep-edges.by-vclass") && oc.
isSet(
"keep-edges.by-vclass")) {
99 if (oc.
exists(
"remove-edges.by-vclass") && oc.
isSet(
"remove-edges.by-vclass")) {
102 if (oc.
exists(
"keep-edges.by-type") && oc.
isSet(
"keep-edges.by-type")) {
103 const std::vector<std::string> types = oc.
getStringVector(
"keep-edges.by-type");
106 if (oc.
exists(
"remove-edges.by-type") && oc.
isSet(
"remove-edges.by-type")) {
107 const std::vector<std::string> types = oc.
getStringVector(
"remove-edges.by-type");
111 if (oc.
isSet(
"keep-edges.in-boundary") || oc.
isSet(
"keep-edges.in-geo-boundary")) {
114 "keep-edges.in-boundary" :
"keep-edges.in-geo-boundary");
119 if (boundaryShape.size() < 2) {
120 throw ProcessError(
"Invalid boundary: need at least 2 coordinates");
121 }
else if (boundaryShape.size() == 2) {
133 "keep-edges.in-boundary" :
"keep-edges.in-geo-boundary");
134 std::vector<double> poly;
135 for (std::vector<std::string>::iterator i = polyS.begin(); i != polyS.end(); ++i) {
138 if (poly.size() < 4) {
139 throw ProcessError(
"Invalid boundary: need at least 2 coordinates");
140 }
else if (poly.size() % 2 != 0) {
141 throw ProcessError(
"Invalid boundary: malformed coordinate");
142 }
else if (poly.size() == 4) {
149 for (std::vector<double>::iterator j = poly.begin(); j != poly.end();) {
163 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
164 delete ((*i).second);
168 delete ((*i).second);
188 if (oc.
exists(
"dismiss-vclasses") && oc.
getBool(
"dismiss-vclasses")) {
254 WRITE_ERROR(
TL(
"Cannot prune edges using a geo-boundary because no projection has been loaded"));
275 EdgeCont::const_iterator i =
myEdges.find(
id);
277 if (retrieveExtracted) {
312 if (edge !=
nullptr) {
316 if ((
retrieve(
id +
"[0]") !=
nullptr) && (
retrieve(
id +
"[1]") !=
nullptr)) {
318 if (downstream ==
true) {
332 if (edge !=
nullptr) {
339 if (hintedge ==
nullptr) {
342 hints.push_back(hintedge);
345 for (
const NBEdge*
const currHint : hints) {
346 for (
NBEdge*
const poss_searched : candidates) {
347 const NBNode*
const node = incoming ? poss_searched->myTo : poss_searched->myFrom;
349 if (find(cont.begin(), cont.end(), currHint) != cont.end()) {
350 return poss_searched;
362 if (edge !=
nullptr) {
366 std::string tid =
id +
"[";
367 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
368 if ((*i).first.find(tid) == 0) {
369 maxLength =
MAX2(maxLength, (
int)(*i).first.length());
374 std::vector<std::string> names;
375 names.push_back(
id +
"[1]");
376 names.push_back(
id +
"[0]");
377 while (names.size() > 0) {
379 std::string cid = names.back();
384 if (edge ==
nullptr) {
385 if ((
int)cid.length() + 3 < maxLength) {
386 names.push_back(cid +
"[1]");
387 names.push_back(cid +
"[0]");
424 if (
myEdges.count(newID) != 0) {
425 throw ProcessError(
"Attempt to rename edge using existing id '" + newID +
"'");
431 if (edge->
getLanes().back().oppositeID !=
"") {
433 if (oppo !=
nullptr) {
445 if (splits.size() == 0) {
448 const std::string origID = e->
getID();
449 std::vector<Split>::iterator i;
453 for (i = splits.begin(); i != splits.end(); ++i) {
454 sort((*i).lanes.begin(), (*i).lanes.end());
455 noLanesMax =
MAX2(noLanesMax, (
int)(*i).lanes.size());
458 std::vector<int> currLanes;
460 currLanes.push_back(l);
462 if (e->
getNumLanes() != (
int)splits.back().lanes.size()) {
470 std::string firstID =
"";
472 for (i = splits.begin(); i != splits.end(); ++i) {
473 const Split& exp = *i;
474 assert(exp.
lanes.size() != 0);
487 WRITE_WARNING(
"Error on parsing a split (edge '" + origID +
"').");
490 std::vector<int> newLanes = exp.
lanes;
496 int rightMostP = currLanes[0];
497 int rightMostN = newLanes[0];
498 for (
int l = 0; l < (int) rightMostP - (
int) rightMostN; ++l) {
502 int leftMostP = currLanes.back();
503 int leftMostN = newLanes.back();
504 for (
int l = 0; l < (int) leftMostN - (
int) leftMostP; ++l) {
508 for (
int l = 0; l < noLanesMax; ++l) {
509 if (find(currLanes.begin(), currLanes.end(), l) == currLanes.end()) {
512 if (find(newLanes.begin(), newLanes.end(), l) == newLanes.end()) {
523 in->invalidateConnections(
true);
528 currLanes = newLanes;
529 }
else if (exp.
pos == 0) {
531 if (laneCountDiff < 0) {
536 currLanes = exp.
lanes;
546 if (splits.front().pos != 0) {
550 for (
int lane = 0; lane < (int)e->
getNumLanes(); ++lane) {
551 start.
lanes.push_back(lane);
553 start.
offset = splits.front().offset;
555 splits.insert(splits.begin(), start);
559 for (; i != splits.end(); ++i) {
560 int maxLeft = (*i).lanes.back();
561 double offset = (*i).offset;
562 if (maxLeft < noLanesMax) {
569 int maxRight = (*i).lanes.front();
596 const std::string& firstEdgeName,
597 const std::string& secondEdgeName,
598 int noLanesFirstEdge,
int noLanesSecondEdge,
599 const double speed,
const double friction,
600 const int changedLeft) {
611 return splitAt(dc, edge, pos, node, firstEdgeName, secondEdgeName,
612 noLanesFirstEdge, noLanesSecondEdge, speed, friction, changedLeft);
619 const std::string& firstEdgeName,
620 const std::string& secondEdgeName,
621 int noLanesFirstEdge,
int noLanesSecondEdge,
622 const double speed,
const double friction,
623 const int changedLeft) {
625 assert(changedLeft > -((
int)noLanesFirstEdge));
626 assert(changedLeft < (
int)noLanesSecondEdge);
631 NBEdge* one =
new NBEdge(firstEdgeName, edge->
myFrom, node, edge, geoms.first, noLanesFirstEdge);
632 NBEdge* two =
new NBEdge(secondEdgeName, node, edge->
myTo, edge, geoms.second, noLanesSecondEdge);
635 if (firstEdgeName != origID) {
638 if (secondEdgeName != origID) {
646 if (friction != -1.) {
654 for (std::set<NBTrafficLightDefinition*>::iterator i = fromTLS.begin(); i != fromTLS.end(); ++i) {
655 (*i)->replaceRemoved(edge, -1, one, -1,
false);
658 for (std::set<NBTrafficLightDefinition*>::iterator i = toTLS.begin(); i != toTLS.end(); ++i) {
659 (*i)->replaceRemoved(edge, -1, two, -1,
true);
670 for (
int i2 = 0; i2 < (int)two->
getNumLanes(); i2++) {
689 const std::string oldID = edge->
getID();
692 WRITE_ERROR(
"Could not insert edge '" + one->
getID() +
"' before split of edge '" + oldID +
"'");
695 WRITE_ERROR(
"Could not insert edge '" + two->
getID() +
"' after split of edge '" + oldID +
"'");
704 std::set<EdgeSet> addLater;
705 for (std::set<EdgeSet>::iterator it = roundabouts.begin(); it != roundabouts.end(); ++it) {
707 if (roundaboutSet.count(orig) > 0) {
708 roundaboutSet.erase(orig);
709 roundaboutSet.insert(part1);
710 roundaboutSet.insert(part2);
712 addLater.insert(roundaboutSet);
715 roundabouts.insert(addLater.begin(), addLater.end());
720std::vector<std::string>
722 std::vector<std::string> ret;
723 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
724 ret.push_back((*i).first);
734 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
735 NBEdge* edge = (*i).second;
739 toRemove.push_back(edge);
742 for (EdgeVector::iterator j = toRemove.begin(); j != toRemove.end(); ++j) {
752 for (
auto& item : edges) {
753 NBEdge* edge = item.second;
758 const std::string
id = edge->
getID();
760 for (
int i = 1; i < (int)geom.size() - 1; i++) {
761 offset += geom[i - 1].distanceTo(geom[i]);
762 std::string nodeID =
id +
"." +
toString((
int)offset);
763 if (!nc.
insert(nodeID, geom[i])) {
777 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
778 (*i).second->reduceGeometry(minDist);
785 if (maxAngle > 0 || minRadius > 0) {
790 item.second->checkGeometry(maxAngle, minRadius, fix || (fixRailways &&
isRailway(item.second->getPermissions())), silent);
799 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
800 (*i).second->clearControllingTLInformation();
807 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
808 (*i).second->sortOutgoingConnectionsByAngle();
815 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
816 (*i).second->computeEdge2Edges(noLeftMovers);
823 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
824 (*i).second->computeLanes2Edges();
832 for (
const auto& edgeIt :
myEdges) {
833 NBEdge*
const edge = edgeIt.second;
839 for (
int i = 0; i < leftmostLane; i++) {
840 const std::string& oppositeID = edge->
getLanes()[i].oppositeID;
841 NBEdge* oppEdge =
retrieve(oppositeID.substr(0, oppositeID.rfind(
"_")));
842 if (oppositeID !=
"" && oppositeID !=
"-") {
843 if (edge->
getLanes().back().oppositeID ==
"" && oppEdge !=
nullptr) {
845 WRITE_WARNINGF(
TL(
"Moving opposite lane '%' from invalid lane '%' to lane index %."), oppositeID, edge->
getLaneID(i), leftmostLane);
852 const std::string& oppositeID = edge->
getLanes().back().oppositeID;
853 if (oppositeID !=
"" && oppositeID !=
"-") {
854 NBEdge* oppEdge =
retrieve(oppositeID.substr(0, oppositeID.rfind(
"_")));
855 if (oppEdge ==
nullptr) {
861 WRITE_WARNINGF(
TL(
"Adapting invalid opposite lane '%' for edge '%' to '%'."), oppositeID, edge->
getID(), oppEdgeLeftmost);
866 const std::string leftmostID = edge->
getLaneID(leftmostLane);
867 WRITE_WARNINGF(
TL(
"Adapting missing opposite lane '%' for edge '%'."), leftmostID, oppEdge->
getID());
871 if (fixOppositeLengths) {
873 WRITE_WARNINGF(
TL(
"Averaging edge lengths for lane '%' (length %) and edge '%' (length %)."),
879 ") differs in length from edge '" + edge->
getID() +
"' (length " +
886 WRITE_ERROR(
"Opposite lane '" + oppositeID +
"' does not connect the same nodes as edge '" + edge->
getID() +
"'!");
897 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
898 (*i).second->appendTurnaround(noTLSControlled, noFringe, onlyDeadends, onlyTurnlane, noGeometryLike,
true);
905 for (std::set<std::string>::const_iterator it = ids.begin(); it != ids.end(); it++) {
906 myEdges[*it]->appendTurnaround(noTLSControlled,
false,
false,
false,
false,
false);
913 std::set<std::string> stopEdgeIDs;
914 for (
auto& stopItem : sc.
getStops()) {
915 stopEdgeIDs.insert(stopItem.second->getEdgeId());
918 NBEdge* edge = item.second;
920 && (stopEdgeIDs.count(item.first) > 0 ||
935 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
936 (*i).second->computeEdgeShape(smoothElevationThreshold);
939 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); i++) {
941 const std::string& oppositeID = edge->
getLanes().back().oppositeID;
942 if (oppositeID !=
"" && oppositeID !=
"-") {
943 NBEdge* oppEdge =
retrieve(oppositeID.substr(0, oppositeID.rfind(
"_")));
959 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
960 (*i).second->computeLaneShapes();
978 bool joinEdges =
true;
982 NBEdge* tpledge = *(edges.begin());
985 EdgeVector::const_iterator i;
986 int myPriority = (*edges.begin())->getPriority();
987 for (i = edges.begin(); i != edges.end(); i++) {
989 assert((*i)->getFromNode() == from);
990 assert((*i)->getToNode() == to);
992 nolanes += (*i)->getNumLanes();
994 if (i != edges.begin()) {
999 speed += (*i)->getSpeed();
1002 if (myPriority == (*i)->getPriority()) {
1003 priority = myPriority;
1010 speed /= (double)edges.size();
1017 for (i = edges.begin(); i != edges.end(); ++i) {
1018 const std::vector<NBEdge::Lane>& lanes = (*i)->getLanes();
1019 for (
int j = 0; j < (int)lanes.size(); ++j) {
1033 for (i = edges.begin(); i != edges.end(); i++) {
1035 for (EdgeVector::iterator j = ev.begin(); j != ev.end(); j++) {
1041 for (i = edges.begin(); i != edges.end(); i++) {
1043 currLane += (*i)->getNumLanes();
1047 for (i = edges.begin(); i != edges.end(); i++) {
1048 int noLanes = (*i)->getNumLanes();
1049 for (
int j = 0; j < noLanes; j++, currLane++) {
1056 for (i = edges.begin(); i != edges.end(); i++) {
1066 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
1067 NBEdge* edge = i->second;
1075 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
1077 if (opposite !=
nullptr) {
1089 const std::string oppositeID = edgeID[0] ==
'-' ? edgeID.substr(1) :
"-" + edgeID;
1090 EdgeCont::const_iterator it =
myEdges.find(oppositeID);
1096 EdgeCont::const_iterator it =
myEdges.find(edgeID);
1103 KeepClear keepClear,
double contPos,
double visibility,
double speed,
double friction,
double length,
1104 const PositionVector& customShape,
bool uncontrolled,
bool warnOnly,
1107 speed, friction, length, customShape, uncontrolled, warnOnly, permissions, indirectLeft, edgeType, changeLeft, changeRight));
1132 for (std::vector<PostProcessConnection>::const_iterator i = item.second.begin(); i != item.second.end(); ++i) {
1135 if (from ==
nullptr || to ==
nullptr ||
1137 (*i).keepClear, (*i).contPos, (*i).visibility, (*i).speed, (*i).friction, (*i).customLength, (*i).customShape,
1138 (*i).uncontrolled, (*i).permissions, (*i).indirectLeft, (*i).edgeType, (*i).changeLeft, (*i).changeRight,
1140 const std::string msg =
"Could not insert connection between '" + (*i).from +
"' and '" + (*i).to +
"' after build.";
1141 if (warnOnly || (*i).warnOnly) {
1151 for (EdgeCont::iterator it =
myEdges.begin(); it !=
myEdges.end(); ++it) {
1152 NBEdge* edge = it->second;
1155 std::vector<NBEdge::Connection> connections = edge->
getConnections();
1156 for (std::vector<NBEdge::Connection>::iterator it_con = connections.begin(); it_con != connections.end(); ++it_con) {
1160 "' to edge '" + c.
toEdge->
getID() +
"' via junction '" + to->
getID() +
"'.");
1170 int len = (int)
id.length();
1172 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
1173 std::string curr = (*i).first;
1176 if ((
int)curr.length() <= len) {
1181 if (curr.substr(0, len) ==
id && curr[len] ==
'[') {
1182 ret.push_back((*i).second);
1186 std::string::size_type pos = curr.find(
id);
1188 if (pos == std::string::npos) {
1193 if (curr[pos - 1] !=
']' && curr[pos - 1] !=
'+') {
1198 if (pos +
id.length() < curr.length()) {
1199 if (curr[pos +
id.length()] !=
'[' && curr[pos +
id.length()] !=
'+') {
1204 ret.push_back((*i).second);
1213 std::set<NBEdge*> loadedRoundaboutEdges;
1215 loadedRoundaboutEdges.insert(it->begin(), it->end());
1219 std::set<NBEdge*> candidates;
1221 for (EdgeCont::const_iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
1227 candidates.insert(e);
1232 std::set<NBEdge*> visited;
1233 for (std::set<NBEdge*>::const_iterator i = candidates.begin(); i != candidates.end(); ++i) {
1240 if (visited.count(e) > 0) {
1244 loopEdges.push_back(e);
1246#ifdef DEBUG_GUESS_ROUNDABOUT
1250#ifdef DEBUG_GUESS_ROUNDABOUT
1252 std::cout <<
" e=" << e->
getID() <<
" loopEdges=" <<
toString(loopEdges) <<
"\n";
1261#ifdef DEBUG_GUESS_ROUNDABOUT
1263 std::cout <<
" rbl\n";
1269 if (edges.size() < 2) {
1271#ifdef DEBUG_GUESS_ROUNDABOUT
1273 std::cout <<
" deadend\n";
1282#ifdef DEBUG_GUESS_ROUNDABOUT
1290 EdgeVector::const_iterator me = std::find(edges.begin(), edges.end(), e);
1300#ifdef DEBUG_GUESS_ROUNDABOUT
1302 std::cout <<
" noContinuation\n";
1312#ifdef DEBUG_GUESS_ROUNDABOUT
1314 std::cout <<
" e=" << e->
getID() <<
" left=" << left->
getID() <<
" nextLeft=" << nextLeft->
getID() <<
" angle=" << angle <<
" nextAngle=" << nextAngle <<
" eLength=" << e->
getLength() <<
" lLength=" << left->
getLength() <<
" dist=" << e->
getLaneShape(0).back().distanceTo2D(left->
getLaneShape(0).front()) <<
"\n";
1328#ifdef DEBUG_GUESS_ROUNDABOUT
1330 std::cout <<
" failed angle=" << angle <<
"\n";
1336 EdgeVector::const_iterator loopClosed = std::find(loopEdges.begin(), loopEdges.end(), left);
1337 const int loopSize = (int)(loopEdges.end() - loopClosed);
1342 }
else if (loopSize < (
int)loopEdges.size()) {
1344 EdgeVector(loopEdges.begin() + (loopEdges.size() - loopSize), loopEdges.end()).swap(loopEdges);
1347 int attachments = 0;
1348 for (EdgeVector::const_iterator j = loopEdges.begin(); j != loopEdges.end(); ++j) {
1349 if ((*j)->getToNode()->getEdges().size() > 2) {
1353 if (attachments < 3) {
1355#ifdef DEBUG_GUESS_ROUNDABOUT
1357 std::cout <<
" attachments=" << attachments <<
"\n";
1364 if (visited.count(left) > 0) {
1368 loopEdges.push_back(left);
1374#ifdef DEBUG_GUESS_ROUNDABOUT
1376 std::cout <<
" formFactor=" <<
formFactor(loopEdges) <<
"\n";
1381 EdgeSet guessed(loopEdges.begin(), loopEdges.end());
1382 if (loadedRoundaboutEdges.count(loopEdges.front()) != 0) {
1385 if ((*it).count(loopEdges.front()) != 0) {
1395#ifdef DEBUG_GUESS_ROUNDABOUT
1397 std::cout <<
" foundRoundabout=" <<
toString(loopEdges) <<
"\n";
1403#ifdef DEBUG_GUESS_ROUNDABOUT
1414 for (EdgeVector::const_iterator it = loopEdges.begin(); it != loopEdges.end(); ++it) {
1415 points.
append((*it)->getGeometry());
1417 double circumference = points.
length2D();
1418 return 4 *
M_PI * points.
area() / (circumference * circumference);
1422const std::set<EdgeSet>
1432 if (roundabout.size() > 0) {
1445 if (e->getToNode() == node) {
1462 std::vector<EdgeSet> rList;
1463 for (
const EdgeSet& r : roundabouts) {
1465 std::set_difference(r.begin(), r.end(), toRemove.begin(), toRemove.end(), std::inserter(r2, r2.end()));
1466 rList.push_back(r2);
1468 roundabouts.clear();
1469 roundabouts.insert(rList.begin(), rList.end());
1476 for (
NBEdge*
const edge : roundaboutSet) {
1478 NBNode*
const node = edge->getToNode();
1480 if (roundaboutSet.count(inEdge) > 0) {
1486 if (inEdge->getTurnDestination() !=
nullptr) {
1487 inEdge->removeFromConnections(inEdge->getTurnDestination(), -1);
1491 const std::vector<NBEdge::Connection> cons = inEdge->getConnections();
1493 if (con.toEdge && roundaboutSet.count(con.toEdge) == 0) {
1494 const double angle = fabs(
NBHelpers::normRelAngle(inEdge->getAngleAtNode(node), con.toEdge->getAngleAtNode(node)));
1496 inEdge->removeFromConnections(con.toEdge, -1);
1504 edge->setJunctionPriority(node, NBEdge::JunctionPriority::ROUNDABOUT);
1505 edge->setJunctionPriority(edge->getFromNode(), NBEdge::JunctionPriority::ROUNDABOUT);
1514 for (EdgeCont::iterator i =
myEdges.begin(); i !=
myEdges.end(); ++i) {
1558 int lanesCreated = 0;
1559 std::vector<std::string> edges;
1560 if (excludeOpt !=
"") {
1563 std::set<std::string> exclude(edges.begin(), edges.end());
1564 for (EdgeCont::iterator it =
myEdges.begin(); it !=
myEdges.end(); it++) {
1565 NBEdge* edge = it->second;
1567 exclude.count(edge->
getID()) == 0
1574 || (!fromPermissions && edge->
getSpeed() > minSpeed && edge->
getSpeed() <= maxSpeed)
1586 return lanesCreated;
1593 item.second->updateChangeRestrictions(ignoring);
1601 if (!numericaIDs && !reservedIDs && prefix ==
"" && !startGiven) {
1604 std::vector<std::string> avoid;
1610 std::set<std::string> reserve;
1613 avoid.insert(avoid.end(), reserve.begin(), reserve.end());
1616 std::set<NBEdge*, ComparatorIdLess> toChange;
1617 for (EdgeCont::iterator it =
myEdges.begin(); it !=
myEdges.end(); it++) {
1619 toChange.insert(it->second);
1626 toChange.insert(it->second);
1629 if (reservedIDs && reserve.count(it->first) > 0) {
1630 toChange.insert(it->second);
1634 std::map<std::string, std::vector<NBPTStop*> > stopsOnEdge;
1635 for (
const auto& item : sc.
getStops()) {
1636 stopsOnEdge[item.second->getEdgeId()].push_back(item.second);
1640 for (
NBEdge* edge : toChange) {
1643 for (
NBEdge* edge : toChange) {
1644 const std::string origID = edge->getID();
1646 edge->setOrigID(origID,
false);
1648 edge->setID(idSupplier.
getNext());
1649 myEdges[edge->getID()] = edge;
1650 for (
NBPTStop* stop : stopsOnEdge[origID]) {
1651 stop->setEdgeId(prefix + edge->getID(), *
this);
1654 if (prefix.empty()) {
1655 return (
int)toChange.size();
1660 for (
auto item : oldEdges) {
1662 rename(item.second, prefix + item.first);
1673 for (EdgeCont::const_iterator it =
myEdges.begin(); it !=
myEdges.end(); it++) {
1674 const NBEdge* e1 = it->second;
1680 for (EdgeCont::const_iterator it2 = it; it2 !=
myEdges.end(); it2++) {
1681 const NBEdge* e2 = it2->second;
1690 const double overlap = outline1.
getOverlapWith(outline2, zThreshold);
1691 if (overlap > threshold) {
1702 for (EdgeCont::const_iterator it =
myEdges.begin(); it !=
myEdges.end(); it++) {
1703 const NBEdge* edge = it->second;
1704 for (
int i = 0; i < (int)edge->
getNumLanes(); i++) {
1707 if (maxJump > 0.01) {
1709 }
else if (grade > threshold) {
1714 const std::vector<NBEdge::Connection>& connections = edge->
getConnections();
1715 for (std::vector<NBEdge::Connection>::const_iterator it_con = connections.begin(); it_con != connections.end(); ++it_con) {
1719 if (maxJump > 0.01) {
1721 }
else if (grade > threshold) {
1732 int affectedEdges = 0;
1734 if (item.second->joinLanes(perms)) {
1738 return affectedEdges;
1746 std::set<NBEdge*> tramEdges;
1747 std::set<NBEdge*> targetEdges;
1750 if (
isTram(permissions)) {
1751 if (item.second->getNumLanes() == 1) {
1752 tramEdges.insert(item.second);
1754 WRITE_WARNINGF(
TL(
"Not joining tram edge '%' with % lanes."), item.second->getID(), item.second->getNumLanes());
1757 targetEdges.insert(item.second);
1760 if (tramEdges.size() == 0 || targetEdges.size() == 0) {
1765 for (
NBEdge* edge : tramEdges) {
1766 const Boundary& bound = edge->getGeometry().getBoxBoundary();
1767 float min[2] = {
static_cast<float>(bound.
xmin()),
static_cast<float>(bound.
ymin()) };
1768 float max[2] = {
static_cast<float>(bound.
xmax()),
static_cast<float>(bound.
ymax()) };
1769 tramTree.
Insert(min, max, edge);
1772 std::map<std::pair<NBEdge*, int>,
NBEdge*> matches;
1774 for (
NBEdge* edge : targetEdges) {
1775 Boundary bound = edge->getGeometry().getBoxBoundary();
1776 bound.
grow(maxDist + edge->getTotalWidth());
1777 float min[2] = {
static_cast<float>(bound.
xmin()),
static_cast<float>(bound.
ymin()) };
1778 float max[2] = {
static_cast<float>(bound.
xmax()),
static_cast<float>(bound.
ymax()) };
1779 std::set<const Named*> nearby;
1781 tramTree.
Search(min, max, visitor);
1782 for (
const Named* namedEdge : nearby) {
1787 double minEdgeDist = maxDist + 1;
1791 for (
int i = 0; i < edge->getNumLanes(); i++) {
1792 double maxLaneDist = -1;
1796 const double dist = tramShape.
distance2D(pos,
false);
1797#ifdef DEBUG_JOIN_TRAM
1806 maxLaneDist =
MAX2(maxLaneDist, dist);
1808 if (maxLaneDist >= 0 && maxLaneDist < minEdgeDist) {
1809 minEdgeDist = maxLaneDist;
1823 if (angleOK && offset2 > offset1) {
1824 std::pair<NBEdge*, int> key = std::make_pair(edge, minLane);
1825 if (matches.count(key) == 0) {
1826 matches[key] = tramEdge;
1828 WRITE_WARNINGF(
TL(
"Ambiguous tram edges '%' and '%' for lane '%'."), matches[key]->getID(), tramEdge->
getID(), edge->getLaneID(minLane));
1830#ifdef DEBUG_JOIN_TRAM
1831 std::cout << edge->getLaneID(minLane) <<
" is close to tramEdge " << tramEdge->
getID() <<
" maxLaneDist=" << minEdgeDist <<
" tramLength=" << tramEdge->
getLength() <<
" edgeLength=" << edge->getLength() <<
" tramAngle=" << tramAngle <<
" edgeAngle=" << edge->getTotalAngle() <<
"\n";
1837 if (matches.size() == 0) {
1842 for (
NBEdge* tramEdge : tramEdges) {
1843 std::vector<std::pair<double, std::pair<NBEdge*, int> > > roads;
1844 for (
auto item : matches) {
1845 if (item.second == tramEdge) {
1846 NBEdge* road = item.first.first;
1847 int laneIndex = item.first.second;
1850 roads.push_back(std::make_pair(tramPos, item.first));
1853 if (roads.size() != 0) {
1855 sort(roads.begin(), roads.end());
1856#ifdef DEBUG_JOIN_TRAM
1857 std::cout <<
" tramEdge=" << tramEdge->getID() <<
" roads=";
1858 for (
auto item : roads) {
1859 std::cout << item.second.first->getLaneID(item.second.second) <<
",";
1861 std::cout <<
" offsets=";
1862 for (
auto item : roads) {
1863 std::cout << item.first <<
",";
1871 std::string tramEdgeID = tramEdge->getID();
1872 NBNode* tramFrom = tramEdge->getFromNode();
1874 const double tramLength = tramShape.
length();
1876 bool erasedLast =
false;
1877 for (
const auto& item : roads) {
1878 const double gap = item.first - pos;
1879 NBEdge* road = item.second.first;
1880 int laneIndex = item.second.second;
1882#ifdef DEBUG_JOIN_TRAM
1883 std::cout <<
" splitting tramEdge=" << tramEdge->
getID() <<
" at " << item.first <<
" (gap=" << gap <<
")\n";
1885 const std::string firstPartID = tramEdgeID +
"#" +
toString(tramPart++);
1891 incoming.push_back(firstPart);
1892 replacement.push_back(firstPart);
1896 replacement.push_back(road);
1899 tramEdge->reinitNodes(road->
getToNode(), tramEdge->getToNode());
1902#ifdef DEBUG_JOIN_TRAM
1903 std::cout <<
" shorted tramEdge=" << tramEdge->getID() <<
" (joined with roadEdge=" << road->
getID() <<
"\n";
1906#ifdef DEBUG_JOIN_TRAM
1907 std::cout <<
" erased tramEdge=" << tramEdge->getID() <<
"\n";
1914 road->
setOrigID(tramEdgeID,
true, laneIndex);
1916 for (
NBEdge* in : incoming) {
1917 if (
isTram(in->getPermissions()) && !in->isConnectedTo(road)) {
1919 in->reinitNodes(in->getFromNode(), road->
getFromNode());
1922#ifdef DEBUG_JOIN_TRAM
1923 std::cout <<
" erased incoming tramEdge=" << in->getID() <<
"\n";
1930 NBEdge* lastRoad = roads.back().second.first;
1934 for (
NBEdge* out : outEdges) {
1936 if (lastRoad->
getToNode() != out->getToNode()) {
1937 out->reinitNodes(lastRoad->
getToNode(), out->getToNode());
1940#ifdef DEBUG_JOIN_TRAM
1941 std::cout <<
" erased outgoing tramEdge=" << out->getID() <<
"\n";
1948 replacement.push_back(tramEdge);
1964 item.second->setNumericalID((
int)result.size());
1965 result.push_back(item.second);
1979 for (
const auto& item :
myEdges) {
#define WRITE_WARNINGF(...)
#define WRITE_WARNING(msg)
std::set< NBEdge * > EdgeSet
container for unique edges
std::vector< NBEdge * > EdgeVector
container for (sorted) edges
KeepClear
keepClear status of connections
std::vector< NBRouterEdge * > RouterEdgeVector
#define JOIN_TRAM_MIN_LENGTH
#define JOIN_TRAM_MAX_ANGLE
const SVCPermissions SVCAll
all VClasses are allowed
bool isRailway(SVCPermissions permissions)
Returns whether an edge with the given permission is a railway edge.
bool isTram(SVCPermissions permissions)
Returns whether an edge with the given permission is a tram edge.
bool isForbidden(SVCPermissions permissions)
Returns whether an edge with the given permission is a forbidden edge.
SVCPermissions parseVehicleClasses(const std::string &allowedS)
Parses the given definition of allowed vehicle classes into the given containers Deprecated classes g...
bool isSidewalk(SVCPermissions permissions)
Returns whether an edge with the given permission is a sidewalk.
SUMOVehicleClass
Definition of vehicle classes to differ between different lane usage and authority types.
@ SVC_PASSENGER
vehicle is a passenger car (a "normal" car)
@ SVC_TRAM
vehicle is a light rail
@ SVC_BUS
vehicle is a bus
@ SVC_PEDESTRIAN
pedestrian
int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
const std::string SUMO_PARAM_ORIGID
SumoXMLNodeType
Numbers representing special SUMO-XML-attribute values for representing node- (junction-) types used ...
bool gDebugFlag1
global utility flags for debugging
const double SUMO_const_laneWidth
const double SUMO_const_haltingSpeed
the speed threshold at which vehicles are considered as halting
const double SUMO_const_halfLaneWidth
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
A class that stores a 2D geometrical boundary.
double ymin() const
Returns minimum y-coordinate.
double xmin() const
Returns minimum x-coordinate.
Boundary & grow(double by)
extends the boundary by the given amount
bool overlapsWith(const AbstractPoly &poly, double offset=0) const
Returns whether the boundary overlaps with the given polygon.
double ymax() const
Returns maximum y-coordinate.
double xmax() const
Returns maximum x-coordinate.
static GeoConvHelper & getProcessing()
the coordinate transformation to use for input conversion and processing
bool x2cartesian_const(Position &from) const
Converts the given coordinate into a cartesian using the previous initialisation.
static GeoConvHelper & getLoaded()
the coordinate transformation that was loaded fron an input file
static PositionVector parseShapeReporting(const std::string &shpdef, const std::string &objecttype, const char *objectid, bool &ok, bool allowEmpty, bool report=true)
Builds a PositionVector from a string representation, reporting occurred errors.
static const double INVALID_OFFSET
a value to signify offsets outside the range of [0, Line.length()]
static double nearest_offset_on_line_to_point2D(const Position &lineStart, const Position &lineEnd, const Position &p, bool perpendicular=true)
static double legacyDegree(const double angle, const bool positive=false)
static double getMinAngleDiff(double angle1, double angle2)
Returns the minimum distance (clockwise/counter-clockwise) between both angles.
std::string getNext()
Returns the next id.
static void nextCW(const EdgeVector &edges, EdgeVector::const_iterator &from)
A container for districts.
void removeFromSinksAndSources(NBEdge *const e)
Removes the given edge from the lists of sources and sinks in all stored districts.
Sorts splits by their position (increasing)
void patchRoundabouts(NBEdge *orig, NBEdge *part1, NBEdge *part2, std::set< EdgeSet > &roundabouts)
fix roundabout information after splitting an edge
void computeEdgeShapes(double smoothElevationThreshold=-1)
Computes the shapes of all edges stored in the container.
void removeUnwishedEdges(NBDistrictCont &dc)
Removes unwished edges (not in keep-edges)
NBEdge * getByID(const std::string &edgeID) const
Returns the edge with id if it exists.
const std::set< EdgeSet > getRoundabouts() const
Returns the determined roundabouts.
void computeEdge2Edges(bool noLeftMovers)
Computes for each edge the approached edges.
int guessRoundabouts()
Determines which edges belong to roundabouts and increases their priority.
bool myNeedGeoTransformedPruningBoundary
whether a geo transform has been applied to the pruning boundary
void sortOutgoingLanesConnections()
Sorts all lanes of all edges within the container by their direction.
void addRoundabout(const EdgeSet &roundabout)
add user specified roundabout
std::set< EdgeSet > myRoundabouts
Edges marked as belonging to a roundabout by the user (each EdgeVector is a roundabout)
void appendRailwayTurnarounds(const NBPTStopCont &sc)
Appends turnarounds to all bidiRail edges with stops.
std::set< std::string > myEdges2Remove
Set of ids of edges which shall explicitly be removed.
std::set< std::string > myIgnoredEdges
The ids of ignored edges.
void updateAllChangeRestrictions(SVCPermissions ignoring)
modify all restrictions on lane changing for edges and connections
double myEdgesMinSpeed
The minimum speed an edge may have in order to be kept (default: -1)
void recheckPostProcessConnections()
Try to set any stored connections.
void checkGeometries(const double maxAngle, const double minRadius, bool fix, bool fixRailways, bool silent=false)
void extract(NBDistrictCont &dc, NBEdge *edge, bool remember=false)
Removes the given edge from the container like erase but does not delete it.
void processSplits(NBEdge *e, std::vector< Split > splits, NBNodeCont &nc, NBDistrictCont &dc, NBTrafficLightLogicCont &tlc)
EdgeVector getAllEdges() const
return all edges
void erase(NBDistrictCont &dc, NBEdge *edge)
Removes the given edge from the container (deleting it)
NBEdge * retrieve(const std::string &id, bool retrieveExtracted=false) const
Returns the edge that has the given id.
std::set< std::string > myTypes2Keep
Set of edges types which shall be kept.
void recheckLanes()
Rechecks whether all lanes have a successor for each of the stored edges.
NBEdge * getOppositeByID(const std::string &edgeID) const
Returns the edge with negated id if it exists.
EdgeCont myExtractedEdges
The extracted nodes which are kept for reference.
void reduceGeometries(const double minDist)
void recheckLaneSpread()
Rechecks whether the lane spread is proper.
bool ignoreFilterMatch(NBEdge *edge)
Returns true if this edge matches one of the removal criteria.
void removeRoundabout(const NBNode *node)
remove roundabout that contains the given node
void splitGeometry(NBDistrictCont &dc, NBNodeCont &nc)
Splits edges into multiple if they have a complex geometry.
void addPostProcessConnection(const std::string &from, int fromLane, const std::string &to, int toLane, bool mayDefinitelyPass, KeepClear keepClear, double contPos, double visibility, double speed, double friction, double length, const PositionVector &customShape, bool uncontrolled, bool warnOnly, SVCPermissions permissions=SVC_UNSPECIFIED, bool indirectLeft=false, const std::string &edgeType="", SVCPermissions changeLeft=SVC_UNSPECIFIED, SVCPermissions changeRight=SVC_UNSPECIFIED)
Adds a connection which could not be set during loading.
void computeLanes2Edges()
Computes for each edge which lanes approach the next edges.
NBEdge * retrievePossiblySplit(const std::string &id, bool downstream) const
Tries to retrieve an edge, even if it is splitted.
RouterEdgeVector getAllRouterEdges() const
void rename(NBEdge *edge, const std::string &newID)
Renames the edge. Throws exception if newID already exists.
int joinTramEdges(NBDistrictCont &dc, NBPTStopCont &sc, NBPTLineCont &lc, double maxDist)
join tram edges into adjacent lanes
bool hasPostProcessConnection(const std::string &from, const std::string &to="")
EdgeCont myEdges
The instance of the dictionary (id->edge)
std::set< std::string > myEdges2Keep
Set of ids of edges which shall explicitly be kept.
NBTypeCont & myTypeCont
The network builder; used to obtain type information.
void generateStreetSigns()
assigns street signs to edges based on toNode types
void clearControllingTLInformation() const
Clears information about controlling traffic lights for all connenections of all edges.
std::set< EdgeSet > myGuessedRoundabouts
Edges marked as belonging to a roundabout after guessing.
void clear()
Deletes all edges.
void guessOpposites()
Sets opposite lane information for geometrically close edges.
void markRoundabouts()
mark edge priorities and prohibit turn-arounds for all roundabout edges
std::set< std::string > myTypes2Remove
Set of edges types which shall be removed.
void applyOptions(OptionsCont &oc)
Initialises the storage by applying given options.
void removeRoundaboutEdges(const EdgeSet &toRemove)
remove edges from all stored roundabouts
PositionVector myPruningBoundary
Boundary within which an edge must be located in order to be kept.
int joinLanes(SVCPermissions perms)
join adjacent lanes with the given permissions
void checkOverlap(double threshold, double zThreshold) const
check whether edges overlap
SVCPermissions myVehicleClasses2Remove
Set of vehicle types which need not be supported (edges which allow ONLY these are removed)
int guessSpecialLanes(SUMOVehicleClass svc, double width, double minSpeed, double maxSpeed, bool fromPermissions, const std::string &excludeOpt, NBTrafficLightLogicCont &tlc)
add sidwalks to edges within the given limits or permissions and return the number of edges affected
EdgeVector getGeneratedFrom(const std::string &id) const
Returns the edges which have been built by splitting the edge of the given id.
void appendTurnarounds(bool noTLSControlled, bool noFringe, bool onlyDeadends, bool onlyTurnlane, bool noGeometryLike)
Appends turnarounds to all edges stored in the container.
SVCPermissions myVehicleClasses2Keep
Set of vehicle types which must be allowed on edges in order to keep them.
void computeLaneShapes()
Computes the shapes of all lanes of all edges stored in the container.
void joinSameNodeConnectingEdges(NBDistrictCont &dc, NBTrafficLightLogicCont &tlc, EdgeVector edges)
Joins the given edges because they connect the same nodes.
bool myRemoveEdgesAfterJoining
Whether edges shall be joined first, then removed.
std::map< std::string, NBEdge * > EdgeCont
The type of the dictionary where an edge may be found by its id.
std::map< const NBEdge *, std::pair< NBEdge *, NBEdge * > > myEdgesSplit
the number of splits of edges during the building
std::map< std::string, std::vector< PostProcessConnection > > myConnections
The list of connections to recheck.
bool insert(NBEdge *edge, bool ignorePrunning=false)
Adds an edge to the dictionary.
NBEdgeCont(NBTypeCont &tc)
Constructor.
int remapIDs(bool numericaIDs, bool reservedIDs, const std::string &prefix, NBPTStopCont &sc)
remap node IDs accoring to options –numerical-ids and –reserved-ids
bool checkConsistency(const NBNodeCont &nc)
ensure that all edges have valid nodes
static double formFactor(const EdgeVector &loopEdges)
compute the form factor for a loop of edges
bool splitAt(NBDistrictCont &dc, NBEdge *edge, NBNode *node)
Splits the edge at the position nearest to the given node.
std::vector< std::string > getAllNames() const
Returns all ids of known edges.
void checkGrade(double threshold) const
check whether edges are to steep
The representation of a single edge during network building.
bool addEdge2EdgeConnection(NBEdge *dest, bool overrideRemoval=false)
Adds a connection to another edge.
NBEdge * guessOpposite(bool reguess=false)
set oppositeID and return opposite edge if found
double getLength() const
Returns the computed length of the edge.
SVCPermissions getPermissions(int lane=-1) const
get the union of allowed classes over all lanes or for a specific lane
const std::vector< Connection > & getConnections() const
Returns the connections.
void setPermissions(SVCPermissions permissions, int lane=-1)
set allowed/disallowed classes for the given lane or for all lanes if -1 is given
double getLoadedLength() const
Returns the length was set explicitly or the computed length if it wasn't set.
void setSpeed(int lane, double speed)
set lane specific speed (negative lane implies set for all lanes)
NBNode * getToNode() const
Returns the destination node of the edge.
PositionVector getCCWBoundaryLine(const NBNode &n) const
get the outer boundary of this edge when going counter-clock-wise around the given node
static const double UNSPECIFIED_FRICTION
unspecified lane friction
void incLaneNo(int by)
increment lane
Lane & getLaneStruct(int lane)
void setAverageLengthWithOpposite(double val)
patch average lane length in regard to the opposite edge
const PositionVector & getGeometry() const
Returns the geometry of the edge.
LaneSpreadFunction getLaneSpreadFunction() const
Returns how this edge's lanes' lateral offset is computed.
bool isBidiRail(bool ignoreSpread=false) const
whether this edge is part of a bidirectional railway
void dismissVehicleClassInformation()
dimiss vehicle class information
LaneSpreadFunction myLaneSpreadFunction
The information about how to spread the lanes.
bool addLane2LaneConnection(int fromLane, NBEdge *dest, int toLane, Lane2LaneInfoType type, bool mayUseSameDestination=false, bool mayDefinitelyPass=false, KeepClear keepClear=KEEPCLEAR_UNSPECIFIED, double contPos=UNSPECIFIED_CONTPOS, double visibility=UNSPECIFIED_VISIBILITY_DISTANCE, double speed=UNSPECIFIED_SPEED, double friction=UNSPECIFIED_FRICTION, double length=myDefaultConnectionLength, const PositionVector &customShape=PositionVector::EMPTY, const bool uncontrolled=UNSPECIFIED_CONNECTION_UNCONTROLLED, SVCPermissions permissions=SVC_UNSPECIFIED, const bool indirectLeft=false, const std::string &edgeType="", SVCPermissions changeLeft=SVC_UNSPECIFIED, SVCPermissions changeRight=SVC_UNSPECIFIED, bool postProcess=false)
Adds a connection between the specified this edge's lane and an approached one.
const std::vector< NBEdge::Lane > & getLanes() const
Returns the lane definitions.
@ LANES2LANES_USER
Lanes to lanes - relationships are loaded; no recheck is necessary/wished.
double getSpeed() const
Returns the speed allowed on this edge.
const std::string & getID() const
void setLaneWidth(int lane, double width)
set lane specific width (negative lane implies set for all lanes)
void setLaneSpreadFunction(LaneSpreadFunction spread)
(Re)sets how the lanes lateral offset shall be computed
std::vector< Lane > myLanes
Lane information.
int getNumLanes() const
Returns the number of lanes.
void setFriction(int lane, double friction)
set lane specific friction (negative lane implies set for all lanes)
static const double UNSPECIFIED_CONTPOS
unspecified internal junction position
void addRestrictedLane(double width, SUMOVehicleClass vclass)
add a lane of the given width, restricted to the given class and shift existing connections
void removeFromConnections(NBEdge *toEdge, int fromLane=-1, int toLane=-1, bool tryLater=false, const bool adaptToLaneRemoval=false, const bool keepPossibleTurns=false)
Removes the specified connection(s)
void invalidateConnections(bool reallowSetting=false)
invalidate current connections of edge
double getTotalWidth() const
Returns the combined width of all lanes of this edge.
static const double UNSPECIFIED_VISIBILITY_DISTANCE
unspecified foe visibility for connections
bool isConnectedTo(const NBEdge *e, const bool ignoreTurnaround=false) const
Returns the information whethe a connection to the given edge has been added (or computed)
void addSign(NBSign sign)
add Sign
void moveOutgoingConnectionsFrom(NBEdge *e, int laneOff)
move outgoing connection
std::string getLaneID(int lane) const
get lane ID
@ USER
The connection was given by the user.
@ VALIDATED
The connection was computed and validated.
@ COMPUTED
The connection was computed.
bool setConnection(int lane, NBEdge *destEdge, int destLane, Lane2LaneInfoType type, bool mayUseSameDestination=false, bool mayDefinitelyPass=false, KeepClear keepClear=KEEPCLEAR_UNSPECIFIED, double contPos=UNSPECIFIED_CONTPOS, double visibility=UNSPECIFIED_VISIBILITY_DISTANCE, double speed=UNSPECIFIED_SPEED, double friction=UNSPECIFIED_FRICTION, double length=myDefaultConnectionLength, const PositionVector &customShape=PositionVector::EMPTY, const bool uncontrolled=UNSPECIFIED_CONNECTION_UNCONTROLLED, SVCPermissions permissions=SVC_UNSPECIFIED, bool indirectLeft=false, const std::string &edgeType="", SVCPermissions changeLeft=SVC_UNSPECIFIED, SVCPermissions changeRight=SVC_UNSPECIFIED, bool postProcess=false)
Adds a connection to a certain lane of a certain edge.
int getJunctionPriority(const NBNode *const node) const
Returns the junction priority (normalised for the node currently build)
const std::string & getTypeID() const
get ID of type
const std::string & getStreetName() const
Returns the street name of this edge.
NBNode * getFromNode() const
Returns the origin node of the edge.
NBEdge * getTurnDestination(bool possibleDestination=false) const
double getAngleAtNode(const NBNode *const node) const
Returns the angle of the edge's geometry at the given node.
static const double UNSPECIFIED_WIDTH
unspecified lane width
bool hasRestrictedLane(SUMOVehicleClass vclass) const
returns whether any lane already allows the given vclass exclusively
void copyConnectionsFrom(NBEdge *src)
copy connections from antoher edge
void setEndOffset(int lane, double offset)
set lane specific end-offset (negative lane implies set for all lanes)
static const double UNSPECIFIED_OFFSET
unspecified lane offset
bool recheckLanes()
recheck whether all lanes within the edge are all right and optimises the connections once again
void setOrigID(const std::string origID, const bool append, const int laneIdx=-1)
set origID for all lanes or for a specific lane
const PositionVector & getLaneShape(int i) const
Returns the shape of the nth lane.
void setLoadedLength(double val)
set loaded length
void decLaneNo(int by)
decrement lane
NBNode * myFrom
The source and the destination node.
double getFinalLength() const
get length that will be assigned to the lanes in the final network
void setGeometry(const PositionVector &g, bool inner=false)
(Re)sets the edge's geometry
static void loadPrefixedIDsFomFile(const std::string &file, const std::string prefix, std::set< std::string > &into)
Add prefixed ids defined in file.
static double relAngle(double angle1, double angle2)
computes the relative angle between the two angles
static double normRelAngle(double angle1, double angle2)
ensure that reverse relAngles (>=179.999) always count as turnarounds (-180)
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.
static bool transformCoordinates(PositionVector &from, bool includeInBoundary=true, GeoConvHelper *from_srs=nullptr)
Container for nodes during the netbuilding process.
bool insert(const std::string &id, const Position &position, NBDistrict *district=0)
Inserts a node into the map.
NBNode * retrieve(const std::string &id) const
Returns the node with the given name.
void markAsSplit(const NBNode *node)
mark a node as being created form a split
Represents a single node (junction) during network building.
void invalidateOutgoingConnections(bool reallowSetting=false)
invalidate outgoing connections
void removeEdge(NBEdge *edge, bool removeFromConnections=true)
Removes edge from this node and optionally removes connections as well.
const std::set< NBTrafficLightDefinition * > & getControllingTLS() const
Returns the traffic lights that were assigned to this node (The set of tls that control this node)
bool isSimpleContinuation(bool checkLaneNumbers=true, bool checkWidth=false) const
check if node is a simple continuation
SumoXMLNodeType getType() const
Returns the type of this node.
const EdgeVector & getIncomingEdges() const
Returns this node's incoming edges (The edges which yield in this node)
const EdgeVector & getOutgoingEdges() const
Returns this node's outgoing edges (The edges which start at this node)
void replaceOutgoing(NBEdge *which, NBEdge *by, int laneOff)
Replaces occurences of the first edge within the list of outgoing by the second Connections are remap...
void setRoundabout()
update the type of this node as a roundabout
void invalidateTLS(NBTrafficLightLogicCont &tlCont, bool removedConnections, bool addedConnections)
causes the traffic light to be computed anew
void replaceIncoming(NBEdge *which, NBEdge *by, int laneOff)
Replaces occurences of the first edge within the list of incoming by the second Connections are remap...
const Position & getPosition() const
const EdgeVector & getEdges() const
Returns all edges which participate in this node (Edges that start or end at this node)
bool typeWasGuessed() const
return whether a priority road turns at this node
void removeDoubleEdges()
remove duble edges
NBEdge * getConnectionTo(NBNode *n) const
get connection to certain node
void replaceEdge(const std::string &edgeID, const EdgeVector &replacement)
replace the edge with the given edge list in all lines
void replaceEdge(const std::string &edgeID, const EdgeVector &replacement)
replace the edge with the closes edge on the given edge list in all stops
const std::map< std::string, NBPTStop * > & getStops() const
The representation of a single pt stop.
A class representing a single street sign.
@ SIGN_TYPE_RIGHT_BEFORE_LEFT
@ SIGN_TYPE_LEFT_BEFORE_RIGHT
A container for traffic light definitions and built programs.
void replaceRemoved(NBEdge *removed, int removedLane, NBEdge *by, int byLane, bool incoming)
Replaces occurences of the removed edge/lane in all definitions by the given edge.
A storage for available edgeTypes of edges.
bool getEdgeTypeShallBeDiscarded(const std::string &edgeType) const
Returns the information whether edges of this edgeType shall be discarded.
bool knows(const std::string &edgeType) const
Returns whether the named edgeType is in the container.
Allows to store the object; used as context while traveling the rtree in TraCI.
Base class for objects which have an id.
virtual void setID(const std::string &newID)
resets the id
static std::string getIDSecure(const T *obj, const std::string &fallBack="NULL")
get an identifier for Named-like object which may be Null
const std::string & getID() const
Returns the id.
A RT-tree for efficient storing of SUMO's Named objects.
void Insert(const float a_min[2], const float a_max[2], Named *const &a_data)
Insert entry.
int Search(const float a_min[2], const float a_max[2], const Named::StoringVisitor &c) const
Find all within search rectangle.
A storage for options typed value containers)
bool isSet(const std::string &name, bool failOnNonExistant=true) const
Returns the information whether the named option is set.
double getFloat(const std::string &name) const
Returns the double-value of the named option (only for Option_Float)
std::string getString(const std::string &name) const
Returns the string-value of the named option (only for Option_String)
bool isDefault(const std::string &name) const
Returns the information whether the named option has still the default value.
bool exists(const std::string &name) const
Returns the information whether the named option is known.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
const StringVector & getStringVector(const std::string &name) const
Returns the list of string-value of the named option (only for Option_StringVector)
std::string getValueString(const std::string &name) const
Returns the string-value of the named option (all options)
static OptionsCont & getOptions()
Retrieves the options.
virtual const std::string getParameter(const std::string &key, const std::string defaultValue="") const
Returns the value for a given key.
A point in 2D or 3D with translation and scaling methods.
double angleTo2D(const Position &other) const
returns the angle in the plane of the vector pointing from here to the other position
double length2D() const
Returns the length.
void append(const PositionVector &v, double sameThreshold=2.0)
double length() const
Returns the length.
double distance2D(const Position &p, bool perpendicular=false) const
closest 2D-distance to point p (or -1 if perpendicular is true and the point is beyond this vector)
double nearest_offset_to_point2D(const Position &p, bool perpendicular=true) const
return the nearest offest to point 2D
std::pair< PositionVector, PositionVector > splitAt(double where, bool use2D=false) const
Returns the two lists made when this list vector is splitted at the given point.
void move2side(double amount, double maxExtension=100)
move position vector to side using certain ammount
Boundary getBoxBoundary() const
Returns a boundary enclosing this list of lines.
double getOverlapWith(const PositionVector &poly, double zThreshold) const
Returns the maximum overlaps between this and the given polygon (when not separated by at least zThre...
bool partialWithin(const AbstractPoly &poly, double offset=0) const
Returns the information whether this polygon lies partially within the given polygon.
double getMaxGrade(double &maxJump) const
double area() const
Returns the area (0 for non-closed)
bool intersects(const Position &p1, const Position &p2) const
Returns the information whether this list of points interesects the given line.
Position positionAtOffset2D(double pos, double lateralOffset=0) const
Returns the position at the given length.
PositionVector getSubpart(double beginOffset, double endOffset) const
get subpart of a position vector
static std::string getEdgeIDFromLane(const std::string laneID)
return edge id when given the lane ID
static long long int toLong(const std::string &sData)
converts a string into the long value described by it by calling the char-type converter,...
static double toDouble(const std::string &sData)
converts a string into the double value described by it by calling the char-type converter
static bool startsWith(const std::string &str, const std::string prefix)
Checks whether a given string starts with the prefix.
A structure which describes a connection between edges or lanes.
NBEdge * toEdge
The edge the connections yields in.
PositionVector viaShape
shape of via
std::string getDescription(const NBEdge *parent) const
get string describing this connection
PositionVector shape
shape of Connection
An (internal) definition of a single lane of an edge.
std::string oppositeID
An opposite lane ID, if given.
A structure representing a connection between two lanes.
A structure which describes changes of lane number or speed along the road.
int offsetFactor
direction in which to apply the offset (used by netgenerate for lefthand networks)
double speed
The speed after this change.
double offset
lateral offset to edge geometry
std::string nameID
the default node id
std::string idBefore
The id for the edge before the split.
double pos
The position of this change.
std::vector< int > lanes
The lanes after this change.
std::string idAfter
The id for the edge after the split.
NBNode * node
The new node that is created for this split.