How to use

isEmpty

method

in

com.koloboke.collect.impl.hash.MutableQHashSeparateKVShortLongMapGO

@Override
public void replaceAll(
    BiFunction<? super Short, ? super Long, ? extends Long> function) {
  if (function == null)
    throw new java.lang.NullPointerException();
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        vals[i] = function.apply(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        vals[i] = function.apply(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public void forEach(BiConsumer<? super Short, ? super Long> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        action.accept(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        action.accept(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public String toString() {
  if (this.isEmpty())
    return "{}";
  StringBuilder sb = new StringBuilder();

@Override
public String toString() {
  if (this.isEmpty())
    return "{}";
  StringBuilder sb = new StringBuilder();

@Override
public void replaceAll(ShortLongToLongFunction function) {
  if (function == null)
    throw new java.lang.NullPointerException();
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        vals[i] = function.applyAsLong(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        vals[i] = function.applyAsLong(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public void forEach(ShortLongConsumer action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        action.accept(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        action.accept(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

public void forEach(BiConsumer<? super Short, ? super Long> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        action.accept(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        action.accept(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public void forEach(ShortLongConsumer action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        action.accept(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        action.accept(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public void replaceAll(ShortLongToLongFunction function) {
  if (function == null)
    throw new java.lang.NullPointerException();
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        vals[i] = function.applyAsLong(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        vals[i] = function.applyAsLong(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

public void replaceAll(
    BiFunction<? super Short, ? super Long, ? extends Long> function) {
  if (function == null)
    throw new java.lang.NullPointerException();
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        vals[i] = function.apply(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        vals[i] = function.apply(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

if (predicate == null)
  throw new java.lang.NullPointerException();
if (this.isEmpty())
  return true;
boolean terminated = false;

if (predicate == null)
  throw new java.lang.NullPointerException();
if (this.isEmpty())
  return true;
boolean terminated = false;

@Override
public void reversePutAllTo(InternalShortLongMapOps m) {
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        m.justPut(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        m.justPut(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public boolean allEntriesContainingIn(InternalShortLongMapOps m) {
  if (this.isEmpty())
    return true;
  boolean containsAll = true;

@Override
public void reversePutAllTo(InternalShortLongMapOps m) {
  if (this.isEmpty())
    return;
  int mc = modCount();
  short free = freeValue;
  short removed = removedValue;
  short[] keys = set;
  long[] vals = values;
  if (noRemoved()) {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free) {
        m.justPut(key, vals[i]);
      }
    }
  } else {
    for (int i = keys.length - 1; i >= 0; i--) {
      short key;
      if ((key = keys[i]) != free && key != removed) {
        m.justPut(key, vals[i]);
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public boolean allEntriesContainingIn(InternalShortLongMapOps m) {
  if (this.isEmpty())
    return true;
  boolean containsAll = true;

if (filter == null)
  throw new java.lang.NullPointerException();
if (this.isEmpty())
  return false;
boolean changed = false;

if (filter == null)
  throw new java.lang.NullPointerException();
if (this.isEmpty())
  return false;
boolean changed = false;