1 files changed, 107 insertions, 0 deletions
diff --git a/search/geometry_cache.hpp b/search/geometry_cache.hpp
new file mode 100644
index 0000000000..d5d305301b
--- /dev/null
+++ b/search/geometry_cache.hpp
@@ -0,0 +1,107 @@
+#pragma once
+
+#include "indexer/mwm_set.hpp"
+
+#include "coding/compressed_bit_vector.hpp"
+
+#include "geometry/rect2d.hpp"
+
+#include "base/assert.hpp"
+
+#include "std/algorithm.hpp"
+#include "std/cstdint.hpp"
+#include "std/deque.hpp"
+#include "std/map.hpp"
+#include "std/unique_ptr.hpp"
+#include "std/utility.hpp"
+
+namespace my
+{
+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 coding::CompressedBitVector const * Get(MwmContext const & context,
+                                                  m2::RectD const & rect, int scale) = 0;
+
+  inline void Clear() { m_entries.clear(); }
+
+protected:
+  struct Entry
+  {
+    m2::RectD m_rect;
+    unique_ptr<coding::CompressedBitVector> 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, my::Cancellable const & cancellable);
+
+  template <typename TPred>
+  pair<Entry &, bool> FindOrCreateEntry(MwmSet::MwmId const & id, TPred && pred)
+  {
+    auto & entries = m_entries[id];
+    auto it = find_if(entries.begin(), entries.end(), forward<TPred>(pred));
+    if (it != entries.end())
+    {
+      if (it != entries.begin())
+        iter_swap(entries.begin(), it);
+      return 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 pair<Entry &, bool>(entries.front(), true);
+  }
+
+  void InitEntry(MwmContext const & context, m2::RectD const & rect, int scale, Entry & entry);
+
+  map<MwmSet::MwmId, deque<Entry>> m_entries;
+  size_t const m_maxNumEntries;
+  my::Cancellable const & m_cancellable;
+};
+
+class PivotRectsCache : public GeometryCache
+{
+public:
+  PivotRectsCache(size_t maxNumEntries, my::Cancellable const & cancellable,
+                  double maxRadiusMeters);
+
+  // GeometryCache overrides:
+  coding::CompressedBitVector const * 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, my::Cancellable const & cancellable);
+
+  // GeometryCache overrides:
+  coding::CompressedBitVector const * Get(MwmContext const & context, m2::RectD const & rect,
+                                          int scale) override;
+};
+
+}  // namespace search