public IFilter sharedCopy() { return new BloomFilter(this); }
public IFilter sharedCopy() { return new BloomFilter(this); }
public IFilter sharedCopy() { return new BloomFilter(this); }
public IFilter sharedCopy() { return new BloomFilter(this); }
@SuppressWarnings("resource") public static BloomFilter deserialize(DataInput in, boolean offheap, boolean oldBfHashOrder) throws IOException { int hashes = in.readInt(); IBitSet bs = offheap ? OffHeapBitSet.deserialize(in) : OpenBitSet.deserialize(in); return new BloomFilter(hashes, bs, oldBfHashOrder); }
@SuppressWarnings("resource") public static BloomFilter deserialize(DataInput in, boolean offheap, boolean oldBfHashOrder) throws IOException { int hashes = in.readInt(); IBitSet bs = offheap ? OffHeapBitSet.deserialize(in) : OpenBitSet.deserialize(in); return new BloomFilter(hashes, bs, oldBfHashOrder); }
@SuppressWarnings("resource") public static BloomFilter deserialize(DataInput in, boolean offheap, boolean oldBfHashOrder) throws IOException { int hashes = in.readInt(); IBitSet bs = offheap ? OffHeapBitSet.deserialize(in) : OpenBitSet.deserialize(in); return new BloomFilter(hashes, bs, oldBfHashOrder); }
@SuppressWarnings("resource") public static BloomFilter deserialize(DataInput in, boolean offheap, boolean oldBfHashOrder) throws IOException { int hashes = in.readInt(); IBitSet bs = offheap ? OffHeapBitSet.deserialize(in) : OpenBitSet.deserialize(in); return new BloomFilter(hashes, bs, oldBfHashOrder); }
@SuppressWarnings("resource") private static IFilter createFilter(int hash, long numElements, int bucketsPer, boolean offheap, boolean oldBfHashOrder) { long numBits = (numElements * bucketsPer) + BITSET_EXCESS; IBitSet bitset = offheap ? new OffHeapBitSet(numBits) : new OpenBitSet(numBits); return new BloomFilter(hash, bitset, oldBfHashOrder); } }
@SuppressWarnings("resource") private static IFilter createFilter(int hash, long numElements, int bucketsPer, boolean offheap, boolean oldBfHashOrder) { long numBits = (numElements * bucketsPer) + BITSET_EXCESS; IBitSet bitset = offheap ? new OffHeapBitSet(numBits) : new OpenBitSet(numBits); return new BloomFilter(hash, bitset, oldBfHashOrder); } }
@SuppressWarnings("resource") private static IFilter createFilter(int hash, long numElements, int bucketsPer, boolean offheap, boolean oldBfHashOrder) { long numBits = (numElements * bucketsPer) + BITSET_EXCESS; IBitSet bitset = offheap ? new OffHeapBitSet(numBits) : new OpenBitSet(numBits); return new BloomFilter(hash, bitset, oldBfHashOrder); } }
@SuppressWarnings("resource") private static IFilter createFilter(int hash, long numElements, int bucketsPer, boolean offheap, boolean oldBfHashOrder) { long numBits = (numElements * bucketsPer) + BITSET_EXCESS; IBitSet bitset = offheap ? new OffHeapBitSet(numBits) : new OpenBitSet(numBits); return new BloomFilter(hash, bitset, oldBfHashOrder); } }