public boolean contains(byte[] bytes){
  int[] hashes=createHashes(bytes,k,getNewDigestFunction());
  for (  int hash : hashes) {
    if (!bitset.get(Math.abs(hash % bitSetSize))) {
      return false;
    }
  }
  return true;
}

public boolean contains ( byte [ ] bytes ) { int [ ] hashes = createHashes ( bytes , k , getNewDigestFunction ( ) ) ; for ( int hash : hashes ) { if ( ! bitset . get ( Math . abs ( hash % bitSetSize ) ) ) { return false ; } } return true ; }
returns true if the array of bytes could have been inserted into the bloom filter . use getfalsepositiveprobability ( ) to calculate the probability of this being correct .
