Searched refs:bestContinuations (Results 1 – 5 of 5) sorted by relevance
1365 && neigh.bestContinuations.back()->getLinkCont().size() != 0 in _wantsChange()1795 … roundaboutDistanceAhead = distanceAlongNextRoundabout(pos, veh.getLane(), curr.bestContinuations); in getRoundaboutAheadInfo()1809 …r (std::vector<MSLane*>::const_iterator i = curr.bestContinuations.begin(); i != curr.bestContinua… in getRoundaboutAheadInfo()1822 …tanceAheadNeigh += distanceAlongNextRoundabout(neighPosition, neigh.lane, neigh.bestContinuations); in getRoundaboutAheadInfo()1835 … (std::vector<MSLane*>::const_iterator it = curr.bestContinuations.begin(); it != curr.bestContinu… in getRoundaboutAheadInfo()1845 …std::vector<MSLane*>::const_iterator it = neigh.bestContinuations.begin(); it != neigh.bestContinu… in getRoundaboutAheadInfo()
1168 …for (std::vector<MSLane*>::iterator it = curr.bestContinuations.begin(); it != curr.bestContinuati…1177 …for (std::vector<MSLane*>::iterator it = neigh.bestContinuations.begin(); it != neigh.bestContinua…1225 && curr.bestContinuations.back()->getLinkCont().size() != 02548 && neigh.bestContinuations.back()->getLinkCont().size() != 02584 … (std::vector<MSLane*>::const_iterator it = curr.bestContinuations.begin(); it != curr.bestContinu…
4688 if (lanes[i].bestContinuations[0] != 0) {4690 … lanes[i].bestContinuations.insert(lanes[i].bestContinuations.begin(), (MSLane*)nullptr);4758 q.bestContinuations.push_back(cl);4865 …copy(bestConnectedNext.bestContinuations.begin(), bestConnectedNext.bestContinuations.end(), back_…4869 …nextLinkPriority(clanes[bestThisIndex].bestContinuations) < nextLinkPriority((*j).bestContinuation…4904 …NextIndex].bestContinuations.begin(), nextLanes[bestNextIndex].bestContinuations.end(), back_inser…4912 …|| (nextLinkPriority((*j).bestContinuations)) < nextLinkPriority(clanes[bestThisIndex].bestContinu…4915 …if ((nextLinkPriority((*j).bestContinuations)) < nextLinkPriority(clanes[bestThisIndex].bestContin…4956 …(std::vector<MSLane*>::const_iterator j = (*i).bestContinuations.begin() + 1; j != (*i).bestContin…4977 return (*myCurrentLaneInBestLanes).bestContinuations;[all …]
836 std::vector<MSLane*> bestContinuations; member
362 …for (std::vector<MSLane*>::const_iterator j = lq.bestContinuations.begin(); j != lq.bestContinuati… in getBestLanes()