The bloom filter hashes the entries with MD5 and treats the resulting 128-bit
hash as 2 distinct 64-bit hash values, interpreted as unsigned integers
using 2's complement encoding.
These two hash values, named h1 and h2, are then used to compute the
hash_count hash values using the formula, starting at i=0:
h(i) = h1 + (i * h2)
These resulting values are then taken modulo the number of bits in the bloom
filter to get the bits of the bloom filter to test for the given entry.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-08-07 UTC."],[[["\u003cp\u003eThe \u003ccode\u003eBloomFilter\u003c/code\u003e class in the Google Cloud Firestore v1 API provides a space-efficient probabilistic data structure for testing whether an element is a member of a set.\u003c/p\u003e\n"],["\u003cp\u003eThis class implements several interfaces, including \u003ccode\u003eIMessage\u003c/code\u003e, \u003ccode\u003eIEquatable\u003c/code\u003e, \u003ccode\u003eIDeepCloneable\u003c/code\u003e, and \u003ccode\u003eIBufferMessage\u003c/code\u003e, offering functionalities such as deep cloning and efficient message handling.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eBloomFilter\u003c/code\u003e can be constructed either with default values using \u003ccode\u003eBloomFilter()\u003c/code\u003e or by cloning an existing \u003ccode\u003eBloomFilter\u003c/code\u003e instance using \u003ccode\u003eBloomFilter(BloomFilter other)\u003c/code\u003e.\u003c/p\u003e\n"],["\u003cp\u003eThe class utilizes two key properties: \u003ccode\u003eBits\u003c/code\u003e, which represents the actual bloom filter data as a \u003ccode\u003eBitSequence\u003c/code\u003e, and \u003ccode\u003eHashCount\u003c/code\u003e, an integer that defines the number of hashes used in the algorithm.\u003c/p\u003e\n"],["\u003cp\u003eThe most recent version of the BloomFilter is \u003ccode\u003e3.10.0\u003c/code\u003e in the document, and it goes back to version \u003ccode\u003e2.3.0\u003c/code\u003e.\u003c/p\u003e\n"]]],[],null,[]]
