(long key)
| 36 | } |
| 37 | |
| 38 | public void add(long key) { |
| 39 | long hash = Hash.hash64(key, seed); |
| 40 | long a = (hash >>> 32) | (hash << 32); |
| 41 | long b = hash; |
| 42 | for (int i = 0; i < k; i++) { |
| 43 | data[Hash.reduce((int) (a >>> 32), arraySize)] |= 1L << a; |
| 44 | a += b; |
| 45 | } |
| 46 | } |
| 47 | |
| 48 | public boolean mayContain(long key) { |
| 49 | long hash = Hash.hash64(key, seed); |