34 #define OFFRAMP_LOOKBACK 500
37 #define DEBUGNODEID "260479469"
38 #define DEBUGCOND(obj) ((obj != 0 && (obj)->getID() == DEBUGNODEID))
53 const bool guessAndAdd = oc.
getBool(
"ramps.guess") && mayAddOrRemove;
54 const double minHighwaySpeed = oc.
getFloat(
"ramps.min-highway-speed");
55 const double maxRampSpeed = oc.
getFloat(
"ramps.max-ramp-speed");
56 const double rampLength = oc.
getFloat(
"ramps.ramp-length");
57 const double minWeaveLength = oc.
getFloat(
"ramps.min-weave-length");
58 const bool dontSplit = oc.
getBool(
"ramps.no-split");
62 std::set<NBEdge*> incremented;
64 std::set<std::string> noramps;
65 if (oc.
isSet(
"ramps.unset")) {
67 noramps.insert(edges.begin(), edges.end());
71 for (std::set<EdgeSet>::const_iterator it_round = roundabouts.begin();
72 it_round != roundabouts.end(); ++it_round) {
73 for (EdgeSet::const_iterator it_edge = it_round->begin(); it_edge != it_round->end(); ++it_edge) {
74 noramps.insert((*it_edge)->getID());
83 if (guessAndAdd || oc.
getBool(
"ramps.guess-acceleration-lanes")) {
84 for (
const auto& it : ec) {
85 it.second->markOffRamp(
false);
89 std::set<NBNode*, ComparatorIdLess> potOnRamps;
90 std::set<NBNode*, ComparatorIdLess> potOffRamps;
91 for (
const auto& i : nc) {
93 if (
mayNeedOnRamp(cur, minHighwaySpeed, maxRampSpeed, noramps, minWeaveLength)) {
94 potOnRamps.insert(cur);
97 potOffRamps.insert(cur);
100 for (std::set<NBNode*, ComparatorIdLess>::const_iterator i = potOnRamps.begin(); i != potOnRamps.end(); ++i) {
101 buildOnRamp(*i, nc, ec, dc, rampLength, dontSplit || !guessAndAdd, guessAndAdd);
103 for (std::set<NBNode*, ComparatorIdLess>::const_iterator i = potOffRamps.begin(); i != potOffRamps.end(); ++i) {
104 buildOffRamp(*i, nc, ec, dc, rampLength, dontSplit || !guessAndAdd, guessAndAdd, potOnRamps);
108 if (oc.
isSet(
"ramps.set") && mayAddOrRemove) {
110 std::set<NBNode*, ComparatorIdLess> potOnRamps;
111 for (std::vector<std::string>::iterator i = edges.begin(); i != edges.end(); ++i) {
113 if (noramps.count(*i) != 0) {
114 WRITE_WARNING(
"Can not build ramp on edge '" + *i +
"' - the edge is unsuitable.");
118 WRITE_WARNING(
"Can not build on ramp on edge '" + *i +
"' - the edge is not known.");
123 buildOnRamp(from, nc, ec, dc, rampLength, dontSplit,
true);
124 potOnRamps.insert(from);
129 WRITE_WARNING(
"Can not build off ramp on edge '" + *i +
"' - the edge is not known.");
134 buildOffRamp(to, nc, ec, dc, rampLength, dontSplit,
true, potOnRamps);
146 NBEdge* potHighway, *potRamp, *cont;
152 while (seen < minWeaveLength) {
174 NBEdge* potHighway, *potRamp, *prev;
182 NBEdge* potHighway, *potRamp, *cont;
186 std::cout <<
"buildOnRamp cur=" << cur->
getID() <<
" hw=" << potHighway->
getID() <<
" ramp=" << potRamp->
getID() <<
" cont=" << cont->
getID() <<
"\n";
195 std::set<NBEdge*> incremented;
196 if (addLanes && toAdd > 0 && std::find(incremented.begin(), incremented.end(), cont) == incremented.end()) {
197 double currLength = 0;
198 while (curr !=
nullptr && currLength + curr->
getGeometry().
length() - POSITION_EPS < rampLength) {
199 if (find(incremented.begin(), incremented.end(), curr) == incremented.end()) {
204 incremented.insert(curr);
222 }
else if (curr == potHighway || curr == potRamp) {
232 if (curr !=
nullptr && !dontSplit && currLength - POSITION_EPS < rampLength && curr->getNumLanes() == firstLaneNumber && std::find(incremented.begin(), incremented.end(), curr) == incremented.end()) {
234 bool wasFirst = first == curr;
237 throw ProcessError(
"Ups - could not build on-ramp for edge '" + curr->
getID() +
"' (node could not be build)!");
239 std::string name = curr->
getID();
242 WRITE_ERROR(
"Ups - could not build on-ramp for edge '" + curr->
getID() +
"'!");
247 incremented.insert(curr);
258 if (curr == cont && dontSplit && addLanes) {
259 WRITE_WARNING(
"Could not build on-ramp for edge '" + curr->
getID() +
"' due to option '--ramps.no-split'");
264 for (
int i = 0; i < firstLaneNumber - potHighway->
getNumLanes(); ++i) {
287 const std::set<NBNode*, ComparatorIdLess>& potOnRamps) {
288 NBEdge* potHighway, *potRamp, *prev;
292 std::cout <<
"buildOffRamp cur=" << cur->
getID() <<
" hw=" << potHighway->
getID() <<
" ramp=" << potRamp->
getID() <<
" prev=" << prev->
getID() <<
"\n";
301 std::set<NBEdge*> incremented;
302 if (addLanes && toAdd > 0 && std::find(incremented.begin(), incremented.end(), prev) == incremented.end()) {
303 double currLength = 0;
304 while (curr !=
nullptr && currLength + curr->
getGeometry().
length() - POSITION_EPS < rampLength) {
305 if (find(incremented.begin(), incremented.end(), curr) == incremented.end()) {
310 incremented.insert(curr);
328 }
else if (curr == potHighway || curr == potRamp) {
338 if (curr !=
nullptr && !dontSplit && currLength - POSITION_EPS < rampLength && curr->getNumLanes() == firstLaneNumber && std::find(incremented.begin(), incremented.end(), curr) == incremented.end()) {
340 bool wasFirst = first == curr;
344 throw ProcessError(
"Ups - could not build off-ramp for edge '" + curr->
getID() +
"' (node could not be build)!");
346 std::string name = curr->
getID();
349 WRITE_ERROR(
"Ups - could not build off-ramp for edge '" + curr->
getID() +
"'!");
352 curr = ec.
retrieve(name +
"-AddedOffRampEdge");
353 incremented.insert(curr);
360 if (curr == prev && dontSplit && addLanes) {
361 WRITE_WARNING(
"Could not build off-ramp for edge '" + curr->
getID() +
"' due to option '--ramps.no-split'");
375 }
else if (potOnRamps.count(from) == 1) {
406 const double offset = (0.5 * addedLanes *
418 if (fabs((*potHighway)->getSpeed() - (*potRamp)->getSpeed()) < .1) {
421 if ((*potHighway)->getSpeed() < (*potRamp)->getSpeed()) {
422 std::swap(*potHighway, *potRamp);
430 if ((*potHighway)->getNumLanes() == (*potRamp)->getNumLanes()) {
433 if ((*potHighway)->getNumLanes() < (*potRamp)->getNumLanes()) {
434 std::swap(*potHighway, *potRamp);
444 assert(edges.size() == 2);
445 *potHighway = edges[0];
459 std::swap(*potHighway, *potRamp);
468 *potHighway = edges[0];
470 assert(edges.size() == 2);
482 const std::vector<NBEdge*>& edges2 = n->
getEdges();
485 std::cout <<
" edges=" <<
toString(edges) <<
" edges2=" <<
toString(edges2) <<
"\n";
488 std::vector<NBEdge*>::const_iterator i = std::find(edges2.begin(), edges2.end(), *other);
490 if ((*i) == *potRamp) {
491 std::swap(*potHighway, *potRamp);
504 NBEdge* potHighway,
NBEdge* potRamp,
NBEdge* other,
double minHighwaySpeed,
double maxRampSpeed,
505 const std::set<std::string>& noramps) {
524 if (maxSpeed < minHighwaySpeed) {
558 if (maxRampSpeed > 0 && maxRampSpeed < potRamp->getSpeed()) {
561 if (noramps.find(other->
getID()) != noramps.end()) {
575 for (
int i = 0; i < (int)edge->
getNumLanes(); ++i) {
604 if (firstIndex % 2 == 1) {
#define WRITE_WARNING(msg)
@ SVC_PASSENGER
vehicle is a passenger car (a "normal" car)
@ SVC_BICYCLE
vehicle is a bicycle
@ SVC_PEDESTRIAN
pedestrian
const double SUMO_const_laneWidth
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
static void nextCW(const EdgeVector &edges, EdgeVector::const_iterator &from)
A container for districts.
Storage for edges, including some functionality operating on multiple edges.
const std::set< EdgeSet > getRoundabouts() const
Returns the determined roundabouts.
NBEdge * retrieve(const std::string &id, bool retrieveExtracted=false) const
Returns the edge that has the given id.
bool splitAt(NBDistrictCont &dc, NBEdge *edge, NBNode *node)
Splits the edge at the position nearest to the given node.
The representation of a single edge during network building.
double getLength() const
Returns the computed length of the edge.
SVCPermissions getPermissions(int lane=-1) const
get the union of allowed classes over all lanes or for a specific lane
double getLoadedLength() const
Returns the length was set explicitly or the computed length if it wasn't set.
double getLaneWidth() const
Returns the default width of lanes of this edge.
void incLaneNo(int by)
increment lane
void markOffRamp(bool isOffRamp)
marks this edge has being an offRamp or leading to one (used for connection computation)
LaneSpreadFunction getLaneSpreadFunction() const
Returns how this edge's lanes' lateral offset is computed.
bool hasDefaultGeometryEndpoints() const
Returns whether the geometry is terminated by the node positions This default may be violated by init...
EdgeBuildingStep getStep() const
The building step of this edge.
const std::string & getID() const
NBNode * getToNode() const
Returns the destination node of the edge.
@ LANES2LANES_USER
Lanes to lanes - relationships are loaded; no recheck is necessary/wished.
double getSpeed() const
Returns the speed allowed on this edge.
void resetLaneShapes()
reset lane shapes to what they would be before cutting with the junction shapes
void setAcceleration(int lane, bool accelRamp)
marks one lane as acceleration lane
bool isTurningDirectionAt(const NBEdge *const edge) const
Returns whether the given edge is the opposite direction to this edge.
int getNumLanes() const
Returns the number of lanes.
const PositionVector & getGeometry() const
Returns the geometry of the edge.
void invalidateConnections(bool reallowSetting=false)
invalidate current connections of edge
@ VALIDATED
The connection was computed and validated.
double getAngleAtNode(const NBNode *const node) const
Returns the angle of the edge's geometry at the given node.
bool hasDefaultGeometryEndpointAtNode(const NBNode *node) const
Returns whether the geometry is terminated by the node positions This default may be violated by init...
static const double UNSPECIFIED_WIDTH
unspecified lane width
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.
bool isMacroscopicConnector() const
Returns whether this edge was marked as a macroscopic connector.
const PositionVector & getLaneShape(int i) const
Returns the shape of the nth lane.
void setGeometry(const PositionVector &g, bool inner=false)
(Re)sets the edge's geometry
NBNode * getFromNode() const
Returns the origin node of the edge.
static double relAngle(double angle1, double angle2)
computes the relative angle between the two angles
Instance responsible for building networks.
NBDistrictCont & getDistrictCont()
Returns a reference the districts container.
NBParkingCont & getParkingCont()
NBPTLineCont & getPTLineCont()
Returns a reference to the pt line container.
NBEdgeCont & getEdgeCont()
NBPTStopCont & getPTStopCont()
Returns a reference to the pt stop container.
NBNodeCont & getNodeCont()
Returns a reference to the node container.
Container for nodes during the netbuilding process.
bool insert(const std::string &id, const Position &position, NBDistrict *district=0)
Inserts a node into the map.
Represents a single node (junction) during network building.
SumoXMLNodeType getType() const
Returns the type of this node.
static bool isTrafficLight(SumoXMLNodeType type)
return whether the given type is a traffic light
const EdgeVector & getOutgoingEdges() const
Returns this node's outgoing edges (The edges which start at this node)
const EdgeVector & getEdges() const
Returns all edges which participate in this node (Edges that start or end at this node)
const EdgeVector & getIncomingEdges() const
Returns this node's incoming edges (The edges which yield in this node)
void addEdges2Keep(const OptionsCont &oc, std::set< std::string > &into)
add edges that must be kept
void addEdges2Keep(const OptionsCont &oc, std::set< std::string > &into)
add edges that must be kept
void addEdges2Keep(const OptionsCont &oc, std::set< std::string > &into)
add edges that must be kept
static void computeRamps(NBNetBuilder &nb, OptionsCont &oc, bool mayAddOrRemove)
Computes highway on-/off-ramps (if wished)
static void getOffRampEdges(NBNode *n, NBEdge **potHighway, NBEdge **potRamp, NBEdge **other)
static bool mayNeedOffRamp(NBNode *cur, double minHighwaySpeed, double maxRampSpeed, const std::set< std::string > &noramps)
Determines whether the given node may be an off-ramp end.
static bool mayNeedOnRamp(NBNode *cur, double minHighwaySpeed, double maxRampSpeed, const std::set< std::string > &noramps, double minWeaveLength)
Determines whether the given node may be an on-ramp begin.
static bool determinedBySpeed(NBEdge **potHighway, NBEdge **potRamp)
static void moveRampRight(NBEdge *ramp, int addedLanes)
Moves the ramp to the right, as new lanes were added.
static void getOnRampEdges(NBNode *n, NBEdge **potHighway, NBEdge **potRamp, NBEdge **other)
static const std::string ADDED_ON_RAMP_EDGE
suffix for newly generated on-ramp edges
static void patchRampGeometry(NBEdge *potRamp, NBEdge *first, NBEdge *potHighway, bool onRamp)
shift ramp geometry to merge smoothly with the motorway
static void buildOffRamp(NBNode *cur, NBNodeCont &nc, NBEdgeCont &ec, NBDistrictCont &dc, double rampLength, bool dontSplit, bool addLanes, const std::set< NBNode *, ComparatorIdLess > &potOnRamps)
Builds an off-ramp ending at the given node.
static bool determinedByLaneNumber(NBEdge **potHighway, NBEdge **potRamp)
static bool hasWrongMode(NBEdge *edge)
whether the edge has a mode that does not indicate a ramp edge
static void buildOnRamp(NBNode *cur, NBNodeCont &nc, NBEdgeCont &ec, NBDistrictCont &dc, double rampLength, bool dontSplit, bool addLanes)
Builds an on-ramp starting at the given node.
static bool fulfillsRampConstraints(NBEdge *potHighway, NBEdge *potRamp, NBEdge *other, double minHighwaySpeed, double maxRampSpeed, const std::set< std::string > &noramps)
Checks whether an on-/off-ramp can be bult here.
const std::string & getID() const
Returns the id.
A storage for options typed value containers)
bool isSet(const std::string &name, bool failOnNonExistant=true) const
Returns the information whether the named option is set.
double getFloat(const std::string &name) const
Returns the double-value of the named option (only for Option_Float)
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
const StringVector & getStringVector(const std::string &name) const
Returns the list of string-value of the named option (only for Option_StringVector)
A point in 2D or 3D with translation and scaling methods.
double length() const
Returns the length.
Position positionAtOffset(double pos, double lateralOffset=0) const
Returns the position at the given length.
void move2side(double amount, double maxExtension=100)
move position vector to side using certain ammount