blob: 0733ac2e26eaf5448be8f1a24c56711549004cc2 (
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
#include "search/v2/intersection_result.hpp"
#include "std/limits.hpp"
#include "std/sstream.hpp"
namespace search
{
namespace v2
{
// static
uint32_t const IntersectionResult::kInvalidId = numeric_limits<uint32_t>::max();
IntersectionResult::IntersectionResult()
: m_poi(kInvalidId), m_building(kInvalidId), m_street(kInvalidId)
{
}
void IntersectionResult::Set(SearchModel::SearchType type, uint32_t id)
{
switch (type)
{
case SearchModel::SEARCH_TYPE_POI: m_poi = id; break;
case SearchModel::SEARCH_TYPE_BUILDING: m_building = id; break;
case SearchModel::SEARCH_TYPE_STREET: m_street = id; break;
case SearchModel::SEARCH_TYPE_CITY:
case SearchModel::SEARCH_TYPE_VILLAGE:
case SearchModel::SEARCH_TYPE_STATE:
case SearchModel::SEARCH_TYPE_COUNTRY:
case SearchModel::SEARCH_TYPE_UNCLASSIFIED:
case SearchModel::SEARCH_TYPE_COUNT: ASSERT(false, ("Unsupported type.")); break;
}
}
uint32_t IntersectionResult::InnermostResult() const
{
if (m_poi != kInvalidId)
return m_poi;
if (m_building != kInvalidId)
return m_building;
if (m_street != kInvalidId)
return m_street;
return kInvalidId;
}
void IntersectionResult::Clear()
{
m_poi = kInvalidId;
m_building = kInvalidId;
m_street = kInvalidId;
}
string DebugPrint(IntersectionResult const & result)
{
ostringstream os;
os << "IntersectionResult [ ";
if (result.m_poi != IntersectionResult::kInvalidId)
os << "POI:" << result.m_poi << " ";
if (result.m_building != IntersectionResult::kInvalidId)
os << "BUILDING:" << result.m_building << " ";
if (result.m_street != IntersectionResult::kInvalidId)
os << "STREET:" << result.m_street << " ";
os << "]";
return os.str();
}
} // namespace v2
} // namespace search
|
