Welcome to mirror list, hosted at ThFree Co, Russian Federation.

geometry_cache.hpp « search - github.com/mapsme/omim.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: b19a8efa956460468cfbb979eec5493f886e608c (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
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
#pragma once

#include "search/cbv.hpp"

#include "indexer/mwm_set.hpp"

#include "geometry/rect2d.hpp"

#include "base/assert.hpp"

#include <algorithm>
#include <cstdint>
#include <deque>
#include <map>
#include <memory>
#include <utility>

namespace base
{
class Cancellable;
};

namespace search
{
class MwmContext;

// This class represents a simple cache of features in rects for all mwms.
//
// *NOTE* This class is not thread-safe.
class GeometryCache
{
public:
  virtual ~GeometryCache() = default;

  // Returns (hopefully, cached) list of features in a given
  // rect. Note that return value may be invalidated on next calls to
  // this method.
  virtual CBV Get(MwmContext const & context, m2::RectD const & rect, int scale) = 0;

  inline void Clear() { m_entries.clear(); }

protected:
  struct Entry
  {
    m2::RectD m_rect;
    CBV m_cbv;
    int m_scale = 0;
  };

  // |maxNumEntries| denotes the maximum number of rectangles that
  // will be cached for each mwm individually.
  GeometryCache(size_t maxNumEntries, base::Cancellable const & cancellable);

  template <typename TPred>
  std::pair<Entry &, bool> FindOrCreateEntry(MwmSet::MwmId const & id, TPred && pred)
  {
    auto & entries = m_entries[id];
    auto it = find_if(entries.begin(), entries.end(), std::forward<TPred>(pred));
    if (it != entries.end())
    {
      if (it != entries.begin())
        iter_swap(entries.begin(), it);
      return std::pair<Entry &, bool>(entries.front(), false);
    }

    entries.emplace_front();
    if (entries.size() == m_maxNumEntries + 1)
      entries.pop_back();

    ASSERT_LESS_OR_EQUAL(entries.size(), m_maxNumEntries, ());
    ASSERT(!entries.empty(), ());
    return std::pair<Entry &, bool>(entries.front(), true);
  }

  void InitEntry(MwmContext const & context, m2::RectD const & rect, int scale, Entry & entry);

  std::map<MwmSet::MwmId, std::deque<Entry>> m_entries;
  size_t const m_maxNumEntries;
  base::Cancellable const & m_cancellable;
};

class PivotRectsCache : public GeometryCache
{
public:
  PivotRectsCache(size_t maxNumEntries, base::Cancellable const & cancellable,
                  double maxRadiusMeters);

  // GeometryCache overrides:
  CBV Get(MwmContext const & context, m2::RectD const & rect, int scale) override;

private:
  double const m_maxRadiusMeters;
};

class LocalityRectsCache : public GeometryCache
{
public:
  LocalityRectsCache(size_t maxNumEntries, base::Cancellable const & cancellable);

  // GeometryCache overrides:
  CBV Get(MwmContext const & context, m2::RectD const & rect, int scale) override;
};
}  // namespace search