111 NBEdge* currentOutgoing,
const bool buildCrossingsAndWalkingAreas);
117 return (
unsigned int)myAvailableLanes.size();
121 void execute(
const unsigned int src,
const unsigned int dest);
125 std::deque<int>*
spread(
const std::vector<int>& approachingLanes,
int dest)
const;
223 bool updateEdgeGeometries =
false);
445 const NBEdge*
const possProhibitedFrom,
const NBEdge*
const possProhibitedTo,
446 bool regardNonSignalisedLowerPriority)
const;
457 const NBEdge*
const from2,
const NBEdge*
const to2)
const;
468 int fromLane,
bool mayDefinitelyPass,
const std::string& tlID)
const;
509 NBEdge* fromE,
int fromL,
NBEdge* toE,
int toL,
int numPoints = 5)
const;
582 const Crossing&
getCrossing(
const std::string&
id)
const;
639 unsigned int whichLaneOff,
unsigned int byLaneOff);
void replaceIncoming(NBEdge *which, NBEdge *by, unsigned int laneOff)
Replaces occurences of the first edge within the list of incoming by the second Connections are remap...
const EdgeVector & getIncomingEdges() const
Returns this node's incoming edges.
Position getEmptyDir() const
Returns something like the most unused direction Should only be used to add source or sink nodes...
A structure which describes a connection between edges or lanes.
void setRoundabout()
update the type of this node as a roundabout
std::vector< Crossing > myCrossings
Vector of crossings.
Position getCenter() const
Returns a position that is guaranteed to lie within the node shape.
SUMOReal width
This lane's width.
void shiftTLConnectionLaneIndex(NBEdge *edge, int offset)
patches loaded signal plans by modifying lane indices
std::string id
the (edge)-id of this crossing
PositionVector myPoly
the (outer) shape of the junction
NBEdge * getOppositeIncoming(NBEdge *e) const
const NBConnectionProhibits & getProhibitions()
void execute(const unsigned int src, const unsigned int dest)
SumoXMLNodeType myType
The type of the junction.
A container for traffic light definitions and built programs.
SUMOReal length
This lane's width.
void reinit(const Position &position, SumoXMLNodeType type, bool updateEdgeGeometries=false)
Resets initial values.
SUMOReal width
This lane's width.
bool isTLControlled() const
Returns whether this node is controlled by any tls.
PositionVector computeInternalLaneShape(NBEdge *fromE, int fromL, NBEdge *toE, int toL, int numPoints=5) const
Compute the shape for an internal lane.
This class computes shapes of junctions.
const Crossing & getCrossing(const std::string &id) const
return the crossing with the given id
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.
int numNormalConnections() const
return the number of lane-to-lane connections at this junction (excluding crossings) ...
ApproachingDivider(EdgeVector *approaching, NBEdge *currentOutgoing, const bool buildCrossingsAndWalkingAreas)
Constructor.
void addCrossing(EdgeVector edges, SUMOReal width, bool priority)
add a pedestrian crossing to this node
bool mustBrake(const NBEdge *const from, const NBEdge *const to, int toLane) const
Returns the information whether the described flow must let any other flow pass.
Used for sorting the cells by the begin time they describe.
bool hasOutgoing(const NBEdge *const e) const
Returns whether the given edge starts at this node.
A container for districts.
const std::vector< Crossing > & getCrossings() const
return this junctions pedestrian crossings
The base class for traffic light logic definitions.
EdgeVector edgesBetween(const NBEdge *e1, const NBEdge *e2) const
return all edges that lie clockwise between the given edges
bool isJoinedTLSControlled() const
Returns whether this node is controlled by a tls that spans over more than one node.
PositionVector shape
The lane's shape.
edge_by_direction_sorter(NBNode *n)
static const int MAX_CONNECTIONS
maximum number of connections allowed
std::string id
the (edge)-id of this walkingArea
bool checkIsRemovable() const
void computeLanes2Lanes(const bool buildCrossingsAndWalkingAreas)
computes the connections of lanes to edges
void removeTrafficLight(NBTrafficLightDefinition *tlDef)
Removes the given traffic light from this node.
void setCustomShape(const PositionVector &shape)
set the junction shape
NBConnectionProhibits myBlockedConnections
bool hasIncoming(const NBEdge *const e) const
Returns whether the given edge ends at this node.
void addOutgoingEdge(NBEdge *edge)
adds an outgoing edge
#define UNUSED_PARAMETER(x)
unsigned int numAvailableLanes() const
bool priority
whether the pedestrians have priority
LinkDirection
The different directions a link between two lanes may take (or a stream between two edges)...
NBDistrict * myDistrict
The district the node is the centre of.
A class representing a single district.
const EdgeVector & getOutgoingEdges() const
Returns this node's outgoing edges.
const std::string & getID() const
Returns the id.
EdgeVector myAllEdges
Vector of incoming and outgoing edges.
void invalidateIncomingConnections()
void setPriorityJunctionPriorities()
sets the priorites in case of a priority junction
const Position & getPosition() const
Returns the position of this node.
std::string prevWalkingArea
the lane-id of the previous walkingArea
NBEdge * getPossiblySplittedIncoming(const std::string &edgeid)
void computeNodeShape(bool leftHand, SUMOReal mismatchThreshold)
Compute the junction shape for this node.
const std::set< NBTrafficLightDefinition * > & getControllingTLS() const
Returns the traffic lights that were assigned to this node.
bool isSimpleContinuation() const
int checkCrossing(EdgeVector candidates)
static const int FORWARD
edge directions (for pedestrian related stuff)
std::vector< unsigned int > myAvailableLanes
The available lanes to which connections shall be built.
int operator()(NBNode *n1, NBNode *n2) const
Comparing operator.
A point in 2D or 3D with translation and scaling methods.
bool mustBrakeForCrossing(const NBEdge *const from, const NBEdge *const to, const Crossing &crossing) const
Returns the information whether the described flow must brake for the given crossing.
bool needsCont(NBEdge *fromE, NBEdge *toE, NBEdge *otherFromE, NBEdge *otherToE, const NBEdge::Connection &c) const
SumoXMLNodeType getType() const
Returns the type of this node.
bool geometryLike() const
whether this is structurally similar to a geometry node
void invalidateOutgoingConnections()
LinkState
The right-of-way state of a link between two lanes used when constructing a NBTrafficLightLogic, in MSLink and GNEInternalLane.
void removeTrafficLights()
Removes all references to traffic lights that control this tls.
EdgeVector * getEdgesThatApproach(NBEdge *currentOutgoing)
const EdgeVector & getEdges() const
Returns all edges which participate in this node.
std::set< NBTrafficLightDefinition * > myTrafficLights
Storage for edges, including some functionality operating on multiple edges.
std::string nextCrossing
the lane-id of the next crossing
void setCrossingTLIndices(unsigned int startIndex)
set tl indices of this nodes crossing starting at the given index
NBNode * myNode
The node to compute the relative angle of.
const PositionVector & getShape() const
retrieve the junction shape
NBEdge * getConnectionTo(NBNode *n) const
EdgeVector myIncomingEdges
Vector of incoming edges.
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.
std::vector< std::pair< NBEdge *, NBEdge * > > getEdgesToJoin() const
int operator()(NBEdge *e1, NBEdge *e2) const
NBEdge * getPossiblySplittedOutgoing(const std::string &edgeid)
unsigned int removeSelfLoops(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tc)
Removes edges which are both incoming and outgoing into this node.
EdgeVector myOutgoingEdges
Vector of outgoing edges.
NBEdge * myCurrentOutgoing
The approached current edge.
static const int BACKWARD
nodes_by_id_sorter()
Constructor.
void addTrafficLight(NBTrafficLightDefinition *tlDef)
Adds a traffic light to the list of traffic lights that control this node.
bool isNearDistrict() const
bool myHaveCustomPoly
whether this nodes shape was set by the user
Position myPosition
The position the node lies at.
std::map< NBConnection, NBConnectionVector > NBConnectionProhibits
Definition of a container for connection block dependencies Includes a list of all connections which ...
void replaceOutgoing(NBEdge *which, NBEdge *by, unsigned int laneOff)
Replaces occurences of the first edge within the list of outgoing by the second Connections are remap...
~ApproachingDivider()
Destructor.
std::vector< WalkingArea > myWalkingAreas
Vector of walking areas.
LinkState getLinkState(const NBEdge *incoming, NBEdge *outgoing, int fromLane, bool mayDefinitelyPass, const std::string &tlID) const
SumoXMLNodeType
Numbers representing special SUMO-XML-attribute values for representing node- (junction-) types used ...
unsigned int buildCrossings()
Sorts outgoing before incoming edges.
int tlLinkNo
the traffic light index of this crossing (if controlled)
void replaceInConnectionProhibitions(NBEdge *which, NBEdge *by, unsigned int whichLaneOff, unsigned int byLaneOff)
std::vector< NBEdge * > EdgeVector
std::string tlID
the traffic light id of the next crossing or ""
NBNode & operator=(const NBNode &s)
invalidated assignment operator
A definition of a pedestrian walking area.
EdgeVector * myApproaching
The list of edges that approach the current edge.
A storage for options typed value containers)
const NBNode * node
The parent node of this crossing.
static const SUMOReal DEFAULT_CROSSING_WIDTH
default width of pedetrian crossings
std::deque< int > * spread(const std::vector< int > &approachingLanes, int dest) const
EdgeVector edges
The edges being crossed.
bool crossingBetween(const NBEdge *e1, const NBEdge *e2) const
return true if the given edges are connected by a crossing
Represents a single node (junction) during network building.
int guessCrossings()
guess pedestrian crossings and return how many were guessed
A definition of a pedestrian crossing.
void addSortedLinkFoes(const NBConnection &mayDrive, const NBConnection &mustStop)
Static storage of an output device and its base (abstract) implementation.
Computes lane-2-lane connections.
bool writeLogic(OutputDevice &into, const bool checkLaneFoes) const
WalkingArea(const std::string &_id, SUMOReal _width)
void computeLogic(const NBEdgeCont &ec, OptionsCont &oc)
computes the node's type, logic and traffic light
Container for nodes during the netbuilding process.
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.
const std::vector< WalkingArea > & getWalkingAreas() const
return this junctions pedestrian walking areas
void buildInnerEdges(bool buildCrossingsAndWalkingAreas)
build internal lanes, pedestrian crossings and walking areas
void invalidateTLS(NBTrafficLightLogicCont &tlCont)
causes the traffic light to be computed anew
std::string nextWalkingArea
the lane-id of the next walkingArea
NBNode(const std::string &id, const Position &position, SumoXMLNodeType type)
Constructor.
std::vector< std::string > prevSidewalks
the lane-id of the previous sidewalk lane or ""
Crossing(const NBNode *_node, const EdgeVector &_edges, SUMOReal _width, bool _priority)
std::vector< std::string > nextSidewalks
the lane-id of the next sidewalk lane or ""
void reshiftPosition(SUMOReal xoff, SUMOReal yoff)
Applies an offset to the node.
bool hasCustomShape()
return whether the shape was set by the user
void remapRemoved(NBTrafficLightLogicCont &tc, NBEdge *removed, const EdgeVector &incoming, const EdgeVector &outgoing)
PositionVector shape
The polygonal shape.
A storage for available types of 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.
LinkDirection getDirection(const NBEdge *const incoming, const NBEdge *const outgoing) const
Returns the representation of the described stream's direction.
NBNode * getFromNode() const
Returns the origin node of the edge.