@Override public void accept(char k, short v) { map.put(k, v); } });
@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; } }
@Override public void accept(char k, short v) { map.put(k, v); } });
@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; } }
@Override @Nonnull public UpdatableQHashParallelKVCharShortMapGO newUpdatableMapOf( char k1, short v1, char k2, short v2, char k3, short v3, char k4, short v4) { UpdatableQHashParallelKVCharShortMapGO map = newUpdatableMap(4); map.put(k1, v1); map.put(k2, v2); map.put(k3, v3); map.put(k4, v4); return map; }
@Override @Nonnull public UpdatableQHashParallelKVCharShortMapGO newUpdatableMapOf( char k1, short v1, char k2, short v2, char k3, short v3, char k4, short v4) { UpdatableQHashParallelKVCharShortMapGO map = newUpdatableMap(4); map.put(k1, v1); map.put(k2, v2); map.put(k3, v3); map.put(k4, v4); return map; }
@Override @Nonnull public UpdatableQHashParallelKVCharShortMapGO newUpdatableMapOf( char k1, short v1, char k2, short v2, char k3, short v3, char k4, short v4, char k5, short v5) { UpdatableQHashParallelKVCharShortMapGO 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 UpdatableQHashParallelKVCharShortMapGO newUpdatableMapOf( char k1, short v1, char k2, short v2, char k3, short v3, char k4, short v4, char k5, short v5) { UpdatableQHashParallelKVCharShortMapGO 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 UpdatableQHashParallelKVCharShortMapGO newUpdatableMapOf( char k1, short v1) { UpdatableQHashParallelKVCharShortMapGO map = newUpdatableMap(1); map.put(k1, v1); return map; }
@Override @Nonnull public UpdatableQHashParallelKVCharShortMapGO newUpdatableMapOf( char k1, short v1) { UpdatableQHashParallelKVCharShortMapGO map = newUpdatableMap(1); map.put(k1, v1); return map; }
@Override @Nonnull public UpdatableQHashParallelKVCharShortMapGO newUpdatableMap( Character[] keys, Short[] values, int expectedSize) { UpdatableQHashParallelKVCharShortMapGO 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 UpdatableQHashParallelKVCharShortMapGO newUpdatableMap( char[] keys, short[] values, int expectedSize) { UpdatableQHashParallelKVCharShortMapGO 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 UpdatableQHashParallelKVCharShortMapGO newUpdatableMap( Iterable<Character> keys, Iterable<Short> values, int expectedSize) { UpdatableQHashParallelKVCharShortMapGO map = newUpdatableMap(expectedSize); Iterator<Character> 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 UpdatableQHashParallelKVCharShortMapGO newUpdatableMap( Iterable<Character> keys, Iterable<Short> values, int expectedSize) { UpdatableQHashParallelKVCharShortMapGO map = newUpdatableMap(expectedSize); Iterator<Character> 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 UpdatableQHashParallelKVCharShortMapGO newUpdatableMap( char[] keys, short[] values, int expectedSize) { UpdatableQHashParallelKVCharShortMapGO 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 UpdatableQHashParallelKVCharShortMapGO newUpdatableMap( Character[] keys, Short[] values, int expectedSize) { UpdatableQHashParallelKVCharShortMapGO 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); }