private boolean testHash(long hash64) {
    int hash1 = (int) hash64;
    int hash2 = (int) (hash64 >>> 32);

    for (int i = 1; i <= numHashFunctions; i++) {
      int combinedHash = hash1 + ((i + 1) * hash2);
      // hashcode should be positive, flip all the bits if it's negative
      if (combinedHash < 0) {
        combinedHash = ~combinedHash;
      }
      int pos = combinedHash % numBits;
      if (!bitSet.get(pos)) {
        return false;
      }
    }
    return true;
  }
A constructor to support rebuilding the BloomFilter from a serialized representation.
@param bits - bits are used as such for bitset and are NOT copied, any changes to bits will affect bloom filter
@param numFuncs - number of hash functions
storage-api/src/java/org/apache/hive/common/util/BloomFilter.java