blob: 2f630ef9aa244b8b2229d8ab0e69f6ab05e6e3d2 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
#pragma once
#include "search/model.hpp"
#include <cstdint>
#include <limits>
#include <string>
namespace search
{
// This class holds higher-level features for an intersection result,
// i.e. BUILDING and STREET for POI or STREET for BUILDING.
struct IntersectionResult
{
static uint32_t constexpr kInvalidId = std::numeric_limits<uint32_t>::max();
void Set(Model::Type type, uint32_t id);
// Returns the first valid feature among the [POI, BUILDING,
// STREET].
uint32_t InnermostResult() const;
// Returns true when at least one valid feature exists.
inline bool IsValid() const { return InnermostResult() != kInvalidId; }
// Clears all fields to an invalid state.
void Clear();
uint32_t m_poi = kInvalidId;
uint32_t m_building = kInvalidId;
uint32_t m_street = kInvalidId;
};
std::string DebugPrint(IntersectionResult const & result);
} // namespace search
|
