56 myEdgeCont(myTypeCont),
57 myNetworkHaveCrossings(false) {
87 const bool lefthand = oc.
getBool(
"lefthand");
95 int numRemovedEdges = 0;
98 if (mayAddOrRemove && oc.
exists(
"remove-edges.isolated") && oc.
getBool(
"remove-edges.isolated")) {
103 if (mayAddOrRemove && oc.
exists(
"keep-edges.components") && oc.
getInt(
"keep-edges.components") > 0) {
109 if (mayAddOrRemove && oc.
exists(
"keep-edges.postload") && oc.
getBool(
"keep-edges.postload")) {
116 if (oc.
isSet(
"keep-edges.explicit") || oc.
isSet(
"keep-edges.input-file")) {
123 numRemovedEdges += removed;
128 numRemovedEdges += removed2;
135 if (!(oc.
exists(
"ptline-output") && oc.
isSet(
"ptline-output"))
136 && !oc.
getBool(
"ptstop-output.no-bidi")) {
143 if (mayAddOrRemove && oc.
exists(
"keep-edges.components") && oc.
getInt(
"keep-edges.components") > 0) {
148 if (numRemovedEdges > 0) {
158 if (oc.
exists(
"ptline-clean-up") && oc.
getBool(
"ptline-clean-up")) {
164 if (numDeletedStops > 0) {
165 WRITE_WARNINGF(
TL(
"Removed % pt stops because they could not be assigned to the network"),
toString(numDeletedStops));
175 int numAddedBidi = 0;
176 if (oc.
exists(
"railway.topology.all-bidi") && oc.
getBool(
"railway.topology.all-bidi")) {
179 }
else if (oc.
exists(
"railway.topology.repair") && oc.
getBool(
"railway.topology.repair")) {
182 oc.
getFloat(
"geometry.min-radius"),
false,
183 oc.
getBool(
"geometry.min-radius.fix.railways"),
true);
188 if (numAddedBidi > 0) {
192 if (oc.
exists(
"railway.topology.direction-priority") && oc.
getBool(
"railway.topology.direction-priority")) {
195 }
else if (oc.
exists(
"railway.topology.extend-priority") && oc.
getBool(
"railway.topology.extend-priority")) {
199 if (oc.
exists(
"railway.topology.output") && oc.
isSet(
"railway.topology.output")) {
205 if (mayAddOrRemove && oc.
exists(
"edges.join-tram-dist") && oc.
getFloat(
"edges.join-tram-dist") >= 0) {
210 if (numJoinedTramEdges > 0) {
214 if (oc.
getBool(
"junctions.join")
216 || oc.
getBool(
"tls.guess.joining")
217 || (oc.
exists(
"tls.guess-signals") && oc.
getBool(
"tls.guess-signals"))) {
227 if (oc.
getBool(
"roundabouts.guess")) {
231 for (std::set<EdgeSet>::const_iterator it_round = roundabouts.begin();
232 it_round != roundabouts.end(); ++it_round) {
233 std::vector<std::string> nodeIDs;
234 for (EdgeSet::const_iterator it_edge = it_round->begin(); it_edge != it_round->end(); ++it_edge) {
235 nodeIDs.push_back((*it_edge)->getToNode()->getID());
244 if (mayAddOrRemove && oc.
exists(
"junctions.join-exclude") && oc.
isSet(
"junctions.join-exclude")) {
248 if (mayAddOrRemove && oc.
getBool(
"junctions.join")) {
256 if (mayAddOrRemove && oc.
exists(
"junctions.join-same") && oc.
getBool(
"junctions.join-same")) {
260 if (numJoined2 > 0) {
265 if (mayAddOrRemove && oc.
exists(
"join-lanes") && oc.
getBool(
"join-lanes")) {
272 if (mayAddOrRemove) {
273 const bool removeGeometryNodes = oc.
exists(
"geometry.remove") && oc.
getBool(
"geometry.remove");
286 boundary.
add(it->second->getPosition());
289 boundary.
add(it->second->getGeometry().getBoxBoundary());
298 if (oc.
exists(
"geometry.min-dist") && !oc.
isDefault(
"geometry.min-dist")) {
305 if (mayAddOrRemove && oc.
getBool(
"edges.join")) {
307 const bool removeDuplicates = oc.
exists(
"junctions.join-same") && oc.
getBool(
"junctions.join-same");
310 if (oc.
exists(
"geometry.remove") && oc.
getBool(
"geometry.remove")) {
315 if (oc.
getBool(
"opposites.guess")) {
321 if (mayAddOrRemove && oc.
exists(
"geometry.split") && oc.
getBool(
"geometry.split")) {
326 if (oc.
getBool(
"junctions.join-same")) {
328 if (numJoined3 > 0) {
338 if (oc.
exists(
"geometry.avoid-overlap") && oc.
getBool(
"geometry.avoid-overlap")) {
344 if (oc.
isSet(
"tls.set")) {
345 std::vector<std::string> tlControlledNodes = oc.
getStringVector(
"tls.set");
347 for (std::vector<std::string>::const_iterator i = tlControlledNodes.begin(); i != tlControlledNodes.end(); ++i) {
349 if (node ==
nullptr) {
350 WRITE_WARNING(
"Building a tl-logic for junction '" + *i +
"' is not possible." +
"\n The junction '" + *i +
"' is not known.");
360 const bool modifyRamps = mayAddOrRemove && (
362 || (oc.
exists(
"ramps.set") && oc.
isSet(
"ramps.set")));
363 if (modifyRamps || (oc.
exists(
"ramps.guess-acceleration-lanes") && oc.
getBool(
"ramps.guess-acceleration-lanes"))) {
377 if (mayAddOrRemove && ((oc.
getBool(
"bikelanes.guess") || oc.
getBool(
"bikelanes.guess.from-permissions")))) {
379 oc.
getFloat(
"bikelanes.guess.min-speed"),
380 oc.
getFloat(
"bikelanes.guess.max-speed"),
381 oc.
getBool(
"bikelanes.guess.from-permissions"),
382 "bikelanes.guess.exclude",
388 if (mayAddOrRemove && ((oc.
getBool(
"sidewalks.guess") || oc.
getBool(
"sidewalks.guess.from-permissions")))) {
390 oc.
getFloat(
"sidewalks.guess.min-speed"),
391 oc.
getFloat(
"sidewalks.guess.max-speed"),
392 oc.
getBool(
"sidewalks.guess.from-permissions"),
393 "sidewalks.guess.exclude",
401 if (mayAddOrRemove) {
404 if (numChangedEdges + numChangedNodes > 0) {
410 if (oc.
exists(
"geometry.max-angle")) {
414 oc.
getBool(
"geometry.min-radius.fix"),
415 oc.
getBool(
"geometry.min-radius.fix.railways"));
426 if (oc.
exists(
"geometry.junction-mismatch-threshold")) {
441 if (oc.
exists(
"speed.offset")) {
442 const double speedOffset = oc.
getFloat(
"speed.offset");
443 const double speedFactor = oc.
getFloat(
"speed.factor");
444 const double speedMin = oc.
getFloat(
"speed.minimum");
445 if (speedOffset != 0 || speedFactor != 1 || speedMin > 0) {
448 NBEdge*
const e = it.second;
464 if (mayAddOrRemove && oc.
getBool(
"crossings.guess")) {
468 crossings += (*i).second->guessCrossings();
473 bool haveValidCrossings =
false;
476 if (i->second->getCrossings().size() > 0) {
478 haveValidCrossings =
true;
480 }
else if (i->second->getCrossingsIncludingInvalid().size() > 0) {
487 oc.
set(
"walkingareas",
"true");
494 oc.
set(
"no-internal-links",
"false");
506 if (oc.
getBool(
"roundabouts.guess")) {
509 if (numGuessed > 0) {
525 if (oc.
getBool(
"fringe.guess")) {
528 if (numGuessed > 0) {
535 if (!oc.
getBool(
"no-turnarounds")) {
537 oc.
getBool(
"no-turnarounds.tls"),
538 oc.
getBool(
"no-turnarounds.fringe"),
539 oc.
getBool(
"no-turnarounds.except-deadend"),
540 oc.
getBool(
"no-turnarounds.except-turnlane"),
541 oc.
getBool(
"no-turnarounds.geometry"));
545 if (oc.
exists(
"railway.topology.repair.stop-turn") && oc.
getBool(
"railway.topology.repair.stop-turn")
558 i->second->buildCrossingsAndWalkingAreas();
564 i->second->discardWalkingareas();
566 if (oc.
getBool(
"no-internal-links")) {
568 i->second->discardAllCrossings(
false);
583 if (oc.
exists(
"opendrive-files") && oc.
isSet(
"opendrive-files")) {
596 std::string progCount =
"";
597 if (numbers.first != numbers.second) {
598 progCount =
"(" +
toString(numbers.second) +
" programs) ";
601 if (oc.
exists(
"opendrive-files") && oc.
isSet(
"opendrive-files") && oc.
getBool(
"opendrive.signal-groups")) {
606 (*i).second->sortOutgoingConnectionsByIndex();
609 std::set<NBTrafficLightDefinition*> largeNodeTLS;
610 if (!oc.
getBool(
"no-internal-links")) {
615 const std::set<NBTrafficLightDefinition*>& tlDefs = item.second->getControllingTLS();
616 largeNodeTLS.insert(tlDefs.begin(), tlDefs.end());
622 if (oc.
getFloat(
"junctions.scurve-stretch") > 0) {
629 item.second->buildInnerEdges();
652 if (oc.
isSet(
"street-sign-output")) {
659 if (lefthand != oc.
getBool(
"flip-y-axis")) {
663 if (oc.
exists(
"geometry.check-overlap") && oc.
getFloat(
"geometry.check-overlap") > 0) {
680 int numBidiStops = 0;
681 if (!oc.
getBool(
"ptstop-output.no-bidi")) {
685 double maxRadius = oc.
getFloat(
"railway.access-distance");
686 double accessFactor = oc.
getFloat(
"railway.access-factor");
687 int maxCount = oc.
getInt(
"railway.max-accesses");
690 if (numBidiStops > 0) {
698 if (oc.
exists(
"ignore-change-restrictions") && !oc.
isDefault(
"ignore-change-restrictions")) {
707 WRITE_WARNING(
TL(
"Network contains very large coordinates and will probably flicker in the GUI. Check for outlying nodes and make sure the network is shifted to the coordinate origin"));
711 if (oc.
exists(
"osm-files") && oc.
isSet(
"osm-files")) {
723 const double x = -boundary.
xmin();
724 const double y = -(lefthand ? boundary.
ymax() : boundary.
ymin());
729 (*i).second->reshiftPosition(x, y);
732 (*i).second->reshiftPosition(x, y);
735 (*i).second->reshiftPosition(x, y);
738 stopIt.second->reshiftPosition(x, y);
749 (*i).second->mirrorX();
752 (*i).second->mirrorX();
755 (*i).second->mirrorX();
758 stopIt.second->mirrorX();
769 && from_srs !=
nullptr
795 const double eps = 1e-6;
796 from.
set(std::round(from.
x() / eps) * eps, std::round(from.
y() / eps) * eps, std::round(from.
z() / eps) * eps);
804 if (maxLength > 0 && from.size() > 1) {
807 for (
int i = 0; i < (int) from.size(); i++) {
813 for (
int i = 0; i < (int) from.size(); i++) {
825 for (
int i = 0; i < (int)cartesian.size() - 1; i++) {
826 Position start = from[i + inserted];
827 Position end = from[i + inserted + 1];
828 double length = cartesian[i].distanceTo(cartesian[i + 1]);
829 const Position step = (end - start) * (maxLength / length);
831 while (length > maxLength) {
834 from.insert(from.begin() + i + inserted + 1, start + (step * steps));
#define WRITE_WARNINGF(...)
#define WRITE_MESSAGEF(...)
#define WRITE_WARNING(msg)
#define PROGRESS_BEGIN_TIME_MESSAGE(msg)
#define PROGRESS_TIME_MESSAGE(before)
#define PROGRESS_DONE_MESSAGE()
#define PROGRESS_BEGIN_MESSAGE(msg)
SVCPermissions parseVehicleClasses(const std::string &allowedS)
Parses the given definition of allowed vehicle classes into the given containers Deprecated classes g...
long long int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
@ SVC_IGNORING
vehicles ignoring classes
@ SVC_BICYCLE
vehicle is a bicycle
@ SVC_PEDESTRIAN
pedestrian
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
A class that stores a 2D geometrical boundary.
void add(double x, double y, double z=0)
Makes the boundary include the given coordinate.
double ymin() const
Returns minimum y-coordinate.
double xmin() const
Returns minimum x-coordinate.
double ymax() const
Returns maximum y-coordinate.
double xmax() const
Returns maximum x-coordinate.
double getZRange() const
Returns the elevation range of the boundary (z-axis)
static methods for processing the coordinates conversion for the current net
static GeoConvHelper & getProcessing()
the coordinate transformation to use for input conversion and processing
const Position getOffset() const
Returns the network offset.
void setConvBoundary(const Boundary &boundary)
sets the converted boundary
bool x2cartesian(Position &from, bool includeInBoundary=true)
Converts the given coordinate into a cartesian and optionally update myConvBoundary.
void cartesian2geo(Position &cartesian) const
Converts the given cartesian (shifted) position to its geo (lat/long) representation.
void moveConvertedBy(double x, double y)
Shifts the converted boundary by the given amounts.
static GeoConvHelper & getLoaded()
the coordinate transformation that was loaded fron an input file
static int getNumLoaded()
static void computeFinal(bool lefthand=false)
compute the location attributes which will be used for output based on the loaded location data,...
bool usingGeoProjection() const
Returns whether a transformation from geo to metric coordinates will be performed.
const Boundary & getConvBoundary() const
Returns the converted boundary.
std::map< std::string, NBDistrict * >::const_iterator begin() const
Returns the pointer to the begin of the stored districts.
std::map< std::string, NBDistrict * >::const_iterator end() const
Returns the pointer to the end of the stored districts.
std::map< std::string, NBEdge * >::const_iterator begin() const
Returns the pointer to the begin of the stored edges.
void computeEdgeShapes(double smoothElevationThreshold=-1)
Computes the shapes of all edges stored in the container.
const std::set< EdgeSet > getRoundabouts() const
Returns the determined roundabouts.
void computeEdge2Edges(bool noLeftMovers)
Computes for each edge the approached edges.
int guessRoundabouts()
Determines which edges belong to roundabouts and increases their priority.
void sortOutgoingLanesConnections()
Sorts all lanes of all edges within the container by their direction.
void appendRailwayTurnarounds(const NBPTStopCont &sc)
Appends turnarounds to all bidiRail edges with stops.
std::map< std::string, NBEdge * >::const_iterator end() const
Returns the pointer to the end of the stored edges.
void updateAllChangeRestrictions(SVCPermissions ignoring)
modify all restrictions on lane changing for edges and connections
void recheckPostProcessConnections()
Try to set any stored connections.
void checkGeometries(const double maxAngle, const double minRadius, bool fix, bool fixRailways, bool silent=false)
void recheckLanes()
Rechecks whether all lanes have a successor for each of the stored edges.
void reduceGeometries(const double minDist)
void cleanupRoundabouts()
void splitGeometry(NBDistrictCont &dc, NBNodeCont &nc)
Splits edges into multiple if they have a complex geometry.
void computeLanes2Edges()
Computes for each edge which lanes approach the next edges.
int getNumEdgeSplits() const
Returns the number of edge splits.
int joinTramEdges(NBDistrictCont &dc, NBPTStopCont &sc, NBPTLineCont &lc, double maxDist)
join tram edges into adjacent lanes
int removeUnwishedEdges(NBDistrictCont &dc)
Removes unwished edges (not in keep-edges)
void generateStreetSigns()
assigns street signs to edges based on toNode types
bool hasGuessedRoundabouts() const
check if there is guessed roundabouts
void computeAngles()
compute all edge angles
void guessOpposites()
Sets opposite lane information for geometrically close edges.
void markRoundabouts()
mark edge priorities and prohibit turn-arounds for all roundabout edges
void applyOptions(OptionsCont &oc)
Initialises the storage by applying given options.
int joinLanes(SVCPermissions perms)
join adjacent lanes with the given permissions
void checkOverlap(double threshold, double zThreshold) const
check whether edges overlap
int guessSpecialLanes(SUMOVehicleClass svc, double width, double minSpeed, double maxSpeed, bool fromPermissions, const std::string &excludeOpt, NBTrafficLightLogicCont &tlc)
add sidwalks to edges within the given limits or permissions and return the number of edges affected
void appendTurnarounds(bool noTLSControlled, bool noFringe, bool onlyDeadends, bool onlyTurnlane, bool noGeometryLike)
Appends turnarounds to all edges stored in the container.
void computeLaneShapes()
Computes the shapes of all lanes of all edges stored in the container.
void fixSplitCustomLength()
adapt custom lengths of split edges to account for intersection size
int remapIDs(bool numericaIDs, bool reservedIDs, const std::string &prefix, NBPTStopCont &sc)
remap node IDs accoring to options –numerical-ids and –reserved-ids
int removeEdgesBySpeed(NBDistrictCont &dc)
return number of edges removed
void checkGrade(double threshold) const
check whether edges are to steep
int removeEdgesByPermissions(NBDistrictCont &dc)
The representation of a single edge during network building.
double getLaneSpeed(int lane) const
get lane speed
void setSpeed(int lane, double speed)
set lane specific speed (negative lane implies set for all lanes)
int getNumLanes() const
Returns the number of lanes.
static void setDefaultConnectionLength(double length)
static void computeEdgePriorities(NBNodeCont &nc)
Computes edge priorities within a node.
Set z-values for all network positions based on data from a height map.
double getZ(const Position &geo) const
returns height for the given geo coordinate (WGS84)
static const NBHeightMapper & get()
return the singleton instance (maybe 0)
bool ready() const
returns whether the NBHeightMapper has data
static bool transformCoordinates(PositionVector &from, bool includeInBoundary=true, GeoConvHelper *from_srs=nullptr)
void mirrorX()
mirror the network along the X-axis
NBNetBuilder()
Constructor.
NBTrafficLightLogicCont myTLLCont
The used container for traffic light logics.
void moveToOrigin(GeoConvHelper &geoConvHelper, bool lefthand)
shift network so its lower left corner is at 0,0
bool myNetworkHaveCrossings
flag to indicate that network has crossings
NBDistrictCont myDistrictCont
The used container for districts.
static int addGeometrySegments(PositionVector &from, const PositionVector &cartesian, const double maxLength)
insertion geometry points to ensure maximum segment length between points
NBPTLineCont myPTLineCont
The used container for pt stops.
NBEdgeCont myEdgeCont
The used container for edges.
NBParkingCont myParkingCont
~NBNetBuilder()
Destructor.
NBTypeCont myTypeCont
The used container for street types.
NBPTStopCont myPTStopCont
The used container for pt stops.
void applyOptions(OptionsCont &oc)
Initialises the storage by applying given options.
static bool transformCoordinate(Position &from, bool includeInBoundary=true, GeoConvHelper *from_srs=nullptr)
transforms loaded coordinates handles projections, offsets (using GeoConvHelper) and import of height...
void compute(OptionsCont &oc, const std::set< std::string > &explicitTurnarounds=std::set< std::string >(), bool mayAddOrRemove=true)
Performs the network building steps.
NBNodeCont myNodeCont
The used container for nodes.
static bool runningNetedit()
whether netbuilding takes place in the context of netedit
std::map< std::string, NBNode * >::const_iterator begin() const
Returns the pointer to the begin of the stored nodes.
void avoidOverlap()
fix overlap
int removeRailComponents(NBDistrictCont &dc, NBEdgeCont &ec, NBPTStopCont &sc)
void recheckGuessedTLS(NBTrafficLightLogicCont &tlc)
recheck myGuessedTLS after node logics are computed
void computeKeepClear()
compute keepClear status for all connections
int removeSelfLoops(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tc)
Removes self-loop edges (edges where the source and the destination node are the same)
void addJoinExclusion(const std::vector< std::string > &ids)
int joinLoadedClusters(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tlc)
Joins loaded junction clusters (see NIXMLNodesHandler)
int remapIDs(bool numericaIDs, bool reservedIDs, const std::string &prefix, NBTrafficLightLogicCont &tlc)
remap node IDs according to options –numerical-ids and –reserved-ids
NBNode * retrieve(const std::string &id) const
Returns the node with the given name.
void joinTLS(NBTrafficLightLogicCont &tlc, double maxdist)
Builds clusters of tls-controlled junctions and joins the control if possible.
int removeUnwishedNodes(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tlc, NBPTStopCont &sc, NBPTLineCont &lc, NBParkingCont &pc, bool removeGeometryNodes)
Removes "unwished" nodes.
int removeComponents(NBDistrictCont &dc, NBEdgeCont &ec, const int numKeep, bool hasPTStops)
Checks the network for weak connectivity and removes all but the largest components....
void computeLogics2(const NBEdgeCont &ec, OptionsCont &oc)
compute right-of-way logic for all lane-to-lane connections
void joinSimilarEdges(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tlc, bool removeDuplicates)
Joins edges connecting the same nodes.
int removeIsolatedRoads(NBDistrictCont &dc, NBEdgeCont &ec)
Removes sequences of edges that are not connected with a junction. Simple roads without junctions som...
void setAsTLControlled(NBNode *node, NBTrafficLightLogicCont &tlc, TrafficLightType type, std::string id="")
Sets the given node as being controlled by a tls.
void computeLogics(const NBEdgeCont &ec)
build the list of outgoing edges and lanes
std::map< std::string, NBNode * >::const_iterator end() const
Returns the pointer to the end of the stored nodes.
void computeNodeShapes(double mismatchThreshold=-1)
Compute the junction shape for this node.
void guessTLs(OptionsCont &oc, NBTrafficLightLogicCont &tlc)
Guesses which junctions or junction clusters shall be controlled by tls.
int guessFringe()
guess and mark fringe nodes
int joinJunctions(double maxDist, NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tlc, NBPTStopCont &sc)
Joins junctions that are very close together.
void computeLanes2Lanes()
divides the incoming lanes on outgoing lanes
int joinSameJunctions(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tlc)
Joins junctions with the same coordinates regardless of topology.
bool resetNodeShapes()
reset all node shapes
Represents a single node (junction) during network building.
static void computeNodeTypes(NBNodeCont &nc, NBTrafficLightLogicCont &tlc)
Computes node types.
static void validateRailCrossings(NBNodeCont &nc, NBTrafficLightLogicCont &tlc)
Checks rail_crossing for validity.
static void sortNodesEdges(NBNodeCont &nc, bool useNodeShape=false)
Sorts a node's edges clockwise regarding driving direction.
void fixPermissions()
ensure that all turn lanes have sufficient permissions
void process(NBEdgeCont &ec, NBPTStopCont &sc, bool routeOnly=false)
std::set< std::string > & getServedPTStops()
void removeInvalidEdges(const NBEdgeCont &ec)
filter out edges that were removed due to –geometry.remove
void fixBidiStops(const NBEdgeCont &ec)
select the correct stop on superposed rail edges
const std::map< std::string, NBPTLine * > & getLines() const
int cleanupDeleted(NBEdgeCont &cont)
remove stops on non existing (removed) edges
void postprocess(std::set< std::string > &usedStops)
const std::map< std::string, std::shared_ptr< NBPTStop > > & getStops() const
Returns an unmodifiable reference to the stored pt stops.
void localizePTStops(NBEdgeCont &cont)
void assignEdgeForFloatingStops(NBEdgeCont &cont, double maxRadius)
void findAccessEdgesForRailStops(NBEdgeCont &cont, double maxRadius, int maxCount, double accessFactor)
int generateBidiStops(NBEdgeCont &cont)
duplicate stops for superposed rail edges and return the number of generated stops
void assignLanes(NBEdgeCont &cont)
static int guessRailSignals(NBEdgeCont &ec, NBPTStopCont &sc)
static int repairTopology(NBEdgeCont &ec, NBPTStopCont &sc, NBPTLineCont &lc)
static void extendDirectionPriority(NBEdgeCont &ec, bool fromUniDir)
static void analyzeTopology(NBEdgeCont &ec)
static int makeAllBidi(NBEdgeCont &ec)
void computeRamps(NBNetBuilder &nb, OptionsCont &oc, bool mayAddOrRemove)
static void reportWarnings()
reports warnings if any occurred
The base class for traffic light logic definitions.
static const std::string OSM_DIRECTION
processing parameter for rail signal edges and nodes
static const int MIN_YELLOW_SECONDS
void applyOptions(OptionsCont &oc)
Initialises the storage by applying given options.
void setOpenDriveSignalParameters()
set OpenDRIVE signal reference parameters after all link indices are known
bool computeSingleLogic(OptionsCont &oc, NBTrafficLightDefinition *def)
Computes a specific traffic light logic (using by netedit)
void applyOpenDriveControllers(OptionsCont &oc)
post processing of signal programs to group tl indices according to OpenDrive controllers (signal gro...
std::pair< int, int > computeLogics(OptionsCont &oc)
Computes the traffic light logics using the stored definitions and stores the results.
void setTLControllingInformation(const NBEdgeCont &ec, const NBNodeCont &nc)
Informs the edges about being controlled by a tls.
static void computeTurnDirections(NBNodeCont &nc, bool warn=true)
Computes turnaround destinations for all edges (if exist)
void setEdgeTypeDefaults(int defaultNumLanes, double defaultLaneWidth, double defaultSpeed, double defaultFriction, int defaultPriority, SVCPermissions defaultPermissions, LaneSpreadFunction defaultSpreadType)
Sets the default values.
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)
int getInt(const std::string &name) const
Returns the int-value of the named option (only for Option_Integer)
std::string getString(const std::string &name) const
Returns the string-value of the named option (only for Option_String)
bool isDefault(const std::string &name) const
Returns the information whether the named option has still the default value.
bool exists(const std::string &name) const
Returns the information whether the named option is known.
bool set(const std::string &name, const std::string &value, const bool append=false)
Sets the given value for the named option.
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)
void resetWritable()
Resets all options to be writeable.
static OptionsCont & getOptions()
Retrieves the options.
A point in 2D or 3D with translation and scaling methods.
void set(double x, double y)
set positions x and y
double x() const
Returns the x-position.
void setz(double z)
set position z
double z() const
Returns the z-position.
double y() const
Returns the y-position.
static StringBijection< LaneSpreadFunction > LaneSpreadFunctions
lane spread functions
static StringBijection< TrafficLightType > TrafficLightTypes
traffic light types
T get(const std::string &str) const
static long getCurrentMillis()
Returns the current time in milliseconds.