public HiveBloomFilter(List<Long> bits, int numBits, int numHashFunctions) { this.bitSet = new BitSet(Longs.toArray(bits)); this.numBits = numBits; this.numHashFunctions = numHashFunctions; }
/** * Initializes the BloomFilter from the given Orc BloomFilter */ public BloomFilterIO(OrcProto.BloomFilter bloomFilter) { this.bitSet = new BitSet(Longs.toArray(bloomFilter.getBitsetList())); this.numHashFunctions = bloomFilter.getNumHashFunctions(); this.numBits = (int) this.bitSet.bitSize(); } }
/** * Initializes the BloomFilter from the given Orc BloomFilter */ public BloomFilterIO(OrcProto.BloomFilter bloomFilter) { this.bitSet = new BitSet(Longs.toArray(bloomFilter.getBitsetList())); this.numHashFunctions = bloomFilter.getNumHashFunctions(); this.numBits = (int) this.bitSet.bitSize(); } }
/** * 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 */ public BloomFilter(long[] bits, int numFuncs) { super(); // input long[] is set as such without copying, so any modification to the source will affect bloom filter this.bitSet = new BitSet(bits); this.numBits = bits.length * Long.SIZE; this.numHashFunctions = numFuncs; }
public HiveBloomFilter(List<Long> bits, int numBits, int numHashFunctions) { this.bitSet = new BitSet(Longs.toArray(bits)); this.numBits = numBits; this.numHashFunctions = numHashFunctions; }
public HiveBloomFilter(BloomFilter bloomFilter) { this.bitSet = new BitSet(bloomFilter.getBitSet().clone()); this.numBits = bloomFilter.getBitSize(); this.numHashFunctions = bloomFilter.getNumHashFunctions(); }
public HiveBloomFilter(BloomFilter bloomFilter) { this.bitSet = new BitSet(bloomFilter.getBitSet().clone()); this.numBits = bloomFilter.getBitSize(); this.numHashFunctions = bloomFilter.getNumHashFunctions(); }
public HiveBloomFilter(List<Long> bits, int numBits, int numHashFunctions) { this.bitSet = new BitSet(Longs.toArray(bits)); this.numBits = numBits; this.numHashFunctions = numHashFunctions; }
public HiveBloomFilter(BloomFilter bloomFilter) { this.bitSet = new BitSet(bloomFilter.getBitSet().clone()); this.numBits = bloomFilter.getBitSize(); this.numHashFunctions = bloomFilter.getNumHashFunctions(); }
public BloomFilter(long expectedEntries, double fpp) { checkArgument(expectedEntries > 0, "expectedEntries should be > 0"); checkArgument(fpp > 0.0 && fpp < 1.0, "False positive probability should be > 0.0 & < 1.0"); int nb = optimalNumOfBits(expectedEntries, fpp); // make 'm' multiple of 64 this.numBits = nb + (Long.SIZE - (nb % Long.SIZE)); this.numHashFunctions = optimalNumOfHashFunctions(expectedEntries, numBits); this.bitSet = new BitSet(numBits); }
public BloomFilter(long expectedEntries, double fpp) { checkArgument(expectedEntries > 0, "expectedEntries should be > 0"); checkArgument(fpp > 0.0 && fpp < 1.0, "False positive probability should be > 0.0 & < 1.0"); int nb = optimalNumOfBits(expectedEntries, fpp); // make 'm' multiple of 64 this.numBits = nb + (Long.SIZE - (nb % Long.SIZE)); this.numHashFunctions = optimalNumOfHashFunctions(expectedEntries, numBits); this.bitSet = new BitSet(numBits); }
/** * 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 */ public BloomFilter(long[] bits, int numFuncs) { super(); // input long[] is set as such without copying, so any modification to the source will affect bloom filter this.bitSet = new BitSet(bits); this.numBits = bits.length * Long.SIZE; this.numHashFunctions = numFuncs; }
public BloomFilter(long expectedEntries, double fpp) { checkArgument(expectedEntries > 0, "expectedEntries should be > 0"); checkArgument(fpp > 0.0 && fpp < 1.0, "False positive probability should be > 0.0 & < 1.0"); int nb = optimalNumOfBits(expectedEntries, fpp); // make 'm' multiple of 64 this.numBits = nb + (Long.SIZE - (nb % Long.SIZE)); this.numHashFunctions = optimalNumOfHashFunctions(expectedEntries, numBits); this.bitSet = new BitSet(numBits); }
public HiveBloomFilter(BloomFilter bloomFilter) { this.bitSet = new BitSet(bloomFilter.getBitSet().clone()); this.numBits = bloomFilter.getBitSize(); this.numHashFunctions = bloomFilter.getNumHashFunctions(); }
public HiveBloomFilter(List<Long> bits, int numBits, int numHashFunctions) { this.bitSet = new BitSet(Longs.toArray(bits)); this.numBits = numBits; this.numHashFunctions = numHashFunctions; }