@Override public void accept(short k, long v) { map.put(k, v); } });
@Override @Nonnull public UpdatableLHashSeparateKVShortLongMapGO newUpdatableMap( Map<Short, Long> map) { if (map instanceof ShortLongMap) { if (map instanceof SeparateKVShortLongLHash) { SeparateKVShortLongLHash hash = (SeparateKVShortLongLHash) map; if (hash.hashConfig().equals(hashConf)) { UpdatableLHashSeparateKVShortLongMapGO res = uninitializedUpdatableMap(); res.copy(hash); return res; } } UpdatableLHashSeparateKVShortLongMapGO res = newUpdatableMap(map.size()); res.putAll(map); return res; } UpdatableLHashSeparateKVShortLongMapGO res = newUpdatableMap(map.size()); for (Map.Entry<Short, Long> entry : map.entrySet()) { res.put(entry.getKey(), entry.getValue()); } return res; } }
@Override public void accept(short k, long v) { map.put(k, v); } });
@Override @Nonnull public UpdatableLHashSeparateKVShortLongMapGO newUpdatableMap( Map<Short, Long> map) { if (map instanceof ShortLongMap) { if (map instanceof SeparateKVShortLongLHash) { SeparateKVShortLongLHash hash = (SeparateKVShortLongLHash) map; if (hash.hashConfig().equals(hashConf)) { UpdatableLHashSeparateKVShortLongMapGO res = uninitializedUpdatableMap(); res.copy(hash); return res; } } UpdatableLHashSeparateKVShortLongMapGO res = newUpdatableMap(map.size()); res.putAll(map); return res; } UpdatableLHashSeparateKVShortLongMapGO res = newUpdatableMap(map.size()); for (Map.Entry<Short, Long> entry : map.entrySet()) { res.put(entry.getKey(), entry.getValue()); } return res; } }
@Override @Nonnull public UpdatableLHashSeparateKVShortLongMapGO newUpdatableMapOf( short k1, long v1, short k2, long v2, short k3, long v3, short k4, long v4) { UpdatableLHashSeparateKVShortLongMapGO map = newUpdatableMap(4); map.put(k1, v1); map.put(k2, v2); map.put(k3, v3); map.put(k4, v4); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortLongMapGO newUpdatableMapOf( short k1, long v1, short k2, long v2, short k3, long v3, short k4, long v4) { UpdatableLHashSeparateKVShortLongMapGO map = newUpdatableMap(4); map.put(k1, v1); map.put(k2, v2); map.put(k3, v3); map.put(k4, v4); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortLongMapGO newUpdatableMapOf( short k1, long v1, short k2, long v2, short k3, long v3, short k4, long v4, short k5, long v5) { UpdatableLHashSeparateKVShortLongMapGO 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 UpdatableLHashSeparateKVShortLongMapGO newUpdatableMapOf( short k1, long v1, short k2, long v2, short k3, long v3, short k4, long v4, short k5, long v5) { UpdatableLHashSeparateKVShortLongMapGO 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 UpdatableLHashSeparateKVShortLongMapGO newUpdatableMapOf( short k1, long v1) { UpdatableLHashSeparateKVShortLongMapGO map = newUpdatableMap(1); map.put(k1, v1); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortLongMapGO newUpdatableMapOf( short k1, long v1) { UpdatableLHashSeparateKVShortLongMapGO map = newUpdatableMap(1); map.put(k1, v1); return map; }
@Override @Nonnull public UpdatableLHashSeparateKVShortLongMapGO newUpdatableMap( Short[] keys, Long[] values, int expectedSize) { UpdatableLHashSeparateKVShortLongMapGO 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 UpdatableLHashSeparateKVShortLongMapGO newUpdatableMap( short[] keys, long[] values, int expectedSize) { UpdatableLHashSeparateKVShortLongMapGO 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 UpdatableLHashSeparateKVShortLongMapGO newUpdatableMap( short[] keys, long[] values, int expectedSize) { UpdatableLHashSeparateKVShortLongMapGO 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 UpdatableLHashSeparateKVShortLongMapGO newUpdatableMap( Short[] keys, Long[] values, int expectedSize) { UpdatableLHashSeparateKVShortLongMapGO 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 UpdatableLHashSeparateKVShortLongMapGO newUpdatableMap( Iterable<Short> keys, Iterable<Long> values, int expectedSize) { UpdatableLHashSeparateKVShortLongMapGO map = newUpdatableMap(expectedSize); Iterator<Short> keysIt = keys.iterator(); Iterator<Long> 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 UpdatableLHashSeparateKVShortLongMapGO newUpdatableMap( Iterable<Short> keys, Iterable<Long> values, int expectedSize) { UpdatableLHashSeparateKVShortLongMapGO map = newUpdatableMap(expectedSize); Iterator<Short> keysIt = keys.iterator(); Iterator<Long> 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); } }