std::pair<MSVehicle * const, SUMOReal>
MSLane::getFollowerOnConsecutive(SUMOReal dist, SUMOReal seen, SUMOReal leaderSpeed, SUMOReal backOffset) const {
// ok, a vehicle has not noticed the lane about itself;
// iterate as long as necessary to search for an approaching one
std::set<MSLane*> visited;
std::vector<std::pair<MSVehicle *, SUMOReal> > possible;
std::vector<MSLane::IncomingLaneInfo> newFound;
std::vector<MSLane::IncomingLaneInfo> toExamine = myIncomingLanes;
while (toExamine.size()!=0) {
for (std::vector<MSLane::IncomingLaneInfo>::iterator i=toExamine.begin(); i!=toExamine.end(); ++i) {
/*
if ((*i).viaLink->getState()==MSLink::LINKSTATE_TL_RED) {
continue;
}
*/
MSLane *next = (*i).lane;
if (next->getFirstVehicle()!=0) {
MSVehicle * v = (MSVehicle*) next->getFirstVehicle();
SUMOReal agap = (*i).length - v->getPositionOnLane() + backOffset;
if (!v->getCarFollowModel().hasSafeGap(v->getCarFollowModel().maxNextSpeed(v->getSpeed()), agap, leaderSpeed, v->getLane().getMaxSpeed())) {
possible.push_back(std::make_pair(v, (*i).length-v->getPositionOnLane()+seen));
}
} else {
if ((*i).length+seen<dist) {
const std::vector<MSLane::IncomingLaneInfo> &followers = next->getIncomingLanes();
for (std::vector<MSLane::IncomingLaneInfo>::const_iterator j=followers.begin(); j!=followers.end(); ++j) {
if (visited.find((*j).lane)==visited.end()) {
visited.insert((*j).lane);
MSLane::IncomingLaneInfo ili;
ili.lane = (*j).lane;
ili.length = (*j).length + (*i).length;
ili.viaLink = (*j).viaLink;
newFound.push_back(ili);
}
}
}
}
}
toExamine.clear();
swap(newFound, toExamine);
}
if (possible.size()==0) {
return std::pair<MSVehicle * const, SUMOReal>(0, -1);
}
sort(possible.begin(), possible.end(), by_second_sorter());
return *(possible.begin());
}
