57 #ifdef CHECK_MEMORY_LEAKS 59 #endif // CHECK_MEMORY_LEAKS 61 #define DEBUGID "disabled" 89 assert(myTransitions.size() > virtEdge);
91 NBEdge* succEdge = myTransitions[virtEdge];
92 std::vector<unsigned int> lanes;
96 std::map<NBEdge*, std::vector<unsigned int> >::iterator i =
myConnections.find(succEdge);
104 std::vector<unsigned int>::iterator j = find(lanes.begin(), lanes.end(), lane);
105 if (j == lanes.end()) {
107 lanes.push_back(lane);
120 if (outgoing.size() == 0) {
124 assert(outgoing.size() > 0);
129 if (outgoing.back()->getJunctionPriority(to) == 1) {
135 if (outgoing.back()->getPriority() > tmp[0]->getPriority()) {
138 if (outgoing.back()->getNumLanes() > tmp[0]->getNumLanes()) {
147 NBEdge* edge = *(tmp.begin());
160 return myDirs.empty();
166 return find(myDirs.begin(), myDirs.end(), d) != myDirs.end();
186 std::string type,
SUMOReal speed,
unsigned int nolanes,
188 const std::string& streetName,
204 init(nolanes,
false,
"");
209 std::string type,
SUMOReal speed,
unsigned int nolanes,
212 const std::string& streetName,
213 const std::string& origID,
229 init(nolanes, tryIgnoreNodePositions, origID);
258 if (to == tpl->
myTo) {
267 SUMOReal speed,
unsigned int nolanes,
int priority,
269 const std::string& streetName,
271 bool tryIgnoreNodePositions) {
293 const std::vector<Lane> oldLanes =
myLanes;
294 init(nolanes, tryIgnoreNodePositions, oldLanes.empty() ?
"" : oldLanes[0].origID);
295 for (
int i = 0; i < (int)nolanes; ++i) {
297 myLanes[i] = oldLanes[
MIN2(i, (
int)oldLanes.size() - 1)];
316 if (from == 0 || to == 0) {
317 throw ProcessError(
"At least one of edge's '" +
myID +
"' nodes is not known.");
334 NBEdge::init(
unsigned int noLanes,
bool tryIgnoreNodePositions,
const std::string& origID) {
339 throw ProcessError(
"At least one of edge's '" +
myID +
"' nodes is not known.");
345 if (!tryIgnoreNodePositions ||
myGeom.size() < 2) {
360 WRITE_ERROR(
"Edge's '" +
myID +
"' from- and to-node are at the same position.");
368 assert(
myGeom.size() >= 2);
370 for (
unsigned int i = 0; i < noLanes; i++) {
385 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
386 myLanes[i].shape.add(xoff, yoff, 0);
395 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
399 (*i).shape.mirrorX();
400 (*i).viaShape.mirrorX();
444 if (shape.size() >= 2) {
455 assert(shape.size() >= 2);
456 assert(shape.
length() > 0);
472 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
477 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
478 assert(
myLanes[i].shape.length() > 0);
479 avgLength +=
myLanes[i].shape.length();
495 assert(pbv.size() > 0);
503 ns[0].set(ns[0].x(), ns[0].y(), startNode->
getPosition().
z());
504 assert(ns.size() >= 2);
509 assert(pbv.size() > 0);
563 NBEdge* currentEdge =
this;
564 for (
int i = 1; i < (int)
myGeom.size() - 1; i++) {
566 if (i != (
int)
myGeom.size() - 2) {
567 std::string nodename =
myID +
"_in_between#" +
toString(i);
569 throw ProcessError(
"Error on adding in-between node '" + nodename +
"'.");
577 currentEdge->
myTo = newTo;
580 std::string edgename =
myID +
"[" +
toString(i - 1) +
"]";
584 if (!ec.
insert(currentEdge,
true)) {
585 throw ProcessError(
"Error on adding splitted edge '" + edgename +
"'.");
610 std::vector<SUMOReal> angles;
612 for (
int i = 0; i < (int)
myGeom.size() - 1; ++i) {
617 for (
int i = 0; i < (int)angles.size() - 1; ++i) {
620 if (maxAngle > 0 && relAngle > maxAngle) {
626 if (i == 0 || i == (
int)angles.size() - 2) {
627 const bool start = i == 0;
631 if (minRadius > 0 && r < minRadius) {
634 (start ?
"start" :
"end") +
" of edge '" +
getID() +
"'.");
640 (start ?
"start" :
"end") +
" of edge '" +
getID() +
"'.");
677 bool mayUseSameDestination,
678 bool mayDefinitelyPass,
693 setConnection(from, dest, toLane, type, mayUseSameDestination, mayDefinitelyPass, keepClear, contPos);
700 NBEdge* dest,
unsigned int toLane,
702 bool invalidatePrevious,
703 bool mayDefinitelyPass) {
704 if (invalidatePrevious) {
708 for (
unsigned int i = 0; i < no && ok; i++) {
718 bool mayUseSameDestination,
719 bool mayDefinitelyPass,
749 if ((*i).toEdge == destEdge && ((*i).fromLane == -1 || (*i).toLane == -1)) {
756 if (mayDefinitelyPass) {
778 std::vector<NBEdge::Connection>
780 std::vector<NBEdge::Connection> ret;
782 if ((*i).fromLane == static_cast<int>(lane)) {
794 (*i).fromLane == fromLane
796 && (*i).toLane == toLane) {
801 +
" to " + to->
getID() +
"_" +
toString(toLane) +
" not found");
832 if (find(outgoing.begin(), outgoing.end(), (*i).toEdge) == outgoing.end()) {
833 outgoing.push_back((*i).toEdge);
838 if (it->fromLane < 0 && it->toLane < 0) {
840 EdgeVector::iterator forbidden = find(outgoing.begin(), outgoing.end(), it->toEdge);
841 if (forbidden != outgoing.end()) {
842 outgoing.erase(forbidden);
847 unsigned int size = (
unsigned int) outgoing.size();
849 edges->reserve(size);
850 for (EdgeVector::const_iterator i = outgoing.begin(); i != outgoing.end(); i++) {
853 edges->push_back(outedge);
865 if (find(ret.begin(), ret.end(), (*i).toEdge) == ret.end()) {
866 ret.push_back((*i).toEdge);
875 std::vector<int> ret;
878 if ((*i).toEdge == currentOutgoing) {
879 ret.push_back((*i).fromLane);
902 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
907 for (EdgeVector::iterator j = connected.begin(); j != connected.end(); j++) {
921 && (fromLane < 0 || c.
fromLane == fromLane)
922 && (toLane < 0 || c.
toLane == toLane)) {
946 if (reallowSetting) {
958 if ((*i).toEdge == which) {
960 (*i).toLane += laneOff;
971 std::map<int, int> laneMap;
975 bool wasConnected =
false;
977 if ((*i).toEdge != which) {
981 if ((*i).fromLane != -1) {
982 int fromLane = (*i).fromLane;
983 laneMap[(*i).toLane] = fromLane;
984 if (minLane == -1 || minLane > fromLane) {
987 if (maxLane == -1 || maxLane < fromLane) {
998 std::vector<NBEdge::Connection> conns = origConns;
999 for (std::vector<NBEdge::Connection>::iterator i = conns.begin(); i != conns.end(); ++i) {
1000 if ((*i).toEdge == which) {
1003 int fromLane = (*i).fromLane;
1005 if (laneMap.find(fromLane) == laneMap.end()) {
1006 if (fromLane >= 0 && fromLane <= minLane) {
1009 if (fromLane >= 0 && fromLane >= maxLane) {
1013 toUse = laneMap[fromLane];
1041 unsigned int index = 0;
1047 std::vector<Connection>::iterator i =
myConnections.begin() + index;
1070 std::string innerID =
":" + n.
getID();
1072 unsigned int edgeIndex = linkIndex;
1073 unsigned int internalLaneIndex = 0;
1080 if (con.
toEdge != toEdge) {
1083 edgeIndex = linkIndex;
1084 toEdge = (*i).toEdge;
1085 internalLaneIndex = 0;
1088 std::vector<unsigned int> foeInternalLinks;
1098 std::pair<SUMOReal, std::vector<unsigned int> > crossingPositions(-1, std::vector<unsigned int>());
1099 std::set<std::string> tmpFoeIncomingLanes;
1106 unsigned int index = 0;
1108 for (EdgeVector::const_iterator i2 = incoming.begin(); i2 != incoming.end(); ++i2) {
1109 const std::vector<Connection>& elv = (*i2)->getConnections();
1110 for (std::vector<NBEdge::Connection>::const_iterator k2 = elv.begin(); k2 != elv.end(); k2++) {
1111 if ((*k2).toEdge == 0) {
1114 bool needsCont = n.
needsCont(
this, *i2, con, *k2);
1117 crossingPositions.second.push_back(index);
1121 SUMOReal width2 = (*k2).toEdge->getLaneWidth((*k2).toLane);
1122 if ((*k2).toEdge->getPermissions((*k2).toLane) !=
SVC_BICYCLE) {
1128 if (crossingPositions.first < 0 || crossingPositions.first > minDV) {
1129 crossingPositions.first = minDV;
1134 this, con.
toEdge, con.
fromLane, (*i2), (*k2).toEdge, (*k2).fromLane);
1136 if (n.
foes(
this, con.
toEdge, *i2, (*k2).toEdge) || rightTurnConflict) {
1137 foeInternalLinks.push_back(index);
1141 if ((n.
forbids(*i2, (*k2).toEdge,
this, con.
toEdge, signalised) || rightTurnConflict) && (needsCont || dir ==
LINKDIR_TURN)) {
1142 tmpFoeIncomingLanes.insert((*i2)->getID() +
"_" +
toString((*k2).fromLane));
1148 const std::vector<NBNode::Crossing>& crossings = n.
getCrossings();
1149 for (std::vector<NBNode::Crossing>::const_iterator it_c = crossings.begin(); it_c != crossings.end(); ++it_c) {
1151 for (EdgeVector::const_iterator it_e = crossing.
edges.begin(); it_e != crossing.
edges.end(); ++it_e) {
1152 const NBEdge* edge = *it_e;
1154 if (
this == edge || con.
toEdge == edge) {
1155 foeInternalLinks.push_back(index);
1156 if (con.
toEdge == edge &&
1164 if (crossingPositions.first < 0 || crossingPositions.first > minDV) {
1165 crossingPositions.first = minDV;
1188 crossingPositions.first = -1;
1191 crossingPositions.first = con.
contPos;
1209 assert(shape.size() >= 2);
1211 if (crossingPositions.first >= 0) {
1212 std::pair<PositionVector, PositionVector> split = shape.
splitAt(crossingPositions.first);
1213 con.
id = innerID +
"_" +
toString(edgeIndex);
1214 con.
shape = split.first;
1217 con.
viaID = innerID +
"_" +
toString(splitIndex + noInternalNoSplits);
1223 con.
id = innerID +
"_" +
toString(edgeIndex);
1228 ++internalLaneIndex;
1248 if (tmp.size() > 0) {
1249 intersect =
MIN2(intersect, tmp[0]);
1252 if (tmp.size() > 0) {
1253 intersect =
MIN2(intersect, tmp[0]);
1286 assert(atNode ==
myTo);
1301 assert(atNode ==
myTo);
1309 if (!onlyPossible) {
1329 std::vector<SUMOReal> offsets;
1330 for (
unsigned int i = 0; i <
myLanes.size(); ++i) {
1331 offsets.push_back(0);
1334 for (
int i = (
int)
myLanes.size() - 2; i >= 0; --i) {
1336 offsets[i] = offset;
1343 for (
unsigned int i = 0; i <
myLanes.size(); ++i) {
1349 for (
unsigned int i = 0; i <
myLanes.size(); ++i) {
1350 offsets[i] += offset;
1354 for (
unsigned int i = 0; i <
myLanes.size(); ++i) {
1358 WRITE_WARNING(
"In edge '" +
getID() +
"': lane shape could not be determined (" + e.what() +
").");
1413 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1414 if ((*i).permissions !=
SVCAll) {
1424 std::vector<Lane>::const_iterator i =
myLanes.begin();
1427 for (; i !=
myLanes.end(); ++i) {
1428 if (i->permissions != firstLanePermissions) {
1438 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1439 if (i->width !=
myLanes.begin()->width) {
1449 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1460 for (std::vector<Lane>::const_iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
1461 if (i->endOffset !=
myLanes.begin()->endOffset) {
1485 for (EdgeVector::const_iterator i = o.begin(); i != o.end(); ++i) {
1523 std::vector<unsigned int> connNumbersPerLane(
myLanes.size(), 0);
1525 if ((*i).toEdge == 0 || (*i).fromLane < 0 || (*i).toLane < 0) {
1528 if ((*i).fromLane >= 0) {
1529 ++connNumbersPerLane[(*i).fromLane];
1540 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
1542 if (i > 0 && connNumbersPerLane[i - 1] > 1) {
1544 }
else if (i <
myLanes.size() - 1 && connNumbersPerLane[i + 1] > 1) {
1556 }
else if (common == 0) {
1559 const int origToLane = c.
toLane;
1561 int toLane = origToLane;
1574 int toLane = origToLane;
1605 if (outgoing->size() == 0) {
1618 std::vector<int> availableLanes;
1619 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
1624 availableLanes.push_back(i);
1626 if (availableLanes.size() > 0) {
1630 availableLanes.clear();
1631 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
1636 availableLanes.push_back(i);
1638 if (availableLanes.size() > 0) {
1642 availableLanes.clear();
1643 for (
int i = 0; i < (int)
myLanes.size(); ++i) {
1648 availableLanes.push_back(i);
1650 if (availableLanes.size() > 0) {
1655 if ((*i).fromLane == -1) {
1674 const int numOutgoing = (int) outgoing->size();
1675 std::vector<SUMOReal> resultingLanes;
1676 resultingLanes.reserve(numOutgoing);
1679 for (
int i = 0; i < numOutgoing; i++) {
1686 if (res > availableLanes.size()) {
1687 res = (
SUMOReal) availableLanes.size();
1690 resultingLanes.push_back(res);
1691 sumResulting += res;
1692 if (minResulting > res && res > 0) {
1701 const int numVirtual = (int)(sumResulting / minResulting + 0.5);
1704 transition.reserve(numOutgoing);
1705 for (
int i = 0; i < numOutgoing; i++) {
1708 assert(i < (
int)resultingLanes.size());
1709 const SUMOReal tmpNum = resultingLanes[i] / minResulting;
1710 for (
SUMOReal j = 0; j < tmpNum; j++) {
1711 transition.push_back((*outgoing)[i]);
1717 Bresenham::compute(&adder, static_cast<unsigned int>(availableLanes.size()), numVirtual);
1718 const std::map<NBEdge*, std::vector<unsigned int> >& l2eConns = adder.
getBuiltConnections();
1719 for (std::map<
NBEdge*, std::vector<unsigned int> >::const_iterator i = l2eConns.begin(); i != l2eConns.end(); ++i) {
1720 NBEdge* target = (*i).first;
1721 const std::vector<unsigned int> lanes = (*i).second;
1722 for (std::vector<unsigned int>::const_iterator j = lanes.begin(); j != lanes.end(); ++j) {
1723 const int fromIndex = availableLanes[*j];
1742 if (numConsToTarget >= targetLanes) {
1747 for (
unsigned int ii = 0; ii <
myLanes.size(); ++ii) {
1762 std::vector<unsigned int>*
1765 std::vector<unsigned int>* priorities =
new std::vector<unsigned int>();
1766 if (outgoing->size() == 0) {
1769 priorities->reserve(outgoing->size());
1770 EdgeVector::const_iterator i;
1771 for (i = outgoing->begin(); i != outgoing->end(); i++) {
1772 int prio = (*i)->getJunctionPriority(
myTo);
1773 assert((prio + 1) * 2 > 0);
1774 prio = (prio + 1) * 2;
1775 priorities->push_back(prio);
1783 i = find(outgoing->begin(), outgoing->end(), *(tmp.begin()));
1784 unsigned int dist = (
unsigned int) distance(outgoing->begin(), i);
1786 assert(priorities->size() > 0);
1787 (*priorities)[0] /= 2;
1792 if (mainDirections.
empty()) {
1793 assert(dist < priorities->size());
1794 (*priorities)[dist] *= 2;
1798 (*priorities)[dist] *= 2;
1800 (*priorities)[dist] *= 3;
1810 unsigned int sum = 0;
1811 for (std::vector<unsigned int>::const_iterator i = priorities.begin(); i != priorities.end(); i++) {
1849 if (pos < tolerance) {
1863 for (
unsigned int i = 0; i < lanes; i++) {
1865 for (std::vector<NBEdge::Connection>::iterator j = elv.begin(); j != elv.end(); j++) {
1867 assert(el.
tlID ==
"");
1915 assert(fromLane < 0 || fromLane < (
int)
myLanes.size());
1917 if (fromLane >= 0 && toLane >= 0) {
1919 std::vector<Connection>::iterator i =
1927 connection.
tlID = tlID;
1934 unsigned int no = 0;
1935 bool hadError =
false;
1937 if ((*i).toEdge != toEdge) {
1940 if (fromLane >= 0 && fromLane != (*i).fromLane) {
1943 if (toLane >= 0 && toLane != (*i).toLane) {
1946 if ((*i).tlID ==
"") {
1948 (*i).tlLinkNo = tlIndex;
1951 if ((*i).tlID != tlID && static_cast<int>((*i).tlLinkNo) == tlIndex) {
1952 WRITE_WARNING(
"The lane '" + toString<int>((*i).fromLane) +
"' on edge '" +
getID() +
"' already had a traffic light signal.");
1957 if (hadError && no == 0) {
1958 WRITE_WARNING(
"Could not set any signal of the tlLogic '" + tlID +
"' (unknown group)");
1992 ret =
myLanes.back().shape.reverse();
2010 ret =
myLanes[0].shape.reverse();
2060 if (find(conn.begin(), conn.end(), possContinuation)
2077 if (conns.size() !=
myLanes.size()) {
2093 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2117 if ((*i).toEdge == e && (*i).tlID !=
"") {
2149 assert(distances.size() > 0);
2156 assert(index <=
myLanes.size());
2160 int templateIndex = index > 0 ? index - 1 : index + 1;
2171 for (EdgeVector::const_iterator i = incs.begin(); i != incs.end(); ++i) {
2172 (*i)->invalidateConnections(
true);
2180 unsigned int newLaneNo = (
unsigned int)
myLanes.size() + by;
2181 while (
myLanes.size() < newLaneNo) {
2183 const bool recompute =
myLanes.size() == newLaneNo - 1;
2191 assert(index <
myLanes.size());
2196 for (EdgeVector::const_iterator i = incs.begin(); i != incs.end(); ++i) {
2197 (*i)->invalidateConnections(
true);
2206 unsigned int newLaneNo = (
unsigned int)
myLanes.size() - by;
2207 assert(newLaneNo > 0);
2208 while (
myLanes.size() > newLaneNo) {
2210 const bool recompute =
myLanes.size() == newLaneNo + 1;
2226 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2230 assert(lane < (
int)
myLanes.size());
2231 myLanes[lane].permissions |= vclass;
2239 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2243 assert(lane < (
int)
myLanes.size());
2244 myLanes[lane].permissions &= ~vclass;
2252 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2256 assert(lane < (
int)
myLanes.size());
2257 myLanes[lane].preferred |= vclass;
2267 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2273 assert(lane < (
int)
myLanes.size());
2289 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2306 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2312 assert(lane < (
int)
myLanes.size());
2313 myLanes[lane].endOffset = offset;
2322 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2328 assert(lane < (
int)
myLanes.size());
2336 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2341 assert(lane < (
int)
myLanes.size());
2342 myLanes[lane].permissions = permissions;
2350 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2355 assert(lane < (
int)
myLanes.size());
2356 myLanes[lane].preferred = permissions;
2365 for (
unsigned int i = 0; i <
myLanes.size(); i++) {
2370 assert(lane < (
int)
myLanes.size());
2371 return myLanes[lane].permissions;
2384 for (std::vector<Lane>::iterator i =
myLanes.begin(); i !=
myLanes.end(); ++i) {
2385 (*i).permissions =
SVCAll;
2408 for (
int i = start; i != end; i += direction) {
2430 std::cout <<
getID() <<
" angle=" <<
getAngleAtNode(node) <<
" convAngle=" << angle <<
"\n";
2460 if (
myLanes[0].permissions == vclass) {
2472 myLanes[0].permissions = vclass;
2483 for (EdgeVector::const_iterator it = incoming.begin(); it != incoming.end(); ++it) {
2484 (*it)->shiftToLanesToEdge(
this, 1);
2496 if ((*it).toEdge == to && (*it).toLane >= 0) {
2497 (*it).toLane += laneOff;
2506 const int i = (node ==
myTo ? -1 : 0);
2507 const int i2 = (node ==
myTo ? 0 : -1);
2513 if (dist < neededOffset && dist2 < neededOffset2) {
NBEdge::Lane getFirstNonPedestrianLane(int direction) const
bool gDebugFlag1
global utility flags for debugging
void invalidateConnections(bool reallowSetting=false)
The link is a partial left direction.
const PositionVector & getLaneShape(unsigned int i) const
Returns the shape of the nth lane.
std::vector< Lane > myLanes
Lane information.
bool includes(Direction d) const
PositionVector cutAtIntersection(const PositionVector &old) const
cut shape at the intersection shapes
bool hasConnectionTo(NBEdge *destEdge, unsigned int destLane, int fromLane=-1) const
Retrieves info about a connection to a certain lane of a certain edge.
const EdgeVector & getIncomingEdges() const
Returns this node's incoming edges.
const std::string & getTypeID() const
bool setControllingTLInformation(const NBConnection &c, const std::string &tlID)
Returns if the link could be set as to be controlled.
void divideOnEdges(const EdgeVector *outgoing)
A structure which describes a connection between edges or lanes.
int toLane
The lane the connections yields in.
static const SUMOReal UNSPECIFIED_WIDTH
unspecified lane width
SUMOReal width
This lane's width.
SUMOReal distance(const Position &p, bool perpendicular=false) const
std::string foeIncomingLanes
const SUMOReal SUMO_const_laneWidth
SUMOReal myEndOffset
This edges's offset to the intersection begin (will be applied to all lanes)
std::vector< TLSDisabledConnection > myTLSDisabledConnections
static const SUMOReal UNSPECIFIED_SIGNAL_OFFSET
unspecified signal offset
LaneSpreadFunction myLaneSpreadFunction
The information about how to spread the lanes.
PositionVector getSubpart2D(SUMOReal beginOffset, SUMOReal endOffset) const
void sortOutgoingConnectionsByAngle()
sorts the outgoing connections by their angle relative to their junction
NBEdge * toEdge
The edge the connections yields in.
bool hasDefaultGeometry() const
Returns whether the geometry consists only of the node positions.
void shiftTLConnectionLaneIndex(NBEdge *edge, int offset)
patches loaded signal plans by modifying lane indices
void mirrorX()
mirror coordinates along the x-axis
SUMOVehicleClass
Definition of vehicle classes to differ between different lane usage and authority types...
The relationships between edges are computed/loaded.
void appendTurnaround(bool noTLSControlled)
Add a connection to the previously computed turnaround, if wished.
bool hasLaneSpecificEndOffset() const
whether lanes differ in offset
void setLaneWidth(int lane, SUMOReal width)
set lane specific width (negative lane implies set for all lanes)
bool isTLControlled() const
Returns whether this node is controlled by any tls.
void setSpeed(int lane, SUMOReal speed)
set lane specific speed (negative lane implies set for all lanes)
Some static methods for string processing.
void moveOutgoingConnectionsFrom(NBEdge *e, unsigned int laneOff)
const SUMOReal SUMO_const_laneWidthAndOffset
void addSidewalk(SUMOReal width)
add a pedestrian sidewalk of the given width and shift existing connctions
void removeEdge(NBEdge *edge, bool removeFromConnections=true)
Removes edge from this node and optionally removes connections as well.
void addIncomingEdge(NBEdge *edge)
adds an incoming edge
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
Lane2LaneInfoType
Modes of setting connections between lanes.
bool mayBeTLSControlled(int fromLane, NBEdge *toEdge, int toLane) const
bool hasDefaultGeometryEndpoints() const
Returns whether the geometry is terminated by the node positions This default may be violated by init...
The link is a 180 degree turn.
Position getCentroid() const
Returns the centroid (closes the polygon if unclosed)
int getFromLane() const
returns the from-lane
void incLaneNo(unsigned int by)
PositionVector getCCWBoundaryLine(const NBNode &n) const
get the outer boundary of this edge when going counter-clock-wise around the given node ...
bool intersects(const Position &p1, const Position &p2) const
bool addLane2LaneConnection(unsigned int fromLane, NBEdge *dest, unsigned int toLane, Lane2LaneInfoType type, bool mayUseSameDestination=false, bool mayDefinitelyPass=false, bool keepClear=true, SUMOReal contPos=UNSPECIFIED_CONTPOS)
Adds a connection between the specified this edge's lane and an approached one.
const std::vector< Crossing > & getCrossings() const
return this junctions pedestrian crossings
bool addLane2LaneConnections(unsigned int fromLane, NBEdge *dest, unsigned int toLane, unsigned int no, Lane2LaneInfoType type, bool invalidatePrevious=false, bool mayDefinitelyPass=false)
Builds no connections starting at the given lanes.
static const SUMOReal UNSPECIFIED_SPEED
unspecified lane speed
void buildInnerEdges(const NBNode &n, unsigned int noInternalNoSplits, unsigned int &linkIndex, unsigned int &splitIndex)
void markAsInLane2LaneState()
SUMOReal getTotalWidth() const
Returns the combined width of all lanes of this edge.
Lanes to lanes - relationships are computed; should be recheked.
SUMOReal getLaneWidth() const
Returns the default width of lanes of this edge.
std::string getLaneIDInsecure(unsigned int lane) 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 lane's shape.
int myFromJunctionPriority
The priority normalised for the node the edge is outgoing of.
PositionVector getSubpartByIndex(int beginIndex, int count) const
PositionVector myGeom
The geometry for the edge.
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.
SUMOReal distanceTo(const Position &p2) const
returns the euclidean distance in 3 dimension
static const SUMOReal UNSPECIFIED_CONTPOS
unspecified internal junction position
const SUMOReal SUMO_const_laneOffset
bool around(const Position &p, SUMOReal offset=0) const
Returns the information whether the position vector describes a polygon lying around the given point ...
bool isRailway(SVCPermissions permissions)
Returns whether an edge with the given permission is a railway edge.
const SVCPermissions SVCAll
static const SUMOReal UNSPECIFIED_OFFSET
unspecified lane offset
SUMOReal beginEndAngle() const
returns the angle in radians of the line connecting the first and the last position ...
static SUMOReal angleDiff(const SUMOReal angle1, const SUMOReal angle2)
Returns the difference of the second angle to the first angle in radiants.
std::vector< Connection > getConnectionsFromLane(unsigned int lane) const
Returns connections from a given lane.
SUMOReal x() const
Returns the x-position.
void addOutgoingEdge(NBEdge *edge)
adds an outgoing edge
Position positionAtOffset2D(SUMOReal pos, SUMOReal lateralOffset=0) const
Returns the position at the given length.
void setGeometry(const PositionVector &g, bool inner=false)
(Re)sets the edge's geometry
#define UNUSED_PARAMETER(x)
static SUMOReal firstIntersection(const PositionVector &v1, const PositionVector &v2, SUMOReal width2)
The link is a (hard) left direction.
#define WRITE_WARNING(msg)
The connection was computed and validated.
static OptionsCont & getOptions()
Retrieves the options.
PositionVector startShapeAt(const PositionVector &laneShape, const NBNode *startNode) const
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...
PositionVector reverse() const
The edge has been loaded, nothing is computed yet.
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.
EdgeVector getConnectedEdges() const
Returns the list of outgoing edges unsorted.
The link is a straight direction.
const EdgeVector & getOutgoingEdges() const
Returns this node's outgoing edges.
void moveConnectionToRight(unsigned int lane)
bool hasPermissions() const
whether at least one lane has restrictions
An (internal) definition of a single lane of an edge.
const std::string & getID() const
Returns the id.
SUMOReal length2D() const
Returns the length.
SUMOReal mySpeed
The maximal speed.
std::vector< SUMOReal > distances(const PositionVector &s, bool perpendicular=false) const
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
bool addEdge2EdgeConnection(NBEdge *dest)
Adds a connection to another edge.
bool myAmMacroscopicConnector
Information whether this edge is a (macroscopic) connector.
bool isConnectedTo(NBEdge *e)
Returns the information whethe a connection to the given edge has been added (or computed) ...
const PositionVector getInnerGeometry() const
Returns the geometry of the edge without the endpoints.
void push_front_noDoublePos(const Position &p)
void reshiftPosition(SUMOReal xoff, SUMOReal yoff)
Applies an offset to the edge.
const Position & getPosition() const
Returns the position of this node.
void divideSelectedLanesOnEdges(const EdgeVector *outgoing, const std::vector< int > &availableLanes, const std::vector< unsigned int > *priorities)
static unsigned int computePrioritySum(const std::vector< unsigned int > &priorities)
bool computeLanes2Edges()
computes the edge, step2: computation of which lanes approach the edges)
NBEdge * myTurnDestination
The turn destination edge (if a connection exists)
const std::map< NBEdge *, std::vector< unsigned int > > & getBuiltConnections() const
Lanes to lanes - relationships are loaded; no recheck is necessary/wished.
Connection getConnection(int fromLane, const NBEdge *to, int toLane) const
Returns the specified connection This method goes through "myConnections" and returns the specified o...
int operator()(const Connection &c1, const Connection &c2) const
comparing operation
bool hasLaneSpecificSpeed() const
whether lanes differ in speed
int getPriority() const
Returns the priority of the edge.
bool insert(NBEdge *edge, bool ignorePrunning=false)
Adds an edge to the dictionary.
void checkGeometry(const SUMOReal maxAngle, const SUMOReal minRadius, bool fix)
Check the angles of successive geometry segments.
std::string getLaneID(unsigned int lane) const
void moveConnectionToLeft(unsigned int lane)
static SUMOReal legacyDegree(const SUMOReal angle, const bool positive=false)
static const int FORWARD
edge directions (for pedestrian related stuff)
void mirrorX()
mirror coordinates along the x-axis
std::string tlID
The id of the traffic light that controls this connection.
std::string getInternalLaneID() const
int fromLane
The lane the connections starts at.
A point in 2D or 3D with translation and scaling methods.
void add(SUMOReal xoff, SUMOReal yoff, SUMOReal zoff)
bool hasLaneSpecificPermissions() const
whether lanes differ in allowed vehicle classes
bool lanesWereAssigned() const
static bool connections_sorter(const Connection &c1, const Connection &c2)
std::vector< unsigned int > foeInternalLinks
unsigned int getNumLanes() const
Returns the number of lanes.
SUMOReal z() const
Returns the z-position.
NBEdge * myPossibleTurnDestination
The edge that would be the turn destination if there was one.
PositionVector getCWBoundaryLine(const NBNode &n) const
get the outer boundary of this edge when going clock-wise around the given node
bool canMoveConnection(const Connection &con, unsigned int newFromLane) const
whether the connection can originate on newFromLane
bool isTurningDirectionAt(const NBEdge *const edge) const
Returns whether the given edge is the opposite direction to this edge.
SUMOReal contPos
custom position for internal junction on this connection
SUMOReal myLaneWidth
This width of this edge's lanes.
int myPriority
The priority of the edge.
int getFirstNonPedestrianLaneIndex(int direction, bool exclusive=false) const
return the first lane with permissions other than SVC_PEDESTRIAN and 0
Storage for edges, including some functionality operating on multiple edges.
bool needsLaneSpecificOutput() const
whether at least one lane has values differing from the edges values
The link is a (hard) right direction.
EdgeBuildingStep myStep
The building step.
SUMOReal getAngleAtNodeToCenter(const NBNode *const node) const
Returns the angle of from the node shape center to where the edge meets the node shape.
LinkDirection getDirection(const NBEdge *const incoming, const NBEdge *const outgoing, bool leftHand=false) const
Returns the representation of the described stream's direction.
std::vector< Connection > myConnections
List of connections to following edges.
void setLoadedLength(SUMOReal val)
std::string toString(const T &t, std::streamsize accuracy=OUTPUT_ACCURACY)
The connection was given by the user.
const PositionVector & getShape() const
retrieve the junction shape
SUMOReal getSignalOffset() const
Returns the offset of a traffic signal from the end of this edge.
void removeFromConnections(NBEdge *toEdge, int fromLane=-1, int toLane=-1, bool tryLater=false)
Removes the specified connection(s)
The link is a partial right direction.
static void compute(BresenhamCallBack *callBack, const unsigned int val1, const unsigned int val2)
SUMOReal getEndOffset() const
Returns the offset to the destination node.
bool myAmInnerEdge
Information whether this is a junction-inner edge.
bool isLeftMover(const NBEdge *const from, const NBEdge *const to) const
Computes whether the given connection is a left mover across the junction.
Base class for objects which have an id.
int getJunctionPriority(const NBNode *const node) const
Returns the junction priority (normalised for the node currently build)
SUMOReal myLoadedLength
An optional length to use (-1 if not valid)
std::pair< PositionVector, PositionVector > splitAt(SUMOReal where) const
Returns the two lists made when this list vector is splitted at the given point.
static std::string convertUmlaute(std::string str)
Converts german "Umlaute" to their latin-version.
SVCPermissions getPermissions(int lane=-1) const
get the union of allowed classes over all lanes or for a specific lane
SUMOReal getCrossingAngle(NBNode *node)
return the angle for computing pedestrian crossings at the given node
SUMOReal length() const
Returns the length.
void addRestrictedLane(SUMOReal width, SUMOVehicleClass vclass)
add a lane of the given width, restricted to the given class and shift existing connctions ...
void setTurningDestination(NBEdge *e, bool onlyPossible=false)
Sets the turing destination at the given edge.
static const int BACKWARD
void addBikeLane(SUMOReal width)
add a bicycle lane of the given width and shift existing connctions
void decLaneNo(unsigned int by)
std::string myID
The name of the object.
PositionVector computeInternalLaneShape(NBEdge *fromE, const NBEdge::Connection &con, int numPoints) const
Compute the shape for an internal lane.
std::vector< int > getConnectionLanes(NBEdge *currentOutgoing) const
Returns the list of lanes that may be used to reach the given edge.
void removeDoublePoints(SUMOReal minDist=POSITION_EPS, bool assertLength=false)
Removes positions if too near.
void execute(const unsigned int lane, const unsigned int virtEdge)
executes a bresenham - step
void computeEdgeShape()
Recomputeds the lane shapes to terminate at the node shape For every lane the intersection with the f...
void disableConnection4TLS(int fromLane, NBEdge *toEdge, int toLane)
SUMOReal angleAt2D(int pos) const
SUMOReal getMaxLaneOffset()
static const SUMOReal UNSPECIFIED_LOADED_LENGTH
no length override given
void deleteLane(unsigned int index, bool recompute=true)
std::vector< NBEdge * > EdgeVector
std::vector< unsigned int > * prepareEdgePriorities(const EdgeVector *outgoing)
SUMOReal myLength
The length of the edge.
void setPreferredVehicleClass(SVCPermissions permissions, int lane=-1)
const PositionVector & getGeometry() const
Returns the geometry of the edge.
The edge has been loaded and connections shall not be added.
int getToLane() const
returns the to-lane
SUMOReal y() const
Returns the y-position.
std::vector< Connection > myConnectionsToDelete
List of connections marked for delayed removal.
PositionVector computeLaneShape(unsigned int lane, SUMOReal offset) const
Computes the shape for the given lane.
void reduceGeometry(const SUMOReal minDist)
Removes points with a distance lesser than the given.
void setJunctionPriority(const NBNode *const node, int prio)
Sets the junction priority of the edge.
bool insert(const std::string &id, const Position &position, NBDistrict *district=0)
Inserts a node into the map.
void replaceInConnections(NBEdge *which, NBEdge *by, unsigned int laneOff)
const EdgeVector * getConnectedSorted()
Returns the list of outgoing edges without the turnaround sorted in clockwise direction.
void sortOutgoingConnectionsByIndex()
sorts the outgoing connections by their from-lane-index and their to-lane-index
SUMOReal mySignalOffset
the offset of a traffic light signal from the end of this edge (-1 for None)
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)
unsigned int tlLinkNo
The index of this connection within the controlling traffic light.
NBEdge * getTo() const
returns the to-edge (end of the connection)
SUMOReal getLaneSpeed(unsigned int lane) const
void shiftToLanesToEdge(NBEdge *to, unsigned int laneOff)
modifify the toLane for all connections to the given edge
NBNode * tryGetNodeAtPosition(SUMOReal pos, SUMOReal tolerance=5.0) const
Returns the node at the given edges length (using an epsilon) When no node is existing at the given p...
The connection was computed.
LaneSpreadFunction getLaneSpreadFunction() const
Returns how this edge's lanes' lateral offset is computed.
SUMOReal myStartAngle
The angles of the edge.
EdgeVector edges
The edges being crossed.
Represents a single node (junction) during network building.
void dismissVehicleClassInformation()
bool hasSignalisedConnectionTo(const NBEdge *const e) const
Lanes to lanes - relationships are computed; no recheck is necessary/wished.
std::string joinToString(const std::vector< T > &v, const T_BETWEEN &between, std::streamsize accuracy=OUTPUT_ACCURACY)
A definition of a pedestrian crossing.
void move2side(SUMOReal amount)
bool hasLaneSpecificWidth() const
whether lanes differ in width
void setEndOffset(int lane, SUMOReal offset)
set lane specific end-offset (negative lane implies set for all lanes)
Direction
enum of possible directions
bool isNearEnough2BeJoined2(NBEdge *e, SUMOReal threshold) const
void preferVehicleClass(int lane, SUMOVehicleClass vclass)
void push_back_noDoublePos(const Position &p)
void allowVehicleClass(int lane, SUMOVehicleClass vclass)
set allowed class for the given lane or for all lanes if -1 is given
void addGeometryPoint(int index, const Position &p)
Adds a further geometry point.
void computeAngle()
computes the angle of this edge and stores it in myAngle
NBNode * retrieve(const std::string &id) const
Returns the node with the given name.
SUMOReal getSpeed() const
Returns the speed allowed on this edge.
Container for nodes during the netbuilding process.
bool computeEdge2Edges(bool noLeftMovers)
computes the edge (step1: computation of approached edges)
static T maxValue(const std::vector< T > &v)
unsigned int internalLaneIndex
The lane index of this internal lane within the internal edge.
int getInt(const std::string &name) const
Returns the int-value of the named option (only for Option_Integer)
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.
void setLaneSpreadFunction(LaneSpreadFunction spread)
(Re)sets how the lanes lateral offset shall be computed
NBEdge(const std::string &id, NBNode *from, NBNode *to, std::string type, SUMOReal speed, unsigned int nolanes, int priority, SUMOReal width, SUMOReal offset, const std::string &streetName="", LaneSpreadFunction spread=LANESPREAD_RIGHT)
Constructor.
#define WRITE_MESSAGE(msg)
std::vector< SUMOReal > intersectsAtLengths2D(const PositionVector &other) const
For all intersections between this vector and other, return the 2D-length of the subvector from this ...
Lanes to edges - relationships are computed/loaded.
std::string myStreetName
The street name (or whatever arbitrary string you wish to attach)
const std::string & getStreetName() const
Returns the street name of this edge.
void setConnection(unsigned int lane, NBEdge *destEdge, unsigned int destLane, Lane2LaneInfoType type, bool mayUseSameDestination=false, bool mayDefinitelyPass=false, bool keepClear=true, SUMOReal contPos=UNSPECIFIED_CONTPOS)
Adds a connection to a certain lane of a certain edge.
void addLane(unsigned int index, bool recompute=true)
NBNode * myFrom
The source and the destination node.
bool expandableBy(NBEdge *possContinuation) const
NBEdge * getTurnDestination(bool possibleDestination=false) const
void init(unsigned int noLanes, bool tryIgnoreNodePositions, const std::string &origID)
Initialization routines common to all constructors.
PositionVector getSubpart(SUMOReal beginOffset, SUMOReal endOffset) const
~MainDirections()
destructor
void shiftPositionAtNode(NBNode *node, NBEdge *opposite)
shift geometry at the given node to avoid overlap
void disallowVehicleClass(int lane, SUMOVehicleClass vclass)
set disallowed class for the given lane or for all lanes if -1 is given
SUMOReal angleTo2D(const Position &other) const
returns the angle in the plane of the vector pointing from here to the other position ...
void append(const PositionVector &v, SUMOReal sameThreshold=2.0)
MainDirections(const EdgeVector &outgoing, NBEdge *parent, NBNode *to)
constructor
void extrapolate(const SUMOReal val, const bool onlyFirst=false)
void copyConnectionsFrom(NBEdge *src)
void reinit(NBNode *from, NBNode *to, const std::string &type, SUMOReal speed, unsigned int nolanes, int priority, PositionVector geom, SUMOReal width, SUMOReal offset, const std::string &streetName, LaneSpreadFunction spread=LANESPREAD_RIGHT, bool tryIgnoreNodePositions=false)
Resets initial values.
static const SUMOReal ANGLE_LOOKAHEAD
the distance at which to take the default angle
SUMOReal getLength() const
Returns the computed length of the edge.
SUMOReal getAngleAtNode(const NBNode *const node) const
Returns the angle of the edge's geometry at the given node.
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.
NBNode * getFromNode() const
Returns the origin node of the edge.
bool splitGeometry(NBEdgeCont &ec, NBNodeCont &nc)
Splits this edge at geometry points.