31 std::vector<const T *> vec;
32 auto it = element::MakeRoadInfoIterator<T>(
_road_set.GetAll());
33 for (; !it.IsAtEnd(); ++it) {
34 vec.emplace_back(&*it);
43 auto it = element::MakeRoadInfoIterator<T>(
_road_set.GetReverseSubset(s));
44 return it.IsAtEnd() ? nullptr : &*it;
49 std::vector<const T *>
GetInfos(
const double min_s,
const double max_s)
const {
50 std::vector<const T *> vec;
52 auto it = element::MakeRoadInfoIterator<T>(
53 _road_set.GetSubsetInRange(min_s, max_s));
54 for (; !it.IsAtEnd(); ++it) {
55 vec.emplace_back(&*it);
58 auto it = element::MakeRoadInfoIterator<T>(
59 _road_set.GetReverseSubsetInRange(max_s, min_s));
60 for (; !it.IsAtEnd(); ++it) {
61 vec.emplace_back(&*it);
This file contains definitions of common data structures used in traffic manager. ...
A set of elements ordered by its position on the road.
Inherit (privately) to suppress copy construction and assignment.