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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
#pragma once
#include "../geometry/point2d.hpp"
#include "../geometry/rect2d.hpp"
#include "../std/string.hpp"
namespace search
{
// Search result. Search returns a list of them, ordered by score.
class Result
{
public:
enum ResultType
{
RESULT_FEATURE,
RESULT_SUGGESTION
};
Result(string const & str, string const & region,
string const & flag, string const & type,
uint32_t featureType, m2::RectD const & featureRect,
double distanceFromCenter);
Result(string const & str, string const & suggestionStr);
// String that is displayed in the GUI.
char const * GetString() const { return m_str.c_str(); }
char const * GetRegionString() const { return m_region.c_str(); }
char const * GetRegionFlag() const { return m_flag.empty() ? 0 : m_flag.c_str(); }
char const * GetFeatureType() const { return m_type.c_str(); }
// Type of the result.
ResultType GetResultType() const;
// Rect of a feature, if GetResultType() == RESULT_FEATURE.
m2::RectD GetFeatureRect() const;
// Center point of a feature, if GetResultType() == RESULT_FEATURE.
m2::PointD GetFeatureCenter() const;
// Distance from the center of the screen, if GetResultType() == RESULT_FEATURE.
double GetDistanceFromCenter() const;
// String to write in the search box.
char const * GetSuggestionString() const;
bool operator== (Result const & r) const;
private:
string m_str, m_region, m_flag, m_type;
m2::RectD m_featureRect;
uint32_t m_featureType;
double m_distanceFromCenter;
string m_suggestionStr;
};
class Results
{
vector<Result> m_vec;
enum StatusT {
NONE, // default status
ENDED_CANCELLED, // search ended with canceling
ENDED // search ended itself
};
StatusT m_status;
explicit Results(bool isCancelled)
{
m_status = (isCancelled ? ENDED_CANCELLED : ENDED);
}
public:
Results() : m_status(NONE) {}
/// @name To implement end of search notification.
//@{
static Results GetEndMarker(bool isCancelled) { return Results(isCancelled); }
bool IsEndMarker() const { return (m_status != NONE); }
bool IsEndedNormal() const { return (m_status == ENDED); }
//@}
inline void AddResult(Result const & r) { m_vec.push_back(r); }
void AddResultCheckExisting(Result const & r);
inline void Clear() { m_vec.clear(); }
typedef vector<Result>::const_iterator IterT;
inline IterT Begin() const { return m_vec.begin(); }
inline IterT End() const { return m_vec.end(); }
inline size_t GetCount() const { return m_vec.size(); }
inline Result const & GetResult(size_t i) const
{
ASSERT_LESS(i, m_vec.size(), ());
return m_vec[i];
}
inline void Swap(Results & rhs)
{
m_vec.swap(rhs.m_vec);
}
template <class LessT> void Sort(LessT lessFn)
{
sort(m_vec.begin(), m_vec.end(), lessFn);
}
};
}
|
