How to use

isEmpty

method

in

net.openhft.koloboke.collect.impl.hash.UpdatableQHashParallelKVIntFloatMapGO

@Override
public void replaceAll(
    BiFunction<? super Integer, ? super Float, ? extends Float> function) {
  if (function == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      U.putInt(tab, LONG_BASE + FLOAT_VALUE_OFFSET + (((long) (i)) << LONG_SCALE_SHIFT), Float.floatToIntBits(function.apply(key, Float.intBitsToFloat((int) (entry >>> 32)))));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public void forEach(BiConsumer<? super Integer, ? super Float> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      action.accept(key, Float.intBitsToFloat((int) (entry >>> 32)));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

public void replaceAll(
    BiFunction<? super Integer, ? super Float, ? extends Float> function) {
  if (function == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      U.putInt(tab, LONG_BASE + FLOAT_VALUE_OFFSET + (((long) (i)) << LONG_SCALE_SHIFT), Float.floatToIntBits(function.apply(key, Float.intBitsToFloat((int) (entry >>> 32)))));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public void replaceAll(IntFloatToFloatFunction function) {
  if (function == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      U.putInt(tab, LONG_BASE + FLOAT_VALUE_OFFSET + (((long) (i)) << LONG_SCALE_SHIFT), Float.floatToIntBits(function.applyAsFloat(key, Float.intBitsToFloat((int) (entry >>> 32)))));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public void replaceAll(IntFloatToFloatFunction function) {
  if (function == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      U.putInt(tab, LONG_BASE + FLOAT_VALUE_OFFSET + (((long) (i)) << LONG_SCALE_SHIFT), Float.floatToIntBits(function.applyAsFloat(key, Float.intBitsToFloat((int) (entry >>> 32)))));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

public void forEach(BiConsumer<? super Integer, ? super Float> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      action.accept(key, Float.intBitsToFloat((int) (entry >>> 32)));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public String toString() {
  if (isEmpty())
    return "{}";
  StringBuilder sb = new StringBuilder();
  int elementCount = 0;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      sb.append(' ');
      sb.append(key);
      sb.append('=');
      sb.append(Float.intBitsToFloat((int) (entry >>> 32)));
      sb.append(',');
      if (++elementCount == 8) {
        int expectedLength = sb.length() * (size() / 8);
        sb.ensureCapacity(expectedLength + (expectedLength / 2));
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  sb.setCharAt(0, '{');
  sb.setCharAt(sb.length() - 1, '}');
  return sb.toString();
}

@Override
public void forEach(IntFloatConsumer action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      action.accept(key, Float.intBitsToFloat((int) (entry >>> 32)));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public void forEach(IntFloatConsumer action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      action.accept(key, Float.intBitsToFloat((int) (entry >>> 32)));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public String toString() {
  if (isEmpty())
    return "{}";
  StringBuilder sb = new StringBuilder();
  int elementCount = 0;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      sb.append(' ');
      sb.append(key);
      sb.append('=');
      sb.append(Float.intBitsToFloat((int) (entry >>> 32)));
      sb.append(',');
      if (++elementCount == 8) {
        int expectedLength = sb.length() * (size() / 8);
        sb.ensureCapacity(expectedLength + (expectedLength / 2));
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  sb.setCharAt(0, '{');
  sb.setCharAt(sb.length() - 1, '}');
  return sb.toString();
}

@Override
public void reversePutAllTo(InternalIntFloatMapOps m) {
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      m.justPut(key, (int) (entry >>> 32));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public boolean forEachWhile(IntFloatPredicate predicate) {
  if (predicate == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return true;
  boolean terminated = false;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      if (!predicate.test(key, Float.intBitsToFloat((int) (entry >>> 32)))) {
        terminated = true;
        break;
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return !terminated;
}

@Override
public boolean forEachWhile(IntFloatPredicate predicate) {
  if (predicate == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return true;
  boolean terminated = false;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      if (!predicate.test(key, Float.intBitsToFloat((int) (entry >>> 32)))) {
        terminated = true;
        break;
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return !terminated;
}

@Override
public void reversePutAllTo(InternalIntFloatMapOps m) {
  if (isEmpty())
    return;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      m.justPut(key, (int) (entry >>> 32));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public boolean allEntriesContainingIn(InternalIntFloatMapOps m) {
  if (isEmpty())
    return true;
  boolean containsAll = true;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      if (!m.containsEntry(key, (int) (entry >>> 32))) {
        containsAll = false;
        break;
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return containsAll;
}

@Override
public boolean allEntriesContainingIn(InternalIntFloatMapOps m) {
  if (isEmpty())
    return true;
  boolean containsAll = true;
  int mc = modCount();
  int free = freeValue;
  long[] tab = table;
  long entry;
  for (int i = tab.length - 1; i >= 0; i--) {
    int key;
    if ((key = (int) (entry = tab[i])) != free) {
      if (!m.containsEntry(key, (int) (entry >>> 32))) {
        containsAll = false;
        break;
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return containsAll;
}