| 84 | } |
| 85 | |
| 86 | std::pair<RoadAccess::Type, RoadAccess::Confidence> RoadAccess::GetAccessWithoutConditional(uint32_t featureId) const |
| 87 | { |
| 88 | // todo(@m) This may or may not be too slow. Consider profiling this and using |
| 89 | // a Bloom filter or anything else that is faster than ska::flat_hash_map |
| 90 | auto const it = m_wayToAccess.find(featureId); |
| 91 | if (it != m_wayToAccess.cend()) |
| 92 | return {it->second, Confidence::Sure}; |
| 93 | |
| 94 | return {Type::Yes, Confidence::Sure}; |
| 95 | } |
| 96 | |
| 97 | std::pair<RoadAccess::Type, RoadAccess::Confidence> RoadAccess::GetAccessWithoutConditional( |
| 98 | RoadPoint const & point) const |