search/v2/features_filter.cpp


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

#include "search/v2/features_filter.hpp"

#include "coding/compressed_bit_vector.hpp"

#include "std/algorithm.hpp"

namespace search
{
namespace v2
{
// FeaturesFilter ----------------------------------------------------------------------------------
FeaturesFilter::FeaturesFilter(coding::CompressedBitVector const & filter, uint32_t threshold)
  : m_filter(filter), m_threshold(threshold)
{
}

bool FeaturesFilter::NeedToFilter(coding::CompressedBitVector const & cbv) const
{
  return cbv.PopCount() > m_threshold;
}

// LocalityFilter ----------------------------------------------------------------------------------
LocalityFilter::LocalityFilter(coding::CompressedBitVector const & filter)
  : FeaturesFilter(filter, 0 /* threshold */)
{
}

unique_ptr<coding::CompressedBitVector> LocalityFilter::Filter(
    coding::CompressedBitVector const & cbv) const
{
  return coding::CompressedBitVector::Intersect(m_filter, cbv);
}

// ViewportFilter ----------------------------------------------------------------------------------
ViewportFilter::ViewportFilter(coding::CompressedBitVector const & filter, uint32_t threshold)
  : FeaturesFilter(filter, threshold)
{
}

unique_ptr<coding::CompressedBitVector> ViewportFilter::Filter(
    coding::CompressedBitVector const & cbv) const
{
  auto result = coding::CompressedBitVector::Intersect(m_filter, cbv);
  if (!coding::CompressedBitVector::IsEmpty(result))
    return result;
  return cbv.LeaveFirstSetNBits(m_threshold);
}
}  // namespace v2
}  // namespace search