5 #include <blockfilter.h>
18 #include <unordered_set>
23 uint64_t HashToRange(
const std::vector<uint8_t>& element,
const uint64_t f)
25 const uint64_t hash =
CSipHasher(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL)
26 .
Write(element.data(), element.size())
31 std::vector<uint64_t> BuildHashedSet(
const std::unordered_set<std::vector<uint8_t>,
ByteVectorHash>& elements,
const uint64_t f)
33 std::vector<uint64_t> hashed_elements;
34 hashed_elements.reserve(elements.size());
35 for (
const std::vector<uint8_t>& element : elements) {
36 hashed_elements.push_back(HashToRange(element, f));
38 std::sort(hashed_elements.begin(), hashed_elements.end());
39 return hashed_elements;
46 std::vector<uint8_t> golomb_rice_data;
47 std::vector<uint64_t> encoded_deltas;
51 for (
int i = 0; i < n; ++i) {
57 if (!elements.empty()) {
58 uint64_t last_value = 0;
59 for (
const uint64_t value : BuildHashedSet(elements,
static_cast<uint64_t
>(elements.size()) *
static_cast<uint64_t
>(
BASIC_FILTER_M))) {
60 const uint64_t delta = value - last_value;
61 encoded_deltas.push_back(delta);
69 std::vector<uint64_t> decoded_deltas;
74 for (uint32_t i = 0; i < n; ++i) {
79 assert(encoded_deltas == decoded_deltas);
87 }
catch (
const std::ios_base::failure&) {
91 for (uint32_t i = 0; i < std::min<uint32_t>(n, 1024); ++i) {
94 }
catch (
const std::ios_base::failure&) {