algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-07 01:35:16 +08:00
Code Issues Packages Projects Releases Wiki Activity

Reduce memory usage of bloom filter (#3115)

Browse Source
This commit is contained in:
Artem Boiarshinov
2022-06-10 20:44:23 +03:00
committed by GitHub
parent ba3c0319ed
commit ec1ab53eea
1 changed files with 8 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/main/java/com/thealgorithms/datastructures/bloomfilter/BloomFilter.java
View File

@ -1,16 +1,18 @@
package com.thealgorithms.datastructures.bloomfilter; package com.thealgorithms.datastructures.bloomfilter;
import java.util.BitSet;
public class BloomFilter<T> { public class BloomFilter<T> {
private int numberOfHashFunctions; private int numberOfHashFunctions;
private int [] bitArray; private BitSet bitArray;
private Hash<T>[] hashFunctions; private Hash<T>[] hashFunctions;
public BloomFilter(int numberOfHashFunctions, int n) { public BloomFilter(int numberOfHashFunctions, int n) {
this.numberOfHashFunctions = numberOfHashFunctions; this.numberOfHashFunctions = numberOfHashFunctions;
hashFunctions = new Hash[numberOfHashFunctions]; hashFunctions = new Hash[numberOfHashFunctions];
bitArray = new int[n]; bitArray = new BitSet(n);
insertHash(); insertHash();
} }
@ -22,13 +24,15 @@ public class BloomFilter<T> {
public void insert(T key) { public void insert(T key) {
for (Hash<T> hash : hashFunctions){ for (Hash<T> hash : hashFunctions){
bitArray[hash.compute(key) % bitArray.length] = 1; int position = hash.compute(key) % bitArray.size();
bitArray.set(position);
} }
} }
public boolean contains(T key) { public boolean contains(T key) {
for (Hash<T> hash : hashFunctions){ for (Hash<T> hash : hashFunctions){
if (bitArray[hash.compute(key) % bitArray.length] == 0){ int position = hash.compute(key) % bitArray.size();
if (!bitArray.get(position)) {
return false; return false;
} }
} }