(long key)
| 87 | } |
| 88 | |
| 89 | public boolean add(long key) { |
| 90 | if (key == 0) { |
| 91 | if (hasZeroKey) |
| 92 | return false; |
| 93 | hasZeroKey = true; |
| 94 | size++; |
| 95 | return true; |
| 96 | } |
| 97 | long[] kt = keyTable; |
| 98 | for (int i = hash(key), m = kt.length - 1; ; i = (i + 1) & m) { |
| 99 | long k = kt[i]; |
| 100 | if (k == 0) { |
| 101 | kt[i] = key; |
| 102 | if (++size >= threshold) |
| 103 | resize(kt.length << 1); |
| 104 | return true; |
| 105 | } |
| 106 | if (k == key) |
| 107 | return false; |
| 108 | } |
| 109 | } |
| 110 | |
| 111 | public void addAll(@NotNull LongHashSet set) { |
| 112 | if (set.hasZeroKey) |