Method Insert

container/bloom_filter.cpp:192–209

}

void BloomFilter::Insert(const void *key, size_t len)
{
    uint32_t digest[4];
    for (size_t i = 0; i < m_num_hash_functions; ++i)
    {
        if (i % 4 == 0)
        {
            if (i != 0) // use original key at first time
                MurmurHash3_x86_128(digest, 16, i, digest);
            else
                MurmurHash3_x86_128(key, len, 0, digest);
        }

        uint32_t bit_index = m_divisor.Modulu(digest[i % 4]);
        assert(bit_index == digest[i % 4] % m_num_bits);
        m_bitmap[bit_index / CHAR_BIT] |= (1 << (bit_index % CHAR_BIT));
    }
}

bool BloomFilter::InsertUnique(const void *key, size_t len)
{