How to use

shrunk

method

in

com.koloboke.collect.impl.hash.QHashSeparateKVLongShortMapFactoryGO

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map) {
  return shrunk(super.newUpdatableMap(map));
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map) {
  return shrunk(super.newUpdatableMap(map));
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Consumer<com.koloboke.function.LongShortConsumer> entriesSupplier,
    int expectedSize) {
  final UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  entriesSupplier.accept(new com.koloboke.function.LongShortConsumer() {
     @Override
     public void accept(long k, short v) {
       map.put(k, v);
     }
   });
  return shrunk(map);
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    long[] keys, short[] values, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO 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  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    long[] keys, short[] values, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO 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  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Long[] keys, Short[] values, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO 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  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Long[] keys, Short[] values, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO 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  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Iterable<Long> keys, Iterable<Short> values, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO 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  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Iterable<Long> keys, Iterable<Short> values, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO 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  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Consumer<com.koloboke.function.LongShortConsumer> entriesSupplier,
    int expectedSize) {
  final UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  entriesSupplier.accept(new com.koloboke.function.LongShortConsumer() {
     @Override
     public void accept(long k, short v) {
       map.put(k, v);
     }
   });
  return shrunk(map);
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map1, Map<Long, Short> map2,
    int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  map.putAll(map1);
  map.putAll(map2);
  return shrunk(map);
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map1, Map<Long, Short> map2,
    int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  map.putAll(map1);
  map.putAll(map2);
  return shrunk(map);
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map1, Map<Long, Short> map2,
    Map<Long, Short> map3, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  map.putAll(map1);
  map.putAll(map2);
  map.putAll(map3);
  return shrunk(map);
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map1, Map<Long, Short> map2,
    Map<Long, Short> map3, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  map.putAll(map1);
  map.putAll(map2);
  map.putAll(map3);
  return shrunk(map);
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map1, Map<Long, Short> map2,
    Map<Long, Short> map3, Map<Long, Short> map4,
    int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  map.putAll(map1);
  map.putAll(map2);
  map.putAll(map3);
  map.putAll(map4);
  return shrunk(map);
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map1, Map<Long, Short> map2,
    Map<Long, Short> map3, Map<Long, Short> map4,
    int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  map.putAll(map1);
  map.putAll(map2);
  map.putAll(map3);
  map.putAll(map4);
  return shrunk(map);
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map1, Map<Long, Short> map2,
    Map<Long, Short> map3, Map<Long, Short> map4,
    Map<Long, Short> map5, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  map.putAll(map1);
  map.putAll(map2);
  map.putAll(map3);
  map.putAll(map4);
  map.putAll(map5);
  return shrunk(map);
}

@Override
@Nonnull
public  UpdatableQHashSeparateKVLongShortMapGO newUpdatableMap(
    Map<Long, Short> map1, Map<Long, Short> map2,
    Map<Long, Short> map3, Map<Long, Short> map4,
    Map<Long, Short> map5, int expectedSize) {
  UpdatableQHashSeparateKVLongShortMapGO map = newUpdatableMap(expectedSize);
  map.putAll(map1);
  map.putAll(map2);
  map.putAll(map3);
  map.putAll(map4);
  map.putAll(map5);
  return shrunk(map);
}