@Override public void accept(short k, int v) { map.put(k, v); } });
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMap( Map<Short, Integer> map) { if (map instanceof ShortIntMap) { if (map instanceof SeparateKVShortIntLHash) { SeparateKVShortIntLHash hash = (SeparateKVShortIntLHash) map; if (hash.hashConfig().equals(hashConf)) { UpdatableLHashSeparateKVShortIntMapGO res = uninitializedUpdatableMap(); res.copy(hash); return res; } } UpdatableLHashSeparateKVShortIntMapGO res = newUpdatableMap(map.size()); res.putAll(map); return res; } UpdatableLHashSeparateKVShortIntMapGO res = newUpdatableMap(map.size()); for (Map.Entry<Short, Integer> entry : map.entrySet()) { res.put(entry.getKey(), entry.getValue()); } return res; } }
@Override public void accept(short k, int v) { map.put(k, v); } });
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMap( Map<Short, Integer> map) { if (map instanceof ShortIntMap) { if (map instanceof SeparateKVShortIntLHash) { SeparateKVShortIntLHash hash = (SeparateKVShortIntLHash) map; if (hash.hashConfig().equals(hashConf)) { UpdatableLHashSeparateKVShortIntMapGO res = uninitializedUpdatableMap(); res.copy(hash); return res; } } UpdatableLHashSeparateKVShortIntMapGO res = newUpdatableMap(map.size()); res.putAll(map); return res; } UpdatableLHashSeparateKVShortIntMapGO res = newUpdatableMap(map.size()); for (Map.Entry<Short, Integer> entry : map.entrySet()) { res.put(entry.getKey(), entry.getValue()); } return res; } }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMapOf( short k1, int v1, short k2, int v2, short k3, int v3, short k4, int v4, short k5, int v5) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(5); map.put(k1, v1); map.put(k2, v2); map.put(k3, v3); map.put(k4, v4); map.put(k5, v5); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMapOf( short k1, int v1, short k2, int v2, short k3, int v3, short k4, int v4) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(4); map.put(k1, v1); map.put(k2, v2); map.put(k3, v3); map.put(k4, v4); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMapOf( short k1, int v1, short k2, int v2, short k3, int v3, short k4, int v4) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(4); map.put(k1, v1); map.put(k2, v2); map.put(k3, v3); map.put(k4, v4); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMapOf( short k1, int v1, short k2, int v2, short k3, int v3, short k4, int v4, short k5, int v5) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(5); map.put(k1, v1); map.put(k2, v2); map.put(k3, v3); map.put(k4, v4); map.put(k5, v5); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMapOf( short k1, int v1) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(1); map.put(k1, v1); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMapOf( short k1, int v1) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(1); map.put(k1, v1); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMap( short[] keys, int[] values, int expectedSize) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(expectedSize); int keysLen = keys.length; if (keysLen != values.length) throw new IllegalArgumentException("keys and values arrays must have the same size"); for (int i = 0; i < keys.length; i++) { map.put(keys[i], values[i]); } return shrunk(map); }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMap( short[] keys, int[] values, int expectedSize) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(expectedSize); int keysLen = keys.length; if (keysLen != values.length) throw new IllegalArgumentException("keys and values arrays must have the same size"); for (int i = 0; i < keys.length; i++) { map.put(keys[i], values[i]); } return shrunk(map); }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMap( Iterable<Short> keys, Iterable<Integer> values, int expectedSize) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(expectedSize); Iterator<Short> keysIt = keys.iterator(); Iterator<Integer> valuesIt = values.iterator(); try { while (keysIt.hasNext()) { map.put(keysIt.next(), valuesIt.next()); } return shrunk(map); } catch (NoSuchElementException e) { throw new IllegalArgumentException( "keys and values iterables must have the same size", e); } }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMap( Short[] keys, Integer[] values, int expectedSize) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(expectedSize); int keysLen = keys.length; if (keysLen != values.length) throw new IllegalArgumentException("keys and values arrays must have the same size"); for (int i = 0; i < keys.length; i++) { map.put(keys[i], values[i]); } return shrunk(map); }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMap( Short[] keys, Integer[] values, int expectedSize) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(expectedSize); int keysLen = keys.length; if (keysLen != values.length) throw new IllegalArgumentException("keys and values arrays must have the same size"); for (int i = 0; i < keys.length; i++) { map.put(keys[i], values[i]); } return shrunk(map); }
@Override @Nonnull public UpdatableLHashSeparateKVShortIntMapGO newUpdatableMap( Iterable<Short> keys, Iterable<Integer> values, int expectedSize) { UpdatableLHashSeparateKVShortIntMapGO map = newUpdatableMap(expectedSize); Iterator<Short> keysIt = keys.iterator(); Iterator<Integer> valuesIt = values.iterator(); try { while (keysIt.hasNext()) { map.put(keysIt.next(), valuesIt.next()); } return shrunk(map); } catch (NoSuchElementException e) { throw new IllegalArgumentException( "keys and values iterables must have the same size", e); } }