46 #ifdef CHECK_MEMORY_LEAKS 48 #endif // CHECK_MEMORY_LEAKS 96 NBConnection conn(from, fromLane, to, toLane, linkIndex);
141 (*it).replaceFrom(removed, removedLane, by, byLane);
142 (*it).replaceTo(removed, removedLane, by, byLane);
177 if (it->getFrom() == conn.
getFrom() &&
178 it->getTo() == conn.
getTo() &&
189 const int removed = it->getTLIndex();
206 const std::vector<NBTrafficLightLogic::PhaseDefinition> phases =
myTLLogic->
getPhases();
208 for (std::vector<NBTrafficLightLogic::PhaseDefinition>::const_iterator it = phases.begin(); it != phases.end(); it++) {
209 std::string newState = it->state;
210 newState.erase(newState.begin() + removed);
211 newLogic->
addStep(it->duration, newState);
242 const EdgeVector& incoming = (*i)->getIncomingEdges();
243 copy(incoming.begin(), incoming.end(), back_inserter(
myIncomingEdges));
244 const EdgeVector& outgoing = (*i)->getOutgoingEdges();
245 copy(outgoing.begin(), outgoing.end(), back_inserter(myOutgoing));
252 EdgeVector::iterator k = find(myOutgoing.begin(), myOutgoing.end(), edge);
253 if (k != myOutgoing.end()) {
255 bool controlled =
false;
257 if ((*it).getFrom() == edge) {
266 (*j)->setIsInnerEdge();
296 (*it).shiftLaneIndex(edge, offset);
312 int oldCrossings = 0;
314 std::vector<NBNode::Crossing> crossings;
316 const std::vector<NBNode::Crossing>& c = (*i)->getCrossings();
318 (*i)->setCrossingTLIndices(noLinksAll);
319 copy(c.begin(), c.end(), std::back_inserter(crossings));
320 noLinksAll += (int)c.size();
321 oldCrossings += (*i)->numCrossingsFromSumoNet();
323 const int newCrossings = (int)crossings.size() - oldCrossings;
324 if (newCrossings > 0) {
325 const std::vector<NBTrafficLightLogic::PhaseDefinition> phases =
myTLLogic->
getPhases();
326 if (phases.size() > 0) {
327 if ((
int)phases.front().state.size() == noLinksAll - newCrossings) {
333 std::vector<int> fromLanes(size, 0);
335 const std::string crossingDefaultState(newCrossings,
'r');
338 const std::vector<NBTrafficLightLogic::PhaseDefinition> phases =
myTLLogic->
getPhases();
342 for (std::vector<NBTrafficLightLogic::PhaseDefinition>::const_iterator it = phases.begin(); it != phases.end(); it++) {
343 if ((*it).state.find_first_of(
"yY") != std::string::npos) {
344 brakingTime =
MAX2(brakingTime, it->duration);
352 }
else if ((
int)phases.front().state.size() != noLinksAll) {
362 assert(fromEdges.size() > 0);
363 assert(fromEdges.size() == toEdges.size());
364 const int size = (int)fromEdges.size();
371 "' with " +
toString(size) +
" links.");
387 const std::vector<NBTrafficLightLogic::PhaseDefinition> phases =
myTLLogic->
getPhases();
388 for (std::vector<NBTrafficLightLogic::PhaseDefinition>::const_iterator it = phases.begin(); it != phases.end(); it++) {
389 const std::string state = (*it).state;
401 && (state[i2] ==
'G' || state[i2] ==
'g')
407 if (forbidden || rightTurnConflict) {
void removeConnection(const NBConnection &conn, bool reconstruct=true)
removes the given connection from the traffic light if recontruct=true, reconstructs the logic and in...
bool setControllingTLInformation(const NBConnection &c, const std::string &tlID)
Returns if the link could be set as to be controlled.
TrafficLightType getType() const
get the algorithm type (static etc..)
TrafficLightType myType
The algorithm type for the traffic light.
virtual void addNode(NBNode *node)
Adds a node to the traffic light logic.
NBLoadedSUMOTLDef(const std::string &id, const std::string &programID, SUMOTime offset, TrafficLightType type)
Constructor.
bool rightOnRedConflict(int index, int foeIndex) const
whether the given index must yield to the foeIndex while turing right on a red light ...
void collectEdges()
Build the list of participating edges.
void collectAllLinks()
helper method for use in NBOwnTLDef and NBLoadedSUMOTLDef
void setOffset(SUMOTime offset)
Sets the offset of this tls.
int getNumLinks()
Returns the number of participating links.
void closeBuilding()
closes the building process
RightOnRedConflicts myRightOnRedConflicts
A SUMO-compliant built logic for a traffic light.
TrafficLightType getType() const
get the algorithm type (static etc..)
EdgeVector myIncomingEdges
The list of incoming edges.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
const std::string & getProgramID() const
Returns the ProgramID.
The representation of a single edge during network building.
class for identifying connections
int getFromLane() const
returns the from-lane
The base class for traffic light logic definitions.
void setOffset(SUMOTime offset)
Sets the offset of this tls.
SUMOTime myOffset
The offset in the program.
NBEdge * getFrom() const
returns the from-edge (start of the connection)
#define UNUSED_PARAMETER(x)
#define WRITE_WARNING(msg)
void replaceRemoved(NBEdge *removed, int removedLane, NBEdge *by, int byLane)
Replaces a removed edge/lane.
static OptionsCont & getOptions()
Retrieves the options.
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...
void setTLIndex(int tlIndex)
SUMOTime getOffset()
Returns the offset.
void setType(TrafficLightType type)
set the algorithm type (static etc..)
const std::string & getID() const
Returns the id.
virtual void collectEdges()
Build the list of participating edges.
static const int InvalidTlIndex
const std::vector< PhaseDefinition > & getPhases() const
Returns the phases.
std::set< std::string > myControlledInnerEdges
Set of inner edges that shall be controlled, though.
const NBConnectionVector & getControlledLinks() const
returns the controlled links (depends on previous call to collectLinks)
void patchIfCrossingsAdded()
repair the plan if controlled nodes received pedestrian crossings
std::set< NBNode * > myOriginalNodes
The original nodes for which the loaded logic is valid.
void initNeedsContRelation() const
static std::string addPedestrianPhases(NBTrafficLightLogic *logic, SUMOTime greenTime, std::string state, const std::vector< NBNode::Crossing > &crossings, const EdgeVector &fromEdges, const EdgeVector &toEdges)
add 1 or 2 phases depending on the presence of pedestrian crossings
std::string toString(const T &t, std::streamsize accuracy=OUTPUT_ACCURACY)
void remapRemoved(NBEdge *removed, const EdgeVector &incoming, const EdgeVector &outgoing)
Replaces occurences of the removed edge in incoming/outgoing edges of all definitions.
const std::vector< NBNode * > & getNodes() const
Returns the list of controlled nodes.
bool forbids(const NBEdge *const possProhibitorFrom, const NBEdge *const possProhibitorTo, const NBEdge *const possProhibitedFrom, const NBEdge *const possProhibitedTo, bool regardNonSignalisedLowerPriority, bool sameNodeOnly=false) const
Returns the information whether "prohibited" flow must let "prohibitor" flow pass.
SUMOTime getOffset() const
Returns the offset of first switch.
std::set< NBEdge * > myShifted
set of edges with shifted lane indices (to avoid shifting twice)
bool myRightOnRedConflictsReady
void setTLControllingInformation() const
Informs edges about being controlled by a tls.
static void addPedestrianScramble(NBTrafficLightLogic *logic, int noLinksAll, SUMOTime greenTime, SUMOTime yellowTime, const std::vector< NBNode::Crossing > &crossings, const EdgeVector &fromEdges, const EdgeVector &toEdges)
add an additional pedestrian phase if there are crossings that did not get green yet ...
NBNode * getToNode() const
Returns the destination node of the edge.
void addPhase(SUMOTime duration, const std::string &state)
Adds a phase to the logic the new phase is inserted at the end of the list of already added phases...
bool myNeedsContRelationReady
std::vector< NBEdge * > EdgeVector
int getToLane() const
returns the to-lane
void collectLinks()
Collects the links participating in this traffic light (only if not previously loaded) ...
NBEdge * getTo() const
returns the to-edge (end of the connection)
NeedsContRelation myNeedsContRelation
NBTrafficLightLogic * myCompute(int brakingTimeSeconds)
Computes the traffic light logic finally in dependence to the type.
~NBLoadedSUMOTLDef()
Destructor.
data structure for caching needsCont information
void setType(TrafficLightType type)
Sets the algorithm type of this tls.
void collectEdgeVectors(EdgeVector &fromEdges, EdgeVector &toEdges, std::vector< int > &fromLanes) const
Collects the edges for each tlIndex.
std::vector< NBNode * > myControlledNodes
The container with participating nodes.
void addStep(SUMOTime duration, const std::string &state, int index=-1)
Adds a phase to the logic.
NBConnectionVector myControlledLinks
The list of controlled links.
EdgeVector myEdgesWithin
The list of edges within the area controlled by the tls.
void shiftTLConnectionLaneIndex(NBEdge *edge, int offset)
patches signal plans by modifying lane indices
NBTrafficLightLogic * myTLLogic
phases are added directly to myTLLogic which is then returned in myCompute()
void addConnection(NBEdge *from, NBEdge *to, int fromLane, int toLane, int linkIndex)
Adds a connection and immediately informs the edges.
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.
NBNode * getFromNode() const
Returns the origin node of the edge.