45 #ifdef CHECK_MEMORY_LEAKS 47 #endif // CHECK_MEMORY_LEAKS 92 }
else if (forced &&
myTYellow < tyellow) {
102 std::vector<SUMOReal> ret;
103 for (std::vector<PhaseDef>::const_iterator i =
myPhases.begin(); i !=
myPhases.end(); i++) {
104 ret.push_back((
SUMOReal)(*i).myTime);
108 for (std::vector<PhaseDef>::const_iterator i =
myPhases.begin(); i !=
myPhases.end(); i++) {
111 if (time > cycleDuration) {
112 time = time - cycleDuration;
131 for (std::vector<PhaseDef>::const_reverse_iterator i =
myPhases.rbegin(); i !=
myPhases.rend(); i++) {
133 if (time >= nextTime) {
145 return has_red_now && had_green;
152 if ((*i).getFrom() == from && (*i).getTo() == to) {
171 if ((*i).getFrom() == from) {
183 if ((*i).getFrom() == which) {
186 for (EdgeVector::const_iterator j = by.begin(); j != by.end(); j++) {
189 throw ProcessError(
"Could not replace edge '" + which->
getID() +
"' by '" + (*j)->getID() +
"'.\nUndefined...");
191 newConns.push_back(curr);
197 copy(newConns.begin(), newConns.end(),
205 if ((*i).getTo() == to) {
217 if ((*i).getTo() == which) {
220 for (EdgeVector::const_iterator j = by.begin(); j != by.end(); j++) {
223 throw ProcessError(
"Could not replace edge '" + which->
getID() +
"' by '" + (*j)->getID() +
"'.\nUndefined...");
225 newConns.push_back(curr);
231 copy(newConns.begin(), newConns.end(),
240 if ((*i).getTo() == removed
242 ((*i).getToLane() == removedLane
244 (*i).getToLane() == -1)) {
245 (*i).replaceTo(removed, removedLane, by, byLane);
247 }
else if ((*i).getTo() == removed && removedLane == -1) {
248 (*i).replaceTo(removed, by);
251 if ((*i).getFrom() == removed
253 ((*i).getFromLane() == removedLane
255 (*i).getFromLane() == -1)) {
256 (*i).replaceFrom(removed, removedLane, by, byLane);
258 }
else if ((*i).getFrom() == removed && removedLane == -1) {
259 (*i).replaceFrom(removed, by);
297 NBLoadedTLDef::SignalGroupCont::const_iterator i;
299 std::set<SUMOReal> tmpSwitchTimes;
310 for (std::vector<SUMOReal>::const_iterator k = gtimes.begin(); k != gtimes.end(); k++) {
311 tmpSwitchTimes.insert(*k);
314 std::vector<SUMOReal> switchTimes;
315 copy(tmpSwitchTimes.begin(), tmpSwitchTimes.end(), back_inserter(switchTimes));
316 sort(switchTimes.begin(), switchTimes.end());
319 unsigned int noSignals = 0;
321 noSignals += (*i).second->getLinkNo();
325 for (std::vector<SUMOReal>::iterator l = switchTimes.begin(); l != switchTimes.end(); l++) {
327 unsigned int duration;
328 if (l != switchTimes.end() - 1) {
330 duration = (
unsigned int)((*(l + 1)) - (*l));
333 duration = (
unsigned int)(
myCycleDuration - (*l) + * (switchTimes.begin()));
348 const std::vector<NBTrafficLightLogic::PhaseDefinition> phases = logic->
getPhases();
349 for (std::vector<NBTrafficLightLogic::PhaseDefinition>::const_iterator it = phases.begin(); it != phases.end(); it++) {
350 const std::string state = (*it).state;
362 && (state[i2] ==
'G' || state[i2] ==
'g')
393 unsigned int pos = 0;
400 unsigned int linkNo = group->
getLinkNo();
401 bool mayDrive = group->
mayDrive(time);
410 for (
unsigned int j = 0; j < linkNo; j++) {
424 unsigned int linkNo = group->
getLinkNo();
425 for (
unsigned int j = 0; j < linkNo; j++) {
430 if (state[pos] ==
'g') {
433 if (state[pos] ==
'y') {
447 const std::string& state,
448 unsigned int strmpos)
const {
450 if (state[strmpos] !=
'g' && state[strmpos] !=
'G') {
456 unsigned int pos = 0;
460 unsigned int linkNo = group->
getLinkNo();
461 for (
unsigned int j = 0; j < linkNo; j++) {
472 if (state[pos] ==
'g' || state[pos] ==
'G') {
488 SignalGroupCont::const_iterator m;
491 unsigned int linkNo = group->
getLinkNo();
492 for (
unsigned int j = 0; j < linkNo; j++) {
510 for (
unsigned int j = 0; j < noLanes; j++) {
512 for (std::vector<NBEdge::Connection>::iterator k = elv.begin(); k != elv.end(); k++) {
522 unsigned int pos = 0;
525 unsigned int linkNo = group->
getLinkNo();
526 for (
unsigned int j = 0; j < linkNo; j++) {
532 if (tst.getFrom()->mayBeTLSControlled(tst.getFromLane(), tst.getTo(), tst.getToLane())) {
536 && tst.getFrom() == c.
getFrom() && tst.getTo() == c.
getTo()
537 && (tst.getFromLane() < 0 || tst.getFromLane() == c.
getFromLane())
538 && (tst.getToLane() < 0 || tst.getToLane() == c.
getToLane())) {
556 if ((*i).second->containsConnection(from, to)) {
589 for (NBConnectionVector::const_iterator i = connections.begin(); i != connections.end(); i++) {
646 group->
remap(removed, removedLane, by, byLane);
655 throw ProcessError(
"myNeedsContRelation was not propperly initialized\n");
SignalGroup * findGroup(NBEdge *from, NBEdge *to) const
Returns the signal group which is responsible for the given connection.
bool mustBrake(const NBConnection &possProhibited, const std::string &state, unsigned int strmpos) const
Returns the information whether a connection must brake, given a phase.
bool mayDrive(SUMOTime time) const
Returns whether vehicles on controlled links may drive at the given time.
static MsgHandler * getWarningInstance()
Returns the instance to add warnings to.
bool check(const NBEdgeCont &ec)
checks whether the edges are still valid
bool setControllingTLInformation(const NBConnection &c, const std::string &tlID)
Returns if the link could be set as to be controlled.
A structure which describes a connection between edges or lanes.
void setSignalYellowTimes(const std::string &groupid, SUMOTime tRedYellow, SUMOTime tYellow)
Sets the times the light is yellow or red/yellow.
int toLane
The lane the connections yields in.
TrafficLightType myType
The algorithm type for the traffic light.
virtual void addNode(NBNode *node)
Adds a node to the traffic light logic.
void initNeedsContRelation() const
NBEdge * toEdge
The edge the connections yields in.
~SignalGroup()
Destructor.
A single signal group, may control several connections.
SignalGroup(const std::string &id)
Constructor.
void addSignalGroupPhaseBegin(const std::string &groupid, SUMOTime time, TLColor color)
Sets the information about the begin of a phase.
void closeBuilding()
closes the building process
A SUMO-compliant built logic for a traffic light.
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.
void sortPhases()
Sorts the phases.
bool replaceTo(NBEdge *which, NBEdge *by)
replaces the to-edge by the one given
int getFromLane() const
returns the from-lane
void collectNodes()
Collects the nodes participating in this traffic light.
Used for sorting the cells by the begin time they describe.
bool containsOutgoing(NBEdge *to) const
Returns whether this signal controls a connection where the given edge is the destination.
The base class for traffic light logic definitions.
TLColor
An enumeration of possible tl-signal states.
std::vector< Connection > getConnectionsFromLane(unsigned int lane) const
Returns connections from a given lane.
SUMOTime myOffset
The offset in the program.
Definition of a single, loaded phase.
NBEdge * getFrom() const
returns the from-edge (start of the connection)
#define WRITE_WARNING(msg)
std::string buildPhaseState(unsigned int time) const
Builds the phase for a given time.
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)
void remapOutgoing(NBEdge *which, const EdgeVector &by)
Replaces the given outgoing edge by the others given.
const std::string & getID() const
Returns the id.
static const int InvalidTlIndex
bool replaceFrom(NBEdge *which, NBEdge *by)
replaces the from-edge by the one given
void remapIncoming(NBEdge *which, const EdgeVector &by)
Replaces the given incoming edge by the others given.
bool addToSignalGroup(const std::string &groupid, const NBConnection &connection)
Adds a connection to a signal group.
NBTrafficLightLogic * myCompute(unsigned int brakingTimeSeconds)
Computes the traffic light logic finally in dependence to the type.
const std::vector< PhaseDefinition > & getPhases() const
Returns the phases.
SignalGroupCont mySignalGroups
Controlled signal groups.
unsigned int myCycleDuration
The duration of a single cycle.
unsigned int getNumLanes() const
Returns the number of lanes.
std::vector< PhaseDef > myPhases
The phases of this signal.
Storage for edges, including some functionality operating on multiple edges.
bool containsConnection(NBEdge *from, NBEdge *to) const
Returns whether the given connection is controlled by this signal.
void remap(NBEdge *removed, int removedLane, NBEdge *by, int byLane)
Replaces a removed edge/lane.
void patchTYellow(unsigned int tyellow, bool forced)
Sets the yellow time.
void collectLinks()
Collects the links participating in this traffic light If a link could not be found.
static const std::string DefaultProgramID
bool mustBrake(const NBEdge *const from, const NBEdge *const to) const
Returns the information whether the described flow must let any other flow pass.
std::string toString(const T &t, std::streamsize accuracy=OUTPUT_ACCURACY)
void addConnection(const NBConnection &c)
Inserts a controlled connection.
std::vector< SUMOReal > getTimes(SUMOTime cycleDuration) const
Returns the times at which the signal switches.
Base class for objects which have an id.
void addPhaseBegin(SUMOTime time, TLColor color)
Sets the begin of a phase.
std::vector< NBConnection > NBConnectionVector
Definition of a connection vector.
bool hasYellow(SUMOTime time) const
Returns whether controlled links have yellow at the given time.
void setYellowTimes(SUMOTime tRedYellowe, SUMOTime tYellow)
Sets the times for redyellow and yellow.
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.
NBLoadedTLDef(const NBEdgeCont &ec, const std::string &id, const std::vector< NBNode * > &junctions, SUMOTime offset, TrafficLightType type)
Constructor.
NBNode * getToNode() const
Returns the destination node of the edge.
void addTrafficLight(NBTrafficLightDefinition *tlDef)
Adds a traffic light to the list of traffic lights that control this node.
void setCycleDuration(unsigned int cycleDur)
Sets the duration of a cycle.
void setTLControllingInformation() const
Informs edges about being controlled by a tls.
SUMOTime myTRedYellow
The times of redyellow and yellow.
void addSignalGroup(const std::string &id)
Adds a signal group.
bool myNeedsContRelationReady
std::vector< NBEdge * > EdgeVector
Sorts phases by their begin time.
int getToLane() const
returns the to-lane
unsigned int getLinkNo() const
Returns the number of links (connection) controlled by this signal.
NBEdge * getTo() const
returns the to-edge (end of the connection)
NeedsContRelation myNeedsContRelation
Represents a single node (junction) during network building.
const NBConnection & getConnection(unsigned int pos) const
Returns the connection at the given index.
bool containsIncoming(NBEdge *from) const
Returns whether this signal controls the given edge.
void replaceRemoved(NBEdge *removed, int removedLane, NBEdge *by, int byLane)
Replaces a removed edge/lane.
NBConnectionVector myConnections
Connections controlled by this signal.
data structure for caching needsCont information
~NBLoadedTLDef()
Destructor.
std::vector< NBNode * > myControlledNodes
The container with participating nodes.
void remapRemoved(NBEdge *removed, const EdgeVector &incoming, const EdgeVector &outgoing)
Replaces occurences of the removed edge in incoming/outgoing edges of all definitions.
void addStep(SUMOTime duration, const std::string &state, int index=-1)
Adds a phase to the logic.
void clear()
Clears information whether an error occured previously.
const NBEdgeCont * myEdgeCont
NBConnectionVector myControlledLinks
The list of controlled links.
NBNode * getFromNode() const
Returns the origin node of the edge.