Bloom大数据查询

package modules.Bloom;
import api.IService;
import java.util.BitSet;

public class Main implements IService {
private static final int SIZE = 1<<24;
BitSet bitSet=new BitSet(SIZE);
Hash[] hashs=new Hash[8];
private static final int seeds[]=new int[]{3,5,7,9,11,13,17,19};
@Override
public void process() {
System.out.println(bitSet);
for (int i = 0; i < seeds.length; i++) {
hashs[i]=new Hash(seeds[i],SIZE);
}

    String email="zhenlingcn@126.com";
    System.out.println(email+"是否在列表中: "+ contains(email));
    add(email);
    System.out.println(email+"是否在列表中: "+ contains(email));
    email="zhenlingcn@163.com";
    System.out.println(email+"是否在列表中: "+ contains(email));
    bitSet.set(1,true);
    bitSet.set(2,true);
    bitSet.set(100,true);
    System.out.println(SIZE);
    System.out.println(bitSet);
    System.out.println(bitSet.size());
}

public void add(String string){
    for(Hash hash:hashs){
        bitSet.set(hash.getHash(string),true);
    }
}

public boolean contains(String string){
    boolean have=true;
    for(Hash hash:hashs){
        have&=bitSet.get(hash.getHash(string));
    }
    return have;
}

}

package modules.Bloom;

public class Hash {
private int seed = 0;
private int size = 0;
public Hash(int seed, int size){
this.seed=seed;
this.size = size;
}
public int getHash(String string){
int val=0;
int len=string.length();
for (int i = 0; i < len; i++) {
val=val*seed + string.charAt(i);
}
return val&(size-1);
}
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值