How to use

modCount

method

in

net.openhft.koloboke.collect.impl.hash.UpdatableQHashParallelKVShortCharMapGO

@Override
public void clear() {
  int mc = modCount() + 1;
  super.clear();
  if (mc != modCount())
    throw new ConcurrentModificationException();
}

@Override
public void clear() {
  int mc = modCount() + 1;
  super.clear();
  if (mc != modCount())
    throw new ConcurrentModificationException();
}

@Override
@Nonnull
public ObjIterator<Map.Entry<Short, Character>> iterator() {
  int mc = modCount();
  return new NoRemovedEntryIterator(mc);
}

@Override
public void setValue(char value) {
  if (curKey != free) {
    if (expectedModCount == modCount()) {
      U.putChar(tab, INT_BASE + CHAR_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), value);
    } else {
      throw new java.util.ConcurrentModificationException();
    }
  } else {
    throw new java.lang.IllegalStateException();
  }
}

@Override
public Character setValue(Character newValue) {
  if (modCount != modCount())
    throw new IllegalStateException();
  char oldValue = value;
  char unwrappedNewValue = newValue;
  value = unwrappedNewValue;
  updateValueInTable(unwrappedNewValue);
  return oldValue;
}

@Override
@Nonnull
public CharIterator iterator() {
  int mc = modCount();
  return new NoRemovedValueIterator(mc);
}

@Nonnull
@Override
public ShortCharCursor cursor() {
  int mc = modCount();
  return new NoRemovedMapCursor(mc);
}

@Nonnull
@Override
public ObjCursor<Map.Entry<Short, Character>> cursor() {
  int mc = modCount();
  return new NoRemovedEntryCursor(mc);
}

@Nonnull
@Override
public CharCursor cursor() {
  int mc = modCount();
  return new NoRemovedValueCursor(mc);
}

@Override
public void setValue(char value) {
  if (curKey != free) {
    if (expectedModCount == modCount()) {
      U.putChar(tab, INT_BASE + CHAR_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), value);
    } else {
      throw new java.util.ConcurrentModificationException();
    }
  } else {
    throw new java.lang.IllegalStateException();
  }
}

@Override
@Nonnull
public ObjIterator<Map.Entry<Short, Character>> iterator() {
  int mc = modCount();
  return new NoRemovedEntryIterator(mc);
}

@Override
public Character setValue(Character newValue) {
  if (modCount != modCount())
    throw new IllegalStateException();
  char oldValue = value;
  char unwrappedNewValue = newValue;
  value = unwrappedNewValue;
  updateValueInTable(unwrappedNewValue);
  return oldValue;
}

@Nonnull
@Override
public ShortCharCursor cursor() {
  int mc = modCount();
  return new NoRemovedMapCursor(mc);
}

@Nonnull
@Override
public ObjCursor<Map.Entry<Short, Character>> cursor() {
  int mc = modCount();
  return new NoRemovedEntryCursor(mc);
}

@Override
@Nonnull
public CharIterator iterator() {
  int mc = modCount();
  return new NoRemovedValueIterator(mc);
}

@Nonnull
@Override
public CharCursor cursor() {
  int mc = modCount();
  return new NoRemovedValueCursor(mc);
}

final void move(ParallelKVShortCharQHash hash) {
  int myMC = modCount(), hashMC = hash.modCount();
  super.move(hash);
  if (myMC != modCount() || hashMC != hash.modCount())
    throw new ConcurrentModificationException();
}

final void copy(ParallelKVShortCharQHash hash) {
  int myMC = modCount(), hashMC = hash.modCount();
  super.copy(hash);
  if (myMC != modCount() || hashMC != hash.modCount())
    throw new ConcurrentModificationException();
}

final void copy(ParallelKVShortCharQHash hash) {
  int myMC = modCount(), hashMC = hash.modCount();
  super.copy(hash);
  if (myMC != modCount() || hashMC != hash.modCount())
    throw new ConcurrentModificationException();
}

final void move(ParallelKVShortCharQHash hash) {
  int myMC = modCount(), hashMC = hash.modCount();
  super.move(hash);
  if (myMC != modCount() || hashMC != hash.modCount())
    throw new ConcurrentModificationException();
}