40 #include <mesosim/MELoop.h>
41 #include <mesosim/MESegment.h>
44 #ifdef CHECK_MEMORY_LEAKS
46 #endif // CHECK_MEMORY_LEAKS
64 const std::vector<MSEdge*>& edges = ec.
getEdges();
65 for (std::vector<MSEdge*>::const_iterator e = edges.begin(); e != edges.end(); ++e) {
67 const std::vector<MSLane*>& lanes = edge.
getLanes();
68 for (std::vector<MSLane*>::const_iterator lane = lanes.begin(); lane != lanes.end(); ++lane) {
80 double queueing_time = 0.0;
81 double queueing_length = 0.0;
82 double queueing_length2 = 0.0;
85 for (std::vector<MSVehicle*>::const_iterator veh = lane.
myVehBuffer.begin(); veh != lane.
myVehBuffer.end(); ++veh) {
95 if (tmp_length > queueing_length) {
96 queueing_length = tmp_length;
101 for (MSLane::VehCont::const_iterator veh = lane.
myVehicles.begin(); veh != lane.
myVehicles.end(); ++veh) {
112 if (tmp_length > queueing_length) {
113 queueing_length = tmp_length;
120 double tmp_length2 = 0.0;
121 for (MSLane::VehCont::const_iterator veh = lane.
myVehicles.begin(); veh != lane.
myVehicles.end(); ++veh) {
123 double threshold_velocity = 5 / 3.6;
132 if (tmp_length2 > queueing_length2) {
133 queueing_length2 = tmp_length2;
139 if (queueing_length > 1 || queueing_length2 > 1) {