How to use

modCount

method

in

net.openhft.koloboke.collect.impl.hash.UpdatableQHashSeparateKVCharLongMapSO

int valueIndex(long value) {
  if (isEmpty())
    return -1;
  int index = -1;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  long[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    if (keys[i] != free) {
      if (value == vals[i]) {
        index = i;
        break;
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return index;
}

int valueIndex(long value) {
  if (isEmpty())
    return -1;
  int index = -1;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  long[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    if (keys[i] != free) {
      if (value == vals[i]) {
        index = i;
        break;
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return index;
}