@Override public void clear() { UpdatableQHashParallelKVCharShortMapGO.this.clear(); } }
@Override @SuppressWarnings("unchecked") public boolean contains(Object o) { try { Map.Entry<Character, Short> e = (Map.Entry<Character, Short>) o; return containsEntry(e.getKey(), e.getValue()); } catch (NullPointerException e) { return false; } catch (ClassCastException e) { return false; } }
@Override public boolean contains(short v) { return UpdatableQHashParallelKVCharShortMapGO.this.containsValue(v); }
char free; if (k == (free = freeValue)) { free = changeFree(); if ((cur = (char) (entry = tab[index = ParallelKVCharKeyMixing.mix(k) % (capacity = tab.length)])) == free) { incrementModCount(); tab[index] = (((int) k) | (((int) value) << 16)); postInsertHook(); return null; } else { if ((cur = (char) (entry = tab[bIndex])) == free) { incrementModCount(); tab[bIndex] = (((int) k) | (((int) value) << 16)); postInsertHook(); return null; } else if (cur == k) { if ((cur = (char) (entry = tab[fIndex])) == free) { incrementModCount(); tab[fIndex] = (((int) k) | (((int) value) << 16)); postInsertHook(); return null; } else if (cur == k) {
char free; if (key == (free = freeValue)) { free = changeFree(); if ((cur = (char) (entry = tab[index = ParallelKVCharKeyMixing.mix(key) % (capacity = tab.length)])) == free) { incrementModCount(); tab[index] = (((int) key) | (((int) value) << 16)); postInsertHook(); return defaultValue(); } else { if (cur == key) { if ((cur = (char) (entry = tab[bIndex])) == free) { incrementModCount(); tab[bIndex] = (((int) key) | (((int) value) << 16)); postInsertHook(); return defaultValue(); } else if (cur == key) { if ((cur = (char) (entry = tab[fIndex])) == free) { incrementModCount(); tab[fIndex] = (((int) key) | (((int) value) << 16)); postInsertHook(); return defaultValue(); } else if (cur == key) {
@Override @Nonnull public UpdatableQHashParallelKVCharShortMapGO newUpdatableMap( Map<Character, Short> map) { if (map instanceof CharShortMap) { if (map instanceof ParallelKVCharShortQHash) { ParallelKVCharShortQHash hash = (ParallelKVCharShortQHash) map; if (hash.hashConfig().equals(hashConf)) { UpdatableQHashParallelKVCharShortMapGO res = uninitializedUpdatableMap(); res.copy(hash); return res; } } UpdatableQHashParallelKVCharShortMapGO res = newUpdatableMap(map.size()); res.putAll(map); return res; } UpdatableQHashParallelKVCharShortMapGO res = newUpdatableMap(map.size()); for (Map.Entry<Character, Short> entry : map.entrySet()) { res.put(entry.getKey(), entry.getValue()); } return res; } }
if (cur == free) { return defaultValue(); } else { int bIndex = index, fIndex = index, step = 1; } else if (cur == free) { return defaultValue(); } else if (cur == free) { return defaultValue(); return defaultValue();
@Nonnull @Override public HashConfig hashConfig() { return UpdatableQHashParallelKVCharShortMapGO.this.hashConfig(); }
@Override public double currentLoad() { return UpdatableQHashParallelKVCharShortMapGO.this.currentLoad(); }
public int hashCode() { return UpdatableQHashParallelKVCharShortMapGO.this.hashCode(); }
char free; if (k == (free = freeValue)) { free = changeFree(); if ((cur = (char) (entry = tab[index = ParallelKVCharKeyMixing.mix(k) % (capacity = tab.length)])) == free) { incrementModCount(); tab[index] = (((int) k) | (((int) value) << 16)); postInsertHook(); return null; } else { if ((cur = (char) (entry = tab[bIndex])) == free) { incrementModCount(); tab[bIndex] = (((int) k) | (((int) value) << 16)); postInsertHook(); return null; } else if (cur == k) { if ((cur = (char) (entry = tab[fIndex])) == free) { incrementModCount(); tab[fIndex] = (((int) k) | (((int) value) << 16)); postInsertHook(); return null; } else if (cur == k) {
char free; if (key == (free = freeValue)) { free = changeFree(); if ((cur = (char) (entry = tab[index = ParallelKVCharKeyMixing.mix(key) % (capacity = tab.length)])) == free) { incrementModCount(); tab[index] = (((int) key) | (((int) value) << 16)); postInsertHook(); return defaultValue(); } else { if (cur == key) { if ((cur = (char) (entry = tab[bIndex])) == free) { incrementModCount(); tab[bIndex] = (((int) key) | (((int) value) << 16)); postInsertHook(); return defaultValue(); } else if (cur == key) { if ((cur = (char) (entry = tab[fIndex])) == free) { incrementModCount(); tab[fIndex] = (((int) key) | (((int) value) << 16)); postInsertHook(); return defaultValue(); } else if (cur == key) {
@Override @Nonnull public UpdatableQHashParallelKVCharShortMapGO newUpdatableMap( Map<Character, Short> map) { if (map instanceof CharShortMap) { if (map instanceof ParallelKVCharShortQHash) { ParallelKVCharShortQHash hash = (ParallelKVCharShortQHash) map; if (hash.hashConfig().equals(hashConf)) { UpdatableQHashParallelKVCharShortMapGO res = uninitializedUpdatableMap(); res.copy(hash); return res; } } UpdatableQHashParallelKVCharShortMapGO res = newUpdatableMap(map.size()); res.putAll(map); return res; } UpdatableQHashParallelKVCharShortMapGO res = newUpdatableMap(map.size()); for (Map.Entry<Character, Short> entry : map.entrySet()) { res.put(entry.getKey(), entry.getValue()); } return res; } }
if (cur == free) { return defaultValue(); } else { int bIndex = index, fIndex = index, step = 1; } else if (cur == free) { return defaultValue(); } else if (cur == free) { return defaultValue(); return defaultValue();
@Nonnull @Override public HashConfig hashConfig() { return UpdatableQHashParallelKVCharShortMapGO.this.hashConfig(); }
@Override public double currentLoad() { return UpdatableQHashParallelKVCharShortMapGO.this.currentLoad(); }
public int hashCode() { return UpdatableQHashParallelKVCharShortMapGO.this.hashCode(); }
char free; if (key == (free = freeValue)) { free = changeFree(); if ((cur = (char) (entry = tab[index = ParallelKVCharKeyMixing.mix(key) % (capacity = tab.length)])) == free) { incrementModCount(); tab[index] = (((int) key) | (((int) value) << 16)); postInsertHook(); return value; } else { if ((cur = (char) (entry = tab[bIndex])) == free) { incrementModCount(); tab[bIndex] = (((int) key) | (((int) value) << 16)); postInsertHook(); return value; } else if (cur == key) { if ((cur = (char) (entry = tab[fIndex])) == free) { incrementModCount(); tab[fIndex] = (((int) key) | (((int) value) << 16)); postInsertHook(); return value; } else if (cur == key) {
char free; if (key == (free = freeValue)) { free = changeFree(); if ((cur = (char) (entry = tab[index = ParallelKVCharKeyMixing.mix(key) % (capacity = tab.length)])) == free) { incrementModCount(); tab[index] = (((int) key) | (((int) value) << 16)); postInsertHook(); return defaultValue(); } else { keyPresent: if ((cur = (char) (entry = tab[bIndex])) == free) { incrementModCount(); tab[bIndex] = (((int) key) | (((int) value) << 16)); postInsertHook(); return defaultValue(); } else if (cur == key) { index = bIndex; incrementModCount(); tab[fIndex] = (((int) key) | (((int) value) << 16)); postInsertHook(); return defaultValue(); } else if (cur == key) { index = fIndex;
if (cur == free) { return defaultValue(); } else { int bIndex = index, fIndex = index, step = 1; } else if (cur == free) { return defaultValue(); } else if (cur == free) { return defaultValue(); } else { return defaultValue();