| 53 | } |
| 54 | |
| 55 | bool GetPath(uint32_t id, vector<FeaturesLayer const *> const & layers, ParentGraph const & parent, |
| 56 | IntersectionResult & result) |
| 57 | { |
| 58 | result.Clear(); |
| 59 | if (layers.size() != parent.size() + 1) |
| 60 | return false; |
| 61 | |
| 62 | size_t level = 0; |
| 63 | for (auto parentGraphLayer = parent.crbegin(); parentGraphLayer != parent.crend(); ++parentGraphLayer, ++level) |
| 64 | { |
| 65 | result.Set(layers[level]->m_type, id); |
| 66 | auto const it = parentGraphLayer->find(id); |
| 67 | if (it == parentGraphLayer->cend()) |
| 68 | return false; |
| 69 | id = it->second; |
| 70 | } |
| 71 | result.Set(layers[level]->m_type, id); |
| 72 | return true; |
| 73 | } |
| 74 | |
| 75 | bool MayHaveDelayedFeatures(FeaturesLayer const & layer) |
| 76 | { |