59 #define DEBUGCOND (getID() == "disabled") 60 #define DEBUGCOND2(obj) ((obj != 0 && (obj)->getID() == "disabled")) 108 double visibility_,
double speed_,
bool haveVia_,
bool uncontrolled_,
const PositionVector& customShape_) :
131 connectionsDone(false) {
144 assert((
int)myTransitions.size() > virtEdge);
146 NBEdge* succEdge = myTransitions[virtEdge];
147 std::vector<int> lanes;
151 std::map<NBEdge*, std::vector<int> >::iterator i =
myConnections.find(succEdge);
159 std::vector<int>::iterator j = find(lanes.begin(), lanes.end(), lane);
160 if (j == lanes.end()) {
162 lanes.push_back(lane);
175 if (outgoing.size() == 0) {
179 assert(outgoing.size() > 0);
181 #ifdef DEBUG_CONNECTION_GUESSING 183 std::cout <<
" MainDirections edge=" << parent->
getID() <<
" straightest=" << outgoing[indexOfStraightest]->getID() <<
" dir=" <<
toString(straightestDir) <<
"\n";
195 if (outgoing.back()->getJunctionPriority(to) == 1) {
201 if (outgoing.back()->getPriority() > tmp[0]->getPriority()) {
204 if (outgoing.back()->getNumLanes() > tmp[0]->getNumLanes()) {
213 NBEdge* edge = *(tmp.begin());
226 return myDirs.empty();
232 return find(myDirs.begin(), myDirs.end(), d) != myDirs.end();
252 std::string type,
double speed,
int nolanes,
253 int priority,
double laneWidth,
double offset,
254 const std::string& streetName,
270 init(nolanes,
false,
"");
275 std::string type,
double speed,
int nolanes,
276 int priority,
double laneWidth,
double offset,
278 const std::string& streetName,
279 const std::string& origID,
295 init(nolanes, tryIgnoreNodePositions, origID);
325 if (to == tpl->
myTo) {
334 double speed,
int nolanes,
int priority,
336 const std::string& streetName,
338 bool tryIgnoreNodePositions) {
360 const std::vector<Lane> oldLanes =
myLanes;
361 init(nolanes, tryIgnoreNodePositions, oldLanes.empty() ?
"" : oldLanes[0].getParameter(
SUMO_PARAM_ORIGID));
362 for (
int i = 0; i < (int)nolanes; ++i) {
364 myLanes[i] = oldLanes[
MIN2(i, (
int)oldLanes.size() - 1)];
383 if (from == 0 || to == 0) {
384 throw ProcessError(
"At least one of edge's '" +
myID +
"' nodes is not known.");
401 NBEdge::init(
int noLanes,
bool tryIgnoreNodePositions,
const std::string& origID) {
406 throw ProcessError(
"At least one of edge's '" +
myID +
"' nodes is not known.");
412 if (!tryIgnoreNodePositions ||
myGeom.size() < 2) {
427 WRITE_WARNING(
"Edge's '" +
myID +
"' from- and to-node are at the same position.");
435 assert(
myGeom.size() >= 2);
436 if ((
int)
myLanes.size() > noLanes) {
438 for (
int lane = noLanes; lane < (int)
myLanes.size(); ++lane) {
443 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
444 for (
int lane = noLanes; lane < (int)
myLanes.size(); ++lane) {
445 (*i)->removeFromConnections(
this, -1, lane);
450 for (
int i = 0; i < noLanes; i++) {
456 #ifdef DEBUG_CONNECTION_GUESSING 458 std::cout <<
"init edge=" <<
getID() <<
"\n";
460 std::cout <<
" conn " <<
getID() <<
"_" << (*i).fromLane <<
" to " <<
Named::getIDSecure((*i).toEdge) <<
"_" << (*i).toLane <<
"\n";
461 (*i).shape.mirrorX();
462 (*i).viaShape.mirrorX();
476 for (
int i = 0; i < (int)
myLanes.size(); i++) {
477 myLanes[i].shape.add(xoff, yoff, 0);
480 (*i).customShape.add(xoff, yoff, 0);
489 for (
int i = 0; i < (int)
myLanes.size(); i++) {
493 (*i).shape.mirrorX();
494 (*i).viaShape.mirrorX();
526 assert(node ==
myTo);
556 assert(node ==
myTo);
585 if (rectangularCut) {
586 const double extend = 100;
590 border.push_back(p2);
592 if (border.size() == 2) {
593 double edgeWidth = 0;
594 for (
int i = 0; i < (int)
myLanes.size(); i++) {
601 assert(node ==
myTo);
605 #ifdef DEBUG_NODE_BORDER 608 <<
" rect=" << rectangularCut
609 <<
" p=" << p <<
" p2=" << p2
610 <<
" border=" << border
623 assert(node ==
myTo);
633 if (shape.size() < 2) {
635 const double oldLength = old.
length();
644 const double midpoint = old.
length() / 2;
647 assert(shape.size() >= 2);
648 assert(shape.
length() > 0);
656 tmp.push_back(shape[0]);
657 tmp.push_back(shape[-1]);
673 const double midpoint = old.
length() / 2;
676 assert(shape.size() >= 2);
677 assert(shape.
length() > 0);
680 const double midpoint = shape.
length() / 2;
697 for (
int i = 0; i < (int)
myLanes.size(); i++) {
701 double avgLength = 0;
702 for (
int i = 0; i < (int)
myLanes.size(); i++) {
703 assert(
myLanes[i].shape.length() > 0);
704 avgLength +=
myLanes[i].shape.length();
713 if (nodeShape.size() == 0) {
723 assert(pbv.size() > 0);
735 const double dZ = ns.size() >= 2 ? fabs(ns[0].z() - ns[1].z()) : 0;
741 assert(ns.size() >= 2);
746 assert(pbv.size() > 0);
756 const double dZ = result.size() >= 2 ? fabs(result[0].z() - result[1].z()) : 0;
809 NBEdge* currentEdge =
this;
810 for (
int i = 1; i < (int)
myGeom.size() - 1; i++) {
812 if (i != (
int)
myGeom.size() - 2) {
813 std::string nodename =
myID +
"_in_between#" +
toString(i);
815 throw ProcessError(
"Error on adding in-between node '" + nodename +
"'.");
823 currentEdge->
myTo = newTo;
826 std::string edgename =
myID +
"[" +
toString(i - 1) +
"]";
830 if (!ec.
insert(currentEdge,
true)) {
831 throw ProcessError(
"Error on adding splitted edge '" + edgename +
"'.");
856 std::vector<double> angles;
858 for (
int i = 0; i < (int)
myGeom.size() - 1; ++i) {
863 for (
int i = 0; i < (int)angles.size() - 1; ++i) {
866 if (maxAngle > 0 && relAngle > maxAngle) {
872 if (i == 0 || i == (
int)angles.size() - 2) {
873 const bool start = i == 0;
875 const double r = tan(0.5 * (
M_PI - relAngle)) * dist;
877 if (minRadius > 0 && r < minRadius) {
880 (start ?
"start" :
"end") +
" of edge '" +
getID() +
"'.");
886 (start ?
"start" :
"end") +
" of edge '" +
getID() +
"'.");
923 bool mayUseSameDestination,
924 bool mayDefinitelyPass,
942 return setConnection(from, dest, toLane, type, mayUseSameDestination, mayDefinitelyPass, keepClear, contPos, visibility, speed, customShape);
950 bool invalidatePrevious,
951 bool mayDefinitelyPass) {
952 if (invalidatePrevious) {
956 for (
int i = 0; i < no && ok; i++) {
966 bool mayUseSameDestination,
967 bool mayDefinitelyPass,
997 if ((*i).toEdge == destEdge && ((*i).fromLane == -1 || (*i).toLane == -1)) {
1004 if (mayDefinitelyPass) {
1036 std::vector<NBEdge::Connection>
1038 std::vector<NBEdge::Connection> ret;
1040 if ((*i).fromLane == lane) {
1052 (*i).fromLane == fromLane
1053 && (*i).toEdge == to
1054 && (*i).toLane == toLane) {
1059 +
" to " + to->
getID() +
"_" +
toString(toLane) +
" not found");
1066 (*i).fromLane == fromLane
1067 && (*i).toEdge == to
1068 && (*i).toLane == toLane) {
1073 +
" to " + to->
getID() +
"_" +
toString(toLane) +
" not found");
1104 if (find(outgoing.begin(), outgoing.end(), (*i).toEdge) == outgoing.end()) {
1105 outgoing.push_back((*i).toEdge);
1110 if (it->fromLane < 0 && it->toLane < 0) {
1112 EdgeVector::iterator forbidden = find(outgoing.begin(), outgoing.end(), it->toEdge);
1113 if (forbidden != outgoing.end()) {
1114 outgoing.erase(forbidden);
1119 int size = (int) outgoing.size();
1121 edges->reserve(size);
1122 for (EdgeVector::const_iterator i = outgoing.begin(); i != outgoing.end(); i++) {
1125 edges->push_back(outedge);
1137 if (find(ret.begin(), ret.end(), (*i).toEdge) == ret.end()) {
1138 ret.push_back((*i).toEdge);
1149 for (EdgeVector::const_iterator i = candidates.begin(); i != candidates.end(); i++) {
1150 if ((*i)->isConnectedTo(
this)) {
1160 std::vector<int> ret;
1163 if ((*i).toEdge == currentOutgoing) {
1164 ret.push_back((*i).fromLane);
1187 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
1192 for (EdgeVector::iterator j = connected.begin(); j != connected.end(); j++) {
1203 const int fromLaneRemoved = adaptToLaneRemoval && fromLane >= 0 ? fromLane : -1;
1204 const int toLaneRemoved = adaptToLaneRemoval && toLane >= 0 ? toLane : -1;
1207 if ((toEdge == 0 || c.
toEdge == toEdge)
1208 && (fromLane < 0 || c.
fromLane == fromLane)
1209 && (toLane < 0 || c.
toLane == toLane)) {
1212 for (std::set<NBTrafficLightDefinition*>::iterator it = tldefs.begin(); it != tldefs.end(); it++) {
1219 if (fromLaneRemoved >= 0 && c.
fromLane > fromLaneRemoved) {
1222 for (std::set<NBTrafficLightDefinition*>::iterator it = tldefs.begin(); it != tldefs.end(); it++) {
1223 for (NBConnectionVector::iterator tlcon = (*it)->getControlledLinks().begin(); tlcon != (*it)->getControlledLinks().end(); ++tlcon) {
1233 if (toLaneRemoved >= 0 && c.
toLane > toLaneRemoved) {
1256 if (((*i).toEdge == connectionToRemove.
toEdge) && ((*i).fromLane == connectionToRemove.
fromLane) && ((*i).toLane == connectionToRemove.
toLane)) {
1271 if (reallowSetting) {
1283 if ((*i).toEdge == which) {
1285 (*i).toLane += laneOff;
1296 std::map<int, int> laneMap;
1300 bool wasConnected =
false;
1302 if ((*i).toEdge != which) {
1305 wasConnected =
true;
1306 if ((*i).fromLane != -1) {
1307 int fromLane = (*i).fromLane;
1308 laneMap[(*i).toLane] = fromLane;
1309 if (minLane == -1 || minLane > fromLane) {
1312 if (maxLane == -1 || maxLane < fromLane) {
1317 if (!wasConnected) {
1323 std::vector<NBEdge::Connection> conns = origConns;
1324 for (std::vector<NBEdge::Connection>::iterator i = conns.begin(); i != conns.end(); ++i) {
1325 if ((*i).toEdge == which) {
1328 int fromLane = (*i).fromLane;
1330 if (laneMap.find(fromLane) == laneMap.end()) {
1331 if (fromLane >= 0 && fromLane <= minLane) {
1334 if (fromLane >= 0 && fromLane >= maxLane) {
1338 toUse = laneMap[fromLane];
1344 (*i).contPos, (*i).visibility, (*i).speed, (*i).customShape);
1373 std::vector<Connection>::iterator i =
myConnections.begin() + index;
1397 std::string innerID =
":" + n.
getID();
1399 int edgeIndex = linkIndex;
1400 int internalLaneIndex = 0;
1412 if (con.
toEdge != toEdge || (isTurn && !joinTurns)) {
1415 edgeIndex = linkIndex;
1416 toEdge = (*i).toEdge;
1417 internalLaneIndex = 0;
1420 std::vector<int> foeInternalLinks;
1427 std::pair<double, std::vector<int> > crossingPositions(-1, std::vector<int>());
1428 std::set<std::string> tmpFoeIncomingLanes;
1437 for (EdgeVector::const_iterator i2 = incoming.begin(); i2 != incoming.end(); ++i2) {
1438 const std::vector<Connection>& elv = (*i2)->getConnections();
1439 for (std::vector<NBEdge::Connection>::const_iterator k2 = elv.begin(); k2 != elv.end(); k2++) {
1440 if ((*k2).toEdge == 0) {
1443 bool needsCont = n.
needsCont(
this, *i2, con, *k2);
1446 crossingPositions.second.push_back(index);
1450 double width2 = (*k2).toEdge->getLaneWidth((*k2).toLane);
1451 if ((*k2).toEdge->getPermissions((*k2).toLane) !=
SVC_BICYCLE) {
1457 if (crossingPositions.first < 0 || crossingPositions.first > minDV) {
1458 crossingPositions.first = minDV;
1463 this, con.
toEdge, con.
fromLane, (*i2), (*k2).toEdge, (*k2).fromLane);
1465 if (n.
foes(
this, con.
toEdge, *i2, (*k2).toEdge) || rightTurnConflict) {
1466 foeInternalLinks.push_back(index);
1470 if ((n.
forbids(*i2, (*k2).toEdge,
this, con.
toEdge, signalised) || rightTurnConflict) && (needsCont || dir ==
LINKDIR_TURN)) {
1471 tmpFoeIncomingLanes.insert((*i2)->getID() +
"_" +
toString((*k2).fromLane));
1477 std::vector<NBNode::Crossing*> crossings = n.
getCrossings();
1478 for (
auto c : crossings) {
1480 for (EdgeVector::const_iterator it_e = crossing.
edges.begin(); it_e != crossing.
edges.end(); ++it_e) {
1481 const NBEdge* edge = *it_e;
1483 if (
this == edge || con.
toEdge == edge) {
1484 foeInternalLinks.push_back(index);
1485 if (con.
toEdge == edge &&
1493 if (crossingPositions.first < 0 || crossingPositions.first > minDV) {
1494 crossingPositions.first = minDV;
1517 crossingPositions.first = -1;
1520 crossingPositions.first = con.
contPos;
1542 assert(shape.size() >= 2);
1544 con.
id = innerID +
"_" +
toString(edgeIndex);
1545 if (crossingPositions.first >= 0) {
1546 std::pair<PositionVector, PositionVector>
split = shape.
splitAt(crossingPositions.first);
1547 con.
shape = split.first;
1550 con.
viaID = innerID +
"_" +
toString(splitIndex + noInternalNoSplits);
1558 ++internalLaneIndex;
1566 double intersect = std::numeric_limits<double>::max();
1578 if (tmp.size() > 0) {
1579 intersect =
MIN2(intersect, tmp[0]);
1582 if (tmp.size() > 0) {
1583 intersect =
MIN2(intersect, tmp[0]);
1616 assert(atNode ==
myTo);
1631 assert(atNode ==
myTo);
1639 if (!onlyPossible) {
1659 std::vector<double> offsets(
myLanes.size(), 0.);
1661 for (
int i = (
int)
myLanes.size() - 2; i >= 0; --i) {
1663 offsets[i] = offset;
1670 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
1676 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
1677 offsets[i] += offset;
1681 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
1682 if (
myLanes[i].customShape.size() != 0) {
1689 WRITE_WARNING(
"In edge '" +
getID() +
"': lane shape could not be determined (" + e.what() +
").");
1742 if (
DEBUGCOND) std::cout <<
"computeAngle edge=" <<
getID() <<
" fromCenter=" << fromCenter <<
" toCenter=" << toCenter
1743 <<
" refStart=" << referencePosStart <<
" refEnd=" << referencePosEnd <<
" shape=" << shape
1744 <<
" hasFromShape=" << hasFromShape
1745 <<
" hasToShape=" << hasToShape
1771 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1772 if ((*i).permissions !=
SVCAll) {
1782 std::vector<Lane>::const_iterator i =
myLanes.begin();
1785 for (; i !=
myLanes.end(); ++i) {
1786 if (i->permissions != firstLanePermissions) {
1796 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1807 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1808 if (i->width !=
myLanes.begin()->width) {
1818 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1819 if (i->endOffset !=
myLanes.begin()->endOffset) {
1829 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1840 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1841 if (i->customShape.size() > 0) {
1851 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1852 if (i->getMap().size() > 0) {
1881 for (EdgeVector::const_iterator i = o.begin(); i != o.end(); ++i) {
1918 #ifdef DEBUG_CONNECTION_GUESSING 1920 std::cout <<
"recheckLanes (initial) edge=" <<
getID() <<
"\n";
1922 std::cout <<
" conn " <<
getID() <<
"_" << (*i).fromLane <<
" to " <<
Named::getIDSecure((*i).toEdge) <<
"_" << (*i).toLane <<
"\n";
1923 (*i).shape.mirrorX();
1924 (*i).viaShape.mirrorX();
1928 std::vector<int> connNumbersPerLane(
myLanes.size(), 0);
1930 if ((*i).toEdge == 0 || (*i).fromLane < 0 || (*i).toLane < 0) {
1933 if ((*i).fromLane >= 0) {
1934 ++connNumbersPerLane[(*i).fromLane];
1945 for (
int i = 0; i < (int)
myLanes.size(); i++) {
1961 }
else if (common == 0) {
1964 const int origToLane = c.
toLane;
1966 int toLane = origToLane;
1979 int toLane = origToLane;
2014 if (incoming.size() > 1) {
2015 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2017 bool connected =
false;
2018 for (std::vector<NBEdge*>::const_iterator in = incoming.begin(); in != incoming.end(); ++in) {
2019 if ((*in)->hasConnectionTo(
this, i)) {
2031 #ifdef DEBUG_CONNECTION_GUESSING 2033 std::cout <<
"recheckLanes (final) edge=" <<
getID() <<
"\n";
2035 std::cout <<
" conn " <<
getID() <<
"_" << (*i).fromLane <<
" to " <<
Named::getIDSecure((*i).toEdge) <<
"_" << (*i).toLane <<
"\n";
2036 (*i).shape.mirrorX();
2037 (*i).viaShape.mirrorX();
2047 if (outgoing->size() == 0) {
2059 #ifdef DEBUG_CONNECTION_GUESSING 2061 std::cout <<
" divideOnEdges " <<
getID() <<
" outgoing=" <<
toString(*outgoing) <<
" prios=" <<
toString(*priorities) <<
"\n";
2066 std::vector<int> availableLanes;
2067 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
2069 availableLanes.push_back(i);
2072 if (availableLanes.size() > 0) {
2076 availableLanes.clear();
2077 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
2082 availableLanes.push_back(i);
2084 if (availableLanes.size() > 0) {
2088 availableLanes.clear();
2089 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
2094 availableLanes.push_back(i);
2096 if (availableLanes.size() > 0) {
2100 availableLanes.clear();
2101 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
2106 availableLanes.push_back(i);
2108 if (availableLanes.size() > 0) {
2113 if ((*i).fromLane == -1) {
2132 const int numOutgoing = (int) outgoing->size();
2133 std::vector<double> resultingLanes;
2134 resultingLanes.reserve(numOutgoing);
2135 double sumResulting = 0.;
2136 double minResulting = 10000.;
2137 for (
int i = 0; i < numOutgoing; i++) {
2141 (double)(*priorities)[i] *
2142 (double) availableLanes.size() / (double) prioSum;
2144 if (res > availableLanes.size()) {
2145 res = (double) availableLanes.size();
2148 resultingLanes.push_back(res);
2149 sumResulting += res;
2150 if (minResulting > res && res > 0) {
2162 transition.reserve(numOutgoing);
2163 for (
int i = 0; i < numOutgoing; i++) {
2166 assert(i < (
int)resultingLanes.size());
2167 const int tmpNum = (int)std::ceil(resultingLanes[i] / minResulting);
2168 numVirtual += tmpNum;
2169 for (
double j = 0; j < tmpNum; j++) {
2170 transition.push_back((*outgoing)[i]);
2173 #ifdef DEBUG_CONNECTION_GUESSING 2175 std::cout <<
" prioSum=" << prioSum <<
" sumResulting=" << sumResulting <<
" minResulting=" << minResulting <<
" numVirtual=" << numVirtual <<
" availLanes=" <<
toString(availableLanes) <<
" resLanes=" <<
toString(resultingLanes) <<
" transition=" <<
toString(transition) <<
"\n";
2184 for (EdgeVector::const_iterator i = outgoing->begin(); i != outgoing->end(); ++i) {
2186 assert(l2eConns.find(target) != l2eConns.end());
2187 const std::vector<int> lanes = (l2eConns.find(target))->second;
2188 for (std::vector<int>::const_iterator j = lanes.begin(); j != lanes.end(); ++j) {
2189 const int fromIndex = availableLanes[*j];
2208 if (numConsToTarget >= targetLanes) {
2213 for (
int ii = 0; ii < (int)
myLanes.size(); ++ii) {
2221 if (
myLanes[fromIndex].connectionsDone) {
2227 #ifdef DEBUG_CONNECTION_GUESSING 2229 std::cout <<
" request connection from " <<
getID() <<
"_" << fromIndex <<
" to " << target->
getID() <<
"\n";
2242 const int numOutgoing = (int) outgoing->size();
2244 NBEdge* rightOfTarget = 0;
2245 NBEdge* leftOfTarget = 0;
2247 for (
int i = 0; i < numOutgoing; i++) {
2248 if (maxPrio < (*priorities)[i]) {
2251 maxPrio = (*priorities)[i];
2252 target = (*outgoing)[i];
2253 rightOfTarget = i == 0 ? outgoing->back() : (*outgoing)[i - 1];
2254 leftOfTarget = i + 1 == numOutgoing ? outgoing->front() : (*outgoing)[i + 1];
2266 const int numDesiredConsToTarget =
MIN2(targetLanes, (
int)availableLanes.size());
2267 #ifdef DEBUG_CONNECTION_GUESSING 2269 std::cout <<
" checking extra lanes for target=" << target->
getID() <<
" cons=" << numConsToTarget <<
" desired=" << numDesiredConsToTarget <<
"\n";
2272 std::vector<int>::const_iterator it_avail = availableLanes.begin();
2273 while (numConsToTarget < numDesiredConsToTarget && it_avail != availableLanes.end()) {
2274 const int fromIndex = *it_avail;
2283 && !
myLanes[fromIndex].connectionsDone
2285 #ifdef DEBUG_CONNECTION_GUESSING 2287 std::cout <<
" candidate from " <<
getID() <<
"_" << fromIndex <<
" to " << target->
getID() <<
"\n";
2296 #ifdef DEBUG_CONNECTION_GUESSING 2298 std::cout <<
" request additional connection from " <<
getID() <<
"_" << fromIndex <<
" to " << target->
getID() <<
"\n";
2304 #ifdef DEBUG_CONNECTION_GUESSING 2309 <<
" rightOfTarget=" << rightOfTarget->
getID()
2310 <<
" leftOfTarget=" << leftOfTarget->
getID()
2324 std::vector<int>* priorities =
new std::vector<int>();
2325 if (outgoing->size() == 0) {
2328 priorities->reserve(outgoing->size());
2329 EdgeVector::const_iterator i;
2330 for (i = outgoing->begin(); i != outgoing->end(); i++) {
2333 assert((prio + 1) * 2 > 0);
2334 prio = (prio + 1) * 2;
2335 priorities->push_back(prio);
2342 i = find(outgoing->begin(), outgoing->end(), *(tmp.begin()));
2343 int dist = (int) distance(outgoing->begin(), i);
2345 #ifdef DEBUG_CONNECTION_GUESSING 2347 <<
" outgoing=" <<
toString(*outgoing)
2348 <<
" priorities1=" <<
toString(*priorities)
2355 assert(priorities->size() > 0);
2356 (*priorities)[0] /= 2;
2357 #ifdef DEBUG_CONNECTION_GUESSING 2359 std::cout <<
" priorities2=" <<
toString(*priorities) <<
"\n";
2366 if (mainDirections.
empty()) {
2367 assert(dist < (
int)priorities->size());
2368 (*priorities)[dist] *= 2;
2369 #ifdef DEBUG_CONNECTION_GUESSING 2371 std::cout <<
" priorities3=" <<
toString(*priorities) <<
"\n";
2376 (*priorities)[dist] += 1;
2380 (*priorities)[0] /= 4;
2381 (*priorities)[(int)priorities->size() - 1] /= 2;
2382 #ifdef DEBUG_CONNECTION_GUESSING 2384 std::cout <<
" priorities6=" <<
toString(*priorities) <<
"\n";
2391 (*priorities)[dist] *= 2;
2392 #ifdef DEBUG_CONNECTION_GUESSING 2394 std::cout <<
" priorities4=" <<
toString(*priorities) <<
"\n";
2398 (*priorities)[dist] *= 3;
2399 #ifdef DEBUG_CONNECTION_GUESSING 2401 std::cout <<
" priorities5=" <<
toString(*priorities) <<
"\n";
2414 for (std::vector<int>::const_iterator i = priorities.begin(); i != priorities.end(); i++) {
2432 const int fromLane = (int)
myLanes.size() - 1;
2434 if (checkPermissions) {
2465 if (pos < tolerance) {
2479 for (
int i = 0; i < lanes; i++) {
2481 for (std::vector<NBEdge::Connection>::iterator j = elv.begin(); j != elv.end(); j++) {
2483 assert(el.
tlID ==
"");
2529 assert(fromLane < 0 || fromLane < (
int)
myLanes.size());
2531 if (fromLane >= 0 && toLane >= 0) {
2533 std::vector<Connection>::iterator i =
2541 connection.
tlID = tlID;
2549 bool hadError =
false;
2551 if ((*i).toEdge != toEdge) {
2554 if (fromLane >= 0 && fromLane != (*i).fromLane) {
2557 if (toLane >= 0 && toLane != (*i).toLane) {
2560 if ((*i).tlID ==
"") {
2562 (*i).tlLinkNo = tlIndex;
2565 if ((*i).tlID != tlID && (*i).tlLinkNo == tlIndex) {
2566 WRITE_WARNING(
"The lane '" + toString<int>((*i).fromLane) +
"' on edge '" +
getID() +
"' already had a traffic light signal.");
2571 if (hadError && no == 0) {
2572 WRITE_WARNING(
"Could not set any signal of the tlLogic '" + tlID +
"' (unknown group)");
2608 ret =
myLanes[lane].shape.reverse();
2628 ret =
myLanes[lane].shape.reverse();
2640 reason =
"laneNumber";
2645 reason =
"priority";
2655 reason =
"spreadType";
2664 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2666 reason =
"lane " +
toString(i) +
" speed";
2668 }
else if (
myLanes[i].permissions != possContinuation->
myLanes[i].permissions) {
2669 reason =
"lane " +
toString(i) +
" permissions";
2671 }
else if (
myLanes[i].width != possContinuation->
myLanes[i].width) {
2672 reason =
"lane " +
toString(i) +
" width";
2696 if (find(conn.begin(), conn.end(), possContinuation) == conn.end()) {
2697 reason =
"disconnected";
2708 reason =
"disconnected";
2714 if (conns.size() !=
myLanes.size() - offset) {
2715 reason =
"some lanes disconnected";
2731 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2737 if (origID != origID2) {
2765 if ((*i).toEdge == e && (*i).tlID !=
"") {
2797 assert(distances.size() > 0);
2804 assert(index <= (
int)
myLanes.size());
2808 int templateIndex = index > 0 ? index - 1 : index + 1;
2819 for (EdgeVector::const_iterator i = incs.begin(); i != incs.end(); ++i) {
2820 (*i)->invalidateConnections(
true);
2828 int newLaneNo = (int)
myLanes.size() + by;
2829 while ((
int)
myLanes.size() < newLaneNo) {
2839 assert(index < (
int)
myLanes.size());
2844 for (EdgeVector::const_iterator i = incs.begin(); i != incs.end(); ++i) {
2845 (*i)->invalidateConnections(
true);
2854 int newLaneNo = (int)
myLanes.size() - by;
2855 assert(newLaneNo > 0);
2856 while ((
int)
myLanes.size() > newLaneNo) {
2874 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2878 assert(lane < (
int)
myLanes.size());
2879 myLanes[lane].permissions |= vclass;
2887 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2891 assert(lane < (
int)
myLanes.size());
2892 myLanes[lane].permissions &= ~vclass;
2900 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2904 assert(lane < (
int)
myLanes.size());
2905 myLanes[lane].preferred |= vclass;
2915 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2921 assert(lane < (
int)
myLanes.size());
2937 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2954 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2960 assert(lane < (
int)
myLanes.size());
2961 myLanes[lane].endOffset = offset;
2970 for (
int i = 0; i < (int)
myLanes.size(); i++) {
2976 assert(lane < (
int)
myLanes.size());
2983 assert(lane < (
int)
myLanes.size());
2984 myLanes[lane].accelRamp = accelRamp;
2991 assert(lane < (
int)
myLanes.size());
2992 myLanes[lane].customShape = shape;
2999 for (
int i = 0; i < (int)
myLanes.size(); i++) {
3004 assert(lane < (
int)
myLanes.size());
3005 myLanes[lane].permissions = permissions;
3013 for (
int i = 0; i < (int)
myLanes.size(); i++) {
3018 assert(lane < (
int)
myLanes.size());
3019 myLanes[lane].preferred = permissions;
3028 for (
int i = 0; i < (int)
myLanes.size(); i++) {
3033 assert(lane < (
int)
myLanes.size());
3034 return myLanes[lane].permissions;
3047 for (std::vector<Lane>::iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
3048 (*i).permissions =
SVCAll;
3071 for (
int i = start; i != end; i += direction) {
3088 for (
int i = start; i != end; i += direction) {
3089 if (
myLanes[i].permissions != 0) {
3093 return end - direction;
3097 std::set<SVCPermissions>
3099 std::set<SVCPermissions> result;
3103 for (
int i = iStart; i < iEnd; ++i) {
3120 std::cout <<
getID() <<
" angle=" <<
getAngleAtNode(node) <<
" convAngle=" << angle <<
"\n";
3138 for (
int i = 0; i < (int)
myLanes.size(); i++) {
3143 for (
int i = 0; i < (int)
myLanes.size(); i++) {
3177 if (
myLanes[0].permissions == vclass) {
3189 myLanes[0].permissions = vclass;
3200 for (EdgeVector::const_iterator it = incoming.begin(); it != incoming.end(); ++it) {
3201 (*it)->shiftToLanesToEdge(
this, 1);
3212 if (
myLanes[0].permissions != vclass) {
3222 for (EdgeVector::const_iterator it = incoming.begin(); it != incoming.end(); ++it) {
3223 (*it)->shiftToLanesToEdge(
this, 0);
3236 if ((*it).toEdge == to && (*it).toLane >= 0) {
3237 (*it).toLane += laneOff;
3246 const int i = (node ==
myTo ? -1 : 0);
3247 const int i2 = (node ==
myTo ? 0 : -1);
3253 if (dist < neededOffset && dist2 < neededOffset2) {
3261 WRITE_WARNING(
"Could not avoid overlapping shape at node '" + node->
getID() +
"' for edge '" +
getID() +
"'");
3284 for (
int i = 0; i < (int)
myLanes.size(); i++) {
3289 for (
int i = 0; i < (int)
myLanes.size(); i++) {
bool mayBeTLSControlled(int fromLane, NBEdge *toEdge, int toLane) const
return true if certain connection must be controlled by TLS
LaneSpreadFunction getLaneSpreadFunction() const
Returns how this edge's lanes' lateral offset is computed.
bool gDebugFlag1
global utility flags for debugging
bool around(const Position &p, double offset=0) const
Returns the information whether the position vector describes a polygon lying around the given point...
std::string id
id of Connection
void moveConnectionToRight(int lane)
void invalidateConnections(bool reallowSetting=false)
invalidate current connections of edge
bool expandableBy(NBEdge *possContinuation, std::string &reason) const
Check if Node is expandable.
int tlLinkNo
The index of this connection within the controlling traffic light.
void init(int noLanes, bool tryIgnoreNodePositions, const std::string &origID)
Initialization routines common to all constructors.
The link is a partial left direction.
NBNode * retrieve(const std::string &id) const
Returns the node with the given name.
std::vector< Lane > myLanes
Lane information.
double vmax
maximun velocity
double getLength() const
Returns the computed length of the edge.
double getAngleAtNodeToCenter(const NBNode *const node) const
Returns the angle of from the node shape center to where the edge meets the node shape.
bool setControllingTLInformation(const NBConnection &c, const std::string &tlID)
Returns if the link could be set as to be controlled.
double length2D() const
Returns the length.
void divideOnEdges(const EdgeVector *outgoing)
divides the lanes on the outgoing edges
A structure which describes a connection between edges or lanes.
int getFirstAllowedLaneIndex(int direction) const
return the first lane that permits at least 1 vClass or the last lane if search direction of there is...
int toLane
The lane the connections yields in.
bool foes(const NBEdge *const from1, const NBEdge *const to1, const NBEdge *const from2, const NBEdge *const to2) const
Returns the information whether the given flows cross.
std::string foeIncomingLanes
FOE Incomings lanes.
int getInt(const std::string &name) const
Returns the int-value of the named option (only for Option_Integer)
static const double UNSPECIFIED_LOADED_LENGTH
no length override given
std::vector< TLSDisabledConnection > myTLSDisabledConnections
vector with the disabled connections
void append(const PositionVector &v, double sameThreshold=2.0)
PositionVector getOrthogonal(const Position &p, double extend, bool before, double length=1.0) const
return orthogonal through p (extending this vector if necessary)
LaneSpreadFunction myLaneSpreadFunction
The information about how to spread the lanes.
double z() const
Returns the z-position.
void sortOutgoingConnectionsByAngle()
sorts the outgoing connections by their angle relative to their junction
std::string viaID
if Connection have a via, ID of it
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) ...
NBEdge * toEdge
The edge the connections yields in.
void shiftTLConnectionLaneIndex(NBEdge *edge, int offset)
patches loaded signal plans by modifying lane indices
EdgeVector getIncomingEdges() const
Returns the list of incoming edges unsorted.
void mirrorX()
mirror coordinates along the x-axis
SUMOVehicleClass
Definition of vehicle classes to differ between different lane usage and authority types...
static const double UNSPECIFIED_VISIBILITY_DISTANCE
unspecified foe visibility for connections
void setEndOffset(int lane, double offset)
set lane specific end-offset (negative lane implies set for all lanes)
The relationships between edges are computed/loaded.
double getLaneSpeed(int lane) const
get lane speed
bool hasPermissions() const
whether at least one lane has restrictions
bool isConnectedTo(const NBEdge *e) const
Returns the information whethe a connection to the given edge has been added (or computed) ...
void reduceGeometry(const double minDist)
Removes points with a distance lesser than the given.
bool hasSignalisedConnectionTo(const NBEdge *const e) const
Check if edge has signalised connections.
double myLaneWidth
This width of this edge's lanes.
double myEndOffset
This edges's offset to the intersection begin (will be applied to all lanes)
void setSpeed(int lane, double speed)
set lane specific speed (negative lane implies set for all lanes)
Holds (- relative to the edge it is build from -!!!) the list of main directions a vehicle that drive...
PositionVector computeInternalLaneShape(NBEdge *fromE, const NBEdge::Connection &con, int numPoints, NBNode *recordError=0) const
Compute the shape for an internal lane.
Position positionAtOffset2D(double pos, double lateralOffset=0) const
Returns the position at the given length.
double getSignalOffset() const
Returns the offset of a traffic signal from the end of this edge.
Some static methods for string processing.
static const double ANGLE_LOOKAHEAD
the distance at which to take the default angle
int getJunctionPriority(const NBNode *const node) const
Returns the junction priority (normalised for the node currently build)
void moveConnectionToLeft(int lane)
std::vector< Crossing * > getCrossings() const
return this junctions pedestrian crossings
int getPriority() const
Returns the priority of the edge.
void removeEdge(NBEdge *edge, bool removeFromConnections=true)
Removes edge from this node and optionally removes connections as well.
const std::string & getTypeID() const
get ID of type
const double SUMO_const_laneWidth
bool empty() const
returns the information whether no following street has a higher priority
void addIncomingEdge(NBEdge *edge)
adds an incoming edge
int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
The representation of a single edge during network building.
void reinitNodes(NBNode *from, NBNode *to)
Resets nodes but keeps all other values the same (used when joining)
void clearControllingTLInformation()
clears tlID for all connections
void setNodeBorder(const NBNode *node, const Position &p, const Position &p2, bool rectangularCut)
Set Node border.
Lane2LaneInfoType
Modes of setting connections between lanes.
std::vector< int > * prepareEdgePriorities(const EdgeVector *outgoing)
recomputes the edge priorities and manipulates them for a distribution of lanes on edges which is mor...
Lane(NBEdge *e, const std::string &_origID)
constructor
const double SUMO_const_laneWidthAndOffset
The link is a 180 degree turn.
bool hasLaneSpecificSpeed() const
whether lanes differ in speed
static const double UNSPECIFIED_SIGNAL_OFFSET
unspecified signal offset
std::vector< Direction > myDirs
list of the main direction within the following junction relative to the edge
void markAsInLane2LaneState()
mark edge as in lane to state lane
static const double UNSPECIFIED_OFFSET
unspecified lane offset
void removeFromConnections(NBEdge *toEdge, int fromLane=-1, int toLane=-1, bool tryLater=false, const bool adaptToLaneRemoval=false)
Removes the specified connection(s)
double getMaxLaneOffset()
get max lane offset
TLS Disabled Connections.
double angleTo2D(const Position &other) const
returns the angle in the plane of the vector pointing from here to the other position ...
Lanes to lanes - relationships are computed; should be recheked.
Position getCentroid() const
Returns the centroid (closes the polygon if unclosed)
bool hasLoadedLength() const
Returns whether a length was set explicitly.
NBEdge * getTurnDestination(bool possibleDestination=false) const
void setPermissions(SVCPermissions permissions, int lane=-1)
set allowed/disallowed classes for the given lane or for all lanes if -1 is given ...
PositionVector shape
The crossing's shape.
int myFromJunctionPriority
The priority normalised for the node the edge is outgoing of.
void setLoadedLength(double val)
set loaded lenght
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::vector< NBEdge::Lane > & getLanes() const
Returns the lane definitions.
void computeLaneShapes()
compute lane shapes
bool mayDefinitelyPass
Information about being definitely free to drive (on-ramps)
PositionVector reverse() const
reverse position vector
NBEdge(const std::string &id, NBNode *from, NBNode *to, std::string type, double speed, int nolanes, int priority, double width, double offset, const std::string &streetName="", LaneSpreadFunction spread=LANESPREAD_RIGHT)
Constructor.
PositionVector myGeom
The geometry for the edge.
double visibility
custom foe visiblity for connection
bool isForbidden(SVCPermissions permissions)
Returns whether an edge with the given permission is a forbidden edge.
void remapConnections(const EdgeVector &incoming)
Remaps the connection in a way that allows the removal of it.
const double SUMO_const_laneOffset
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
const std::string & getID() const
Returns the id.
void insert_noDoublePos(const std::vector< Position >::iterator &at, const Position &p)
insert in front a non double position
bool isRailway(SVCPermissions permissions)
Returns whether an edge with the given permission is a railway edge.
const SVCPermissions SVCAll
all VClasses are allowed
std::vector< int > getConnectionLanes(NBEdge *currentOutgoing) const
Returns the list of lanes that may be used to reach the given edge.
std::vector< double > distances(const PositionVector &s, bool perpendicular=false) const
distances of all my points to s and all of s points to myself
PositionVector myFromBorder
intersection borders (because the node shape might be invalid)
void restoreBikelane(std::vector< NBEdge::Lane > oldLanes, PositionVector oldGeometry, std::vector< NBEdge::Connection > oldConnections)
restore an previously added BikeLane
void addSidewalk(double width)
add a pedestrian sidewalk of the given width and shift existing connctions
void addOutgoingEdge(NBEdge *edge)
adds an outgoing edge
void setGeometry(const PositionVector &g, bool inner=false)
(Re)sets the edge's geometry
std::string getDescription(const NBEdge *parent) const
get string describing this connection
std::pair< PositionVector, PositionVector > splitAt(double where) const
Returns the two lists made when this list vector is splitted at the given point.
void shiftLaneIndex(NBEdge *edge, int offset)
patches lane indices refering to the given edge
bool includes(Direction d) const
returns the information whether the street in the given direction has a higher priority ...
double getShapeStartAngle() const
Returns the angle at the start of the edge.
static const double UNSPECIFIED_WIDTH
unspecified lane width
The link is a (hard) left direction.
PositionVector customShape
custom shape for connection
#define WRITE_WARNING(msg)
The connection was computed and validated.
bool hasDefaultGeometryEndpoints() const
Returns whether the geometry is terminated by the node positions This default may be violated by init...
static OptionsCont & getOptions()
Retrieves the options.
void shortenGeometryAtNode(const NBNode *node, double reduction)
linearly extend the geometry at the given node
void setLaneShape(int lane, const PositionVector &shape)
sets a custom lane shape
void setAcceleration(int lane, bool accelRamp)
marks one lane as acceleration lane
static bool rightTurnConflict(const NBEdge *from, const NBEdge *to, int fromLane, const NBEdge *prohibitorFrom, const NBEdge *prohibitorTo, int prohibitorFromLane, bool lefthand=false)
return whether the given laneToLane connection is a right turn which must yield to a bicycle crossing...
static double legacyDegree(const double angle, const bool positive=false)
const EdgeVector & getOutgoingEdges() const
Returns this node's outgoing edges (The edges which start at this node)
PositionVector cutAtIntersection(const PositionVector &old) const
cut shape at the intersection shapes
The edge has been loaded, nothing is computed yet.
NBNode * tryGetNodeAtPosition(double pos, double tolerance=5.0) const
Returns the node at the given edges length (using an epsilon)
int getFirstNonPedestrianLaneIndex(int direction, bool exclusive=false) const
return the first lane with permissions other than SVC_PEDESTRIAN and 0
LinkDirection
The different directions a link between two lanes may take (or a stream between two edges)...
int myToJunctionPriority
The priority normalised for the node the edge is incoming in.
The link is a straight direction.
PositionVector shape
shape of Connection
static const double UNSPECIFIED_SPEED
unspecified lane speed
void restoreSidewalk(std::vector< NBEdge::Lane > oldLanes, PositionVector oldGeometry, std::vector< NBEdge::Connection > oldConnections)
restore an previously added sidewalk
bool keepClear
whether the junction must be kept clear when using this connection
void addRestrictedLane(double width, SUMOVehicleClass vclass)
add a lane of the given width, restricted to the given class and shift existing connections ...
std::vector< Connection > getConnectionsFromLane(int lane) const
Returns connections from a given lane.
An (internal) definition of a single lane of an edge.
void addLane(int index, bool recompute=true)
add lane
bool addEdge2EdgeConnection(NBEdge *dest)
Adds a connection to another edge.
void extrapolate2D(const double val, const bool onlyFirst=false)
extrapolate position vector in two dimensions (Z is ignored)
void incLaneNo(int by)
increment lane
bool isTLControlled() const
Returns whether this node is controlled by any tls.
bool myAmMacroscopicConnector
Information whether this edge is a (macroscopic) connector.
void push_front_noDoublePos(const Position &p)
insert in front a non double position
void removeDoublePoints(double minDist=POSITION_EPS, bool assertLength=false)
Removes positions if too near.
bool computeLanes2Edges()
computes the edge, step2: computation of which lanes approach the edges)
NBEdge * myTurnDestination
The turn destination edge (if a connection exists)
double myStartAngle
The angles of the edge.
bool hasLaneSpecificWidth() const
whether lanes differ in width
double speed
custom speed for connection
Lanes to lanes - relationships are loaded; no recheck is necessary/wished.
bool knowsParameter(const std::string &key) const
Returns whether the parameter is known.
bool hasLaneSpecificEndOffset() const
whether lanes differ in offset
bool insert(NBEdge *edge, bool ignorePrunning=false)
Adds an edge to the dictionary.
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
static const int FORWARD
edge directions (for pedestrian related stuff)
bool hasDefaultGeometryEndpointAtNode(const NBNode *node) const
Returns whether the geometry is terminated by the node positions This default may be violated by init...
void decLaneNo(int by)
decrement lane
std::string tlID
The id of the traffic light that controls this connection.
double beginEndAngle() const
returns the angle in radians of the line connecting the first and the last position ...
std::string getLaneID(int lane) const
get Lane ID (Secure)
int getNumLanes() const
Returns the number of lanes.
int fromLane
The lane the connections starts at.
A point in 2D or 3D with translation and scaling methods.
void deleteLane(int index, bool recompute=true)
delete lane
int operator()(const Connection &c1, const Connection &c2) const
comparing operation
bool addLane2LaneConnections(int fromLane, NBEdge *dest, int toLane, int no, Lane2LaneInfoType type, bool invalidatePrevious=false, bool mayDefinitelyPass=false)
Builds no connections starting at the given lanes.
void setOrigID(const std::string origID)
set origID for all lanes
const PositionVector getInnerGeometry() const
Returns the geometry of the edge without the endpoints.
void moveOutgoingConnectionsFrom(NBEdge *e, int laneOff)
move outgoing connection
static int computePrioritySum(const std::vector< int > &priorities)
computes the sum of the given list's entries (sic!)
static bool connections_sorter(const Connection &c1, const Connection &c2)
connections_sorter sort by fromLane, toEdge and toLane
void resetNodeBorder(const NBNode *node)
static const double UNSPECIFIED_CONTPOS
unspecified internal junction position
bool needsLaneSpecificOutput() const
whether at least one lane has values differing from the edges values
bool hasConnectionTo(NBEdge *destEdge, int destLane, int fromLane=-1) const
Retrieves info about a connection to a certain lane of a certain edge.
NBEdge * myPossibleTurnDestination
The edge that would be the turn destination if there was one.
bool hasDefaultGeometry() const
Returns whether the geometry consists only of the node positions.
int myPriority
The priority of the edge.
static double firstIntersection(const PositionVector &v1, const PositionVector &v2, double width2)
compute the first intersection point between the given lane geometries considering their rspective wi...
bool geometryLike() const
whether this is structurally similar to a geometry node
Storage for edges, including some functionality operating on multiple edges.
std::vector< std::string > & split(const std::string &s, char delim, std::vector< std::string > &elems)
The link is a (hard) right direction.
Connection(int fromLane_, NBEdge *toEdge_, int toLane_)
Constructor.
std::string getSidewalkID()
get the lane id for the canonical sidewalk lane
EdgeBuildingStep myStep
The building step.
const std::string & getStreetName() const
Returns the street name of this edge.
double getAngleAtNode(const NBNode *const node) const
Returns the angle of the edge's geometry at the given node.
std::vector< double > intersectsAtLengths2D(const PositionVector &other) const
For all intersections between this vector and other, return the 2D-length of the subvector from this ...
void setParameter(const std::string &key, const std::string &value)
Sets a parameter.
Class to sort edges by their angle.
void buildInnerEdges(const NBNode &n, int noInternalNoSplits, int &linkIndex, int &splitIndex)
PositionVector getCWBoundaryLine(const NBNode &n) const
get the outer boundary of this edge when going clock-wise around the given node
PositionVector getSubpart(double beginOffset, double endOffset) const
get subpart of a position vector
double getEndOffset() const
Returns the offset to the destination node.
PositionVector smoothedZFront(double dist=std::numeric_limits< double >::max()) const
returned vector that is smoothed at the front (within dist)
static const double INVALID_OFFSET
a value to signify offsets outside the range of [0, Line.length()]
std::vector< Connection > myConnections
List of connections to following edges.
PositionVector startShapeAt(const PositionVector &laneShape, const NBNode *startNode, PositionVector nodeShape) const
std::string getLaneIDInsecure(int lane) const
get Lane ID (Insecure)
void execute(const int lane, const int virtEdge)
executes a bresenham - step
PositionVector getSubpartByIndex(int beginIndex, int count) const
get subpart of a position vector using index and a cout
The connection was given by the user.
void reinit(NBNode *from, NBNode *to, const std::string &type, double speed, int nolanes, int priority, PositionVector geom, double width, double offset, const std::string &streetName, LaneSpreadFunction spread=LANESPREAD_RIGHT, bool tryIgnoreNodePositions=false)
Resets initial values.
The link is a partial right direction.
double speed
The speed allowed on this lane.
double getFloat(const std::string &name) const
Returns the double-value of the named option (only for Option_Float)
std::set< SVCPermissions > getPermissionVariants(int iStart, int iEnd) const
return all permission variants within the specified lane range [iStart, iEnd[
SVCPermissions getPermissions(int lane=-1) const
get the union of allowed classes over all lanes or for a specific lane
bool lanesWereAssigned() const
Check if lanes were assigned.
double getFinalLength() const
get length that will be assigned to the lanes in the final network
void move2side(double amount)
move position vector to side using certain ammount
vehicle is a passenger car (a "normal" car)
bool myAmInnerEdge
Information whether this is a junction-inner edge.
bool hasLaneSpecificPermissions() const
whether lanes differ in allowed vehicle classes
Base class for objects which have an id.
bool recheckLanes()
recheck whether all lanes within the edge are all right and optimises the connections once again ...
bool hasLaneParams() const
whether one of the lanes has parameters set
double mySpeed
The maximal speed.
static std::string convertUmlaute(std::string str)
Converts german "Umlaute" to their latin-version.
LinkDirection getDirection(const NBEdge *const incoming, const NBEdge *const outgoing, bool leftHand=false) const
Returns the representation of the described stream's direction.
const PositionVector & getShape() const
retrieve the junction shape
double getSpeed() const
Returns the speed allowed on this edge.
int getToLane() const
returns the to-lane
NBEdge * getTo() const
returns the to-edge (end of the connection)
int internalLaneIndex
The lane index of this internal lane within the internal edge.
const PositionVector & getGeometry() const
Returns the geometry of the edge.
void extendGeometryAtNode(const NBNode *node, double maxExtent)
linearly extend the geometry at the given node
PositionVector getSubpart2D(double beginOffset, double endOffset) const
get subpart of a position vector in two dimensions (Z is ignored)
Connection getConnection(int fromLane, const NBEdge *to, int toLane) const
Returns the specified connection This method goes through "myConnections" and returns the specified o...
double getLaneWidth() const
Returns the default width of lanes of this edge.
void setTurningDestination(NBEdge *e, bool onlyPossible=false)
Sets the turing destination at the given edge.
static const int BACKWARD
bool setConnection(int lane, NBEdge *destEdge, int destLane, Lane2LaneInfoType type, bool mayUseSameDestination=false, bool mayDefinitelyPass=false, bool keepClear=true, double contPos=UNSPECIFIED_CONTPOS, double visibility=UNSPECIFIED_VISIBILITY_DISTANCE, double speed=UNSPECIFIED_SPEED, const PositionVector &customShape=PositionVector::EMPTY)
Adds a connection to a certain lane of a certain edge.
std::string myID
The name of the object.
void extrapolate(const double val, const bool onlyFirst=false, const bool onlyLast=false)
extrapolate position vector
double width
This crossing's width.
double length() const
Returns the length.
bool addLane2LaneConnection(int fromLane, NBEdge *dest, int toLane, Lane2LaneInfoType type, bool mayUseSameDestination=false, bool mayDefinitelyPass=false, bool keepClear=true, double contPos=UNSPECIFIED_CONTPOS, double visibility=UNSPECIFIED_VISIBILITY_DISTANCE, double speed=UNSPECIFIED_SPEED, const PositionVector &customShape=PositionVector::EMPTY)
Adds a connection between the specified this edge's lane and an approached one.
void computeEdgeShape()
Recomputeds the lane shapes to terminate at the node shape For every lane the intersection with the f...
void addStraightConnections(const EdgeVector *outgoing, const std::vector< int > &availableLanes, const std::vector< int > *priorities)
add some straight connections
void disableConnection4TLS(int fromLane, NBEdge *toEdge, int toLane)
disable connections for TLS
PositionVector viaShape
shape of via
bool hasAccelLane() const
whether one of the lanes is an acceleration lane
const PositionVector & getLaneShape(int i) const
Returns the shape of the nth lane.
const EdgeVector & getIncomingEdges() const
Returns this node's incoming edges (The edges which yield in this node)
PositionVector myToBorder
double getCrossingAngle(NBNode *node)
return the angle for computing pedestrian crossings at the given node
const std::set< NBTrafficLightDefinition * > & getControllingTLS() const
Returns the traffic lights that were assigned to this node (The set of tls that control this node) ...
std::vector< NBEdge * > EdgeVector
container for (sorted) edges
bool forbids(const NBEdge *const possProhibitorFrom, const NBEdge *const possProhibitorTo, const NBEdge *const possProhibitedFrom, const NBEdge *const possProhibitedTo, bool regardNonSignalisedLowerPriority) const
Returns the information whether "prohibited" flow must let "prohibitor" flow pass.
double getTotalWidth() const
Returns the combined width of all lanes of this edge.
static const int UNSPECIFIED_INTERNAL_LANE_INDEX
internal lane computation not yet done
const std::map< std::string, std::string > & getMap() const
Returns the inner key/value map.
void setPreferredVehicleClass(SVCPermissions permissions, int lane=-1)
set preferred Vehicle Class
double mySignalOffset
the offset of a traffic light signal from the end of this edge (-1 for None)
The edge has been loaded and connections shall not be added.
bool hasCustomLaneShape() const
whether one of the lanes has a custom shape
std::vector< Connection > myConnectionsToDelete
List of connections marked for delayed removal.
double contPos
custom position for internal junction on this connection
bool uncontrolled
check if Connection is uncontrolled
void setJunctionPriority(const NBNode *const node, int prio)
Sets the junction priority of the edge.
SumoXMLNodeType getType() const
Returns the type of this node.
const std::string getParameter(const std::string &key, const std::string &defaultValue="") const
Returns the value for a given key.
double angleAt2D(int pos) const
get angle in certain position of position vector
void addBikeLane(double width)
add a bicycle lane of the given width and shift existing connctions
bool insert(const std::string &id, const Position &position, NBDistrict *district=0)
Inserts a node into the map.
const EdgeVector * getConnectedSorted()
Returns the list of outgoing edges without the turnaround sorted in clockwise direction.
void restoreRestrictedLane(SUMOVehicleClass vclass, std::vector< NBEdge::Lane > oldLanes, PositionVector oldGeometry, std::vector< NBEdge::Connection > oldConnections)
restore a restricted lane
void sortOutgoingConnectionsByIndex()
sorts the outgoing connections by their from-lane-index and their to-lane-index
bool needsCont(const NBEdge *fromE, const NBEdge *otherFromE, const NBEdge::Connection &c, const NBEdge::Connection &otherC) const
whether an internal junction should be built at from and respect other
const std::string SUMO_PARAM_ORIGID
std::string myType
The type of the edge.
LaneSpreadFunction
Numbers representing special SUMO-XML-attribute values Information how the edge's lateral offset shal...
void append(NBEdge *continuation)
append another edge
bool isTurningDirectionAt(const NBEdge *const edge) const
Returns whether the given edge is the opposite direction to this edge.
The connection was computed.
const Position & getPosition() const
EdgeVector edges
The edges being crossed.
int getFromLane() const
returns the from-lane
Represents a single node (junction) during network building.
MainDirections(const EdgeVector &outgoing, NBEdge *parent, NBNode *to, int indexOfStraightest)
constructor
void dismissVehicleClassInformation()
dimiss vehicle class information
Lanes to lanes - relationships are computed; no recheck is necessary/wished.
A definition of a pedestrian crossing.
void replaceInConnections(NBEdge *which, NBEdge *by, int laneOff)
replace in current connections of edge
EdgeVector getConnectedEdges() const
Returns the list of outgoing edges unsorted.
double distanceTo(const Position &p2) const
returns the euclidean distance in 3 dimension
void appendTurnaround(bool noTLSControlled, bool checkPermissions)
Add a connection to the previously computed turnaround, if wished.
static void compute(BresenhamCallBack *callBack, const int val1, const int val2)
Direction
enum of possible directions
void preferVehicleClass(int lane, SUMOVehicleClass vclass)
prefer certain vehicle class
void checkGeometry(const double maxAngle, const double minRadius, bool fix)
Check the angles of successive geometry segments.
void push_back_noDoublePos(const Position &p)
insert in back a non double position
bool isLeftMover(const NBEdge *const from, const NBEdge *const to) const
Computes whether the given connection is a left mover across the junction.
void allowVehicleClass(int lane, SUMOVehicleClass vclass)
set allowed class for the given lane or for all lanes if -1 is given
int getTLIndex() const
returns the index within the controlling tls or InvalidTLIndex if this link is unontrolled ...
void insertConnection(NBEdge::Connection connection)
insert a previously created NBEdge::connection
void addGeometryPoint(int index, const Position &p)
Adds a further geometry point.
void shiftToLanesToEdge(NBEdge *to, int laneOff)
modifify the toLane for all connections to the given edge
void computeAngle()
computes the angle of this edge and stores it in myAngle
NBNode * getFromNode() const
Returns the origin node of the edge.
Container for nodes during the netbuilding process.
bool computeEdge2Edges(bool noLeftMovers)
computes the edge (step1: computation of approached edges)
std::string getInternalLaneID() const
get ID of internal lane
PositionVector getCCWBoundaryLine(const NBNode &n) const
get the outer boundary of this edge when going counter-clock-wise around the given node ...
static T maxValue(const std::vector< T > &v)
static double angleDiff(const double angle1, const double angle2)
Returns the difference of the second angle to the first angle in radiants.
bool haveVia
check if Connection have a Via
double getLoadedLength() const
Returns the length was set explicitly or the computed length if it wasn't set.
void add(double xoff, double yoff, double zoff)
void setLaneSpreadFunction(LaneSpreadFunction spread)
(Re)sets how the lanes lateral offset shall be computed
double myLength
The length of the edge.
#define WRITE_MESSAGE(msg)
void divideSelectedLanesOnEdges(const EdgeVector *outgoing, const std::vector< int > &availableLanes, const std::vector< int > *priorities)
divide selected lanes on edges
PositionVector computeLaneShape(int lane, double offset) const
Computes the shape for the given lane.
double getShapeEndAngle() const
Returns the angle at the end of the edge.
double nearest_offset_to_point2D(const Position &p, bool perpendicular=true) const
return the nearest offest to point 2D
double myLoadedLength
An optional length to use (-1 if not valid)
void closePolygon()
ensures that the last position equals the first
Lanes to edges - relationships are computed/loaded.
std::string myStreetName
The street name (or whatever arbitrary string you wish to attach)
NBNode * myFrom
The source and the destination node.
bool canMoveConnection(const Connection &con, int newFromLane) const
whether the connection can originate on newFromLane
Connection & getConnectionRef(int fromLane, const NBEdge *to, int toLane)
Returns reference to the specified connection This method goes through "myConnections" and returns th...
bool isNearEnough2BeJoined2(NBEdge *e, double threshold) const
Check if edge is near enought to be joined to another edge.
NBNode * getToNode() const
Returns the destination node of the edge.
std::vector< int > foeInternalLinks
FOE Internal links.
~MainDirections()
destructor
static bool isTrafficLight(SumoXMLNodeType type)
return whether the given type is a traffic light
void shiftPositionAtNode(NBNode *node, NBEdge *opposite)
shift geometry at the given node to avoid overlap
bool intersects(const Position &p1, const Position &p2) const
Returns the information whether this list of points interesects the given line.
std::string joinToString(const std::vector< T > &v, const T_BETWEEN &between, std::streamsize accuracy=gPrecision)
void disallowVehicleClass(int lane, SUMOVehicleClass vclass)
set disallowed class for the given lane or for all lanes if -1 is given
void copyConnectionsFrom(NBEdge *src)
copy connections from antoher edge
A class that being a bresenham-callback assigns the incoming lanes to the edges.
void setLaneWidth(int lane, double width)
set lane specific width (negative lane implies set for all lanes)
void reshiftPosition(double xoff, double yoff)
Applies an offset to the edge.
const std::map< NBEdge *, std::vector< int > > & getBuiltConnections() const
get built connections
void setz(double z)
set position z
NBEdge::Lane getFirstNonPedestrianLane(int direction) const
get first non-pedestrian lane
bool splitGeometry(NBEdgeCont &ec, NBNodeCont &nc)
Splits this edge at geometry points.