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