(long key)
| 46 | } |
| 47 | |
| 48 | public boolean mayContain(long key) { |
| 49 | long hash = Hash.hash64(key, seed); |
| 50 | long a = (hash >>> 32) | (hash << 32); |
| 51 | long b = hash; |
| 52 | for (int i = 0; i < k; i++) { |
| 53 | if ((data[Hash.reduce((int) (a >>> 32), arraySize)] & 1L << a) == 0) { |
| 54 | return false; |
| 55 | } |
| 56 | a += b; |
| 57 | } |
| 58 | return true; |
| 59 | } |
| 60 | |
| 61 | public byte[][] getData() { |
| 62 | byte[][] d = new byte[data.length][]; |