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
|
#include "map/displayed_categories_modifiers.hpp"
#include "base/macros.hpp"
#include <algorithm>
#include <vector>
namespace
{
std::vector<std::string> const kSponsoredCategories = {};
search::DisplayedCategories::Keys::const_iterator FindInsertionPlace(
search::DisplayedCategories::Keys & keys, uint32_t position)
{
for (auto it = keys.cbegin(); it != keys.cend(); ++it)
{
if (position == 0)
return it;
// Do not count sponsored categories.
if (std::find(kSponsoredCategories.cbegin(), kSponsoredCategories.cend(), *it) ==
kSponsoredCategories.cend())
{
position--;
}
}
return keys.cend();
}
} // namespace
SponsoredCategoryModifier::SponsoredCategoryModifier(std::string const & currentCity,
SupportedCities const & supportedCities,
std::string const & categoryName,
uint32_t position)
: m_currentCity(currentCity)
, m_supportedCities(supportedCities)
, m_categoryName(categoryName)
, m_position(position)
{}
void SponsoredCategoryModifier::Modify(search::DisplayedCategories::Keys & keys)
{
auto const supported = m_supportedCities.find(m_currentCity) != m_supportedCities.cend();
auto const contains = std::find(keys.cbegin(), keys.cend(), m_categoryName) != keys.cend();
ASSERT_LESS(m_position, keys.size(), ());
if (supported && !contains)
keys.insert(FindInsertionPlace(keys, m_position), m_categoryName);
else if (!supported && contains)
keys.erase(std::remove(keys.begin(), keys.end(), m_categoryName), keys.end());
}
|
