How to use

UpdatableQHashSeparateKVCharFloatMapGO$MutableEntry

in

net.openhft.koloboke.collect.impl.hash

char key;
if ((key = keys[i]) != free) {
  a[resultIndex++] = (T) new MutableEntry(mc, i, key, vals[i]);

@Override
public Float setValue(Float newValue) {
  if (modCount != modCount())
    throw new IllegalStateException();
  float oldValue = Float.intBitsToFloat(value);
  int unwrappedNewValue = Float.floatToIntBits(newValue);
  value = unwrappedNewValue;
  updateValueInTable(unwrappedNewValue);
  return oldValue;
}

@Override
public Map.Entry<Character, Float> next() {
  int nextI;
  if ((nextI = nextIndex) >= 0) {
    int mc;
    if ((mc = expectedModCount) == modCount()) {
      char[] keys = this.keys;
      char free = this.free;
      MutableEntry prev = next;
      while (--nextI >= 0) {
        char key;
        if ((key = keys[nextI]) != free) {
          next = new MutableEntry(mc, nextI, key, vals[nextI]);
          break;
        }
      }
      nextIndex = nextI;
      return prev;
    } else {
      throw new java.util.ConcurrentModificationException();
    }
  } else {
    throw new java.util.NoSuchElementException();
  }
}

char key;
if ((key = keys[i]) != free) {
  a[resultIndex++] = (T) new MutableEntry(mc, i, key, vals[i]);

@Override
public boolean forEachWhile(@Nonnull  Predicate<? super Map.Entry<Character, Float>> predicate) {
  if (predicate == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return true;
  boolean terminated = false;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  int[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      if (!predicate.test(new MutableEntry(mc, i, key, vals[i]))) {
        terminated = true;
        break;
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return !terminated;
}

@Override
public Map.Entry<Character, Float> next() {
  int nextI;
  if ((nextI = nextIndex) >= 0) {
    int mc;
    if ((mc = expectedModCount) == modCount()) {
      char[] keys = this.keys;
      char free = this.free;
      MutableEntry prev = next;
      while (--nextI >= 0) {
        char key;
        if ((key = keys[nextI]) != free) {
          next = new MutableEntry(mc, nextI, key, vals[nextI]);
          break;
        }
      }
      nextIndex = nextI;
      return prev;
    } else {
      throw new java.util.ConcurrentModificationException();
    }
  } else {
    throw new java.util.NoSuchElementException();
  }
}

@Override
@Nonnull
public final Object[] toArray() {
  int size = size();
  Object[] result = new Object[size];
  if (size == 0)
    return result;
  int resultIndex = 0;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  int[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      result[resultIndex++] = new MutableEntry(mc, i, key, vals[i]);
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return result;
}

@Override
public void forEachForward(Consumer<? super Map.Entry<Character, Float>> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  int mc = expectedModCount;
  char[] keys = this.keys;
  int[] vals = this.vals;
  char free = this.free;
  int index = this.index;
  for (int i = index - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      action.accept(new MutableEntry(mc, i, key, vals[i]));
    }
  }
  if (index != this.index || mc != modCount()) {
    throw new java.util.ConcurrentModificationException();
  }
  this.index = -1;
  curKey = free;
}

@Override
public boolean forEachWhile(@Nonnull  Predicate<? super Map.Entry<Character, Float>> predicate) {
  if (predicate == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return true;
  boolean terminated = false;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  int[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      if (!predicate.test(new MutableEntry(mc, i, key, vals[i]))) {
        terminated = true;
        break;
      }
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return !terminated;
}

@Override
public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Character, Float>> c) {
  if (isEmpty())
    return false;
  boolean changed = false;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  int[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      changed |= c.add(new MutableEntry(mc, i, key, vals[i]));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return changed;
}

@Override
public final void forEach(@Nonnull Consumer<? super Map.Entry<Character, Float>> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  int[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      action.accept(new MutableEntry(mc, i, key, vals[i]));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Character, Float>> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  int mc = expectedModCount;
  char[] keys = this.keys;
  int[] vals = this.vals;
  char free = this.free;
  int nextI = nextIndex;
  for (int i = nextI; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      action.accept(new MutableEntry(mc, i, key, vals[i]));
    }
  }
  if (nextI != nextIndex || mc != modCount()) {
    throw new java.util.ConcurrentModificationException();
  }
  nextIndex = -1;
}

@Override
public void forEachForward(Consumer<? super Map.Entry<Character, Float>> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  int mc = expectedModCount;
  char[] keys = this.keys;
  int[] vals = this.vals;
  char free = this.free;
  int index = this.index;
  for (int i = index - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      action.accept(new MutableEntry(mc, i, key, vals[i]));
    }
  }
  if (index != this.index || mc != modCount()) {
    throw new java.util.ConcurrentModificationException();
  }
  this.index = -1;
  curKey = free;
}

@Override
public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Character, Float>> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  int mc = expectedModCount;
  char[] keys = this.keys;
  int[] vals = this.vals;
  char free = this.free;
  int nextI = nextIndex;
  for (int i = nextI; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      action.accept(new MutableEntry(mc, i, key, vals[i]));
    }
  }
  if (nextI != nextIndex || mc != modCount()) {
    throw new java.util.ConcurrentModificationException();
  }
  nextIndex = -1;
}

@Override
@Nonnull
public final Object[] toArray() {
  int size = size();
  Object[] result = new Object[size];
  if (size == 0)
    return result;
  int resultIndex = 0;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  int[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      result[resultIndex++] = new MutableEntry(mc, i, key, vals[i]);
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return result;
}

@Override
public final void forEach(@Nonnull Consumer<? super Map.Entry<Character, Float>> action) {
  if (action == null)
    throw new java.lang.NullPointerException();
  if (isEmpty())
    return;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  int[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      action.accept(new MutableEntry(mc, i, key, vals[i]));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
}

@Override
public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Character, Float>> c) {
  if (isEmpty())
    return false;
  boolean changed = false;
  int mc = modCount();
  char free = freeValue;
  char[] keys = set;
  int[] vals = values;
  for (int i = keys.length - 1; i >= 0; i--) {
    char key;
    if ((key = keys[i]) != free) {
      changed |= c.add(new MutableEntry(mc, i, key, vals[i]));
    }
  }
  if (mc != modCount())
    throw new java.util.ConcurrentModificationException();
  return changed;
}

NoRemovedEntryIterator(int mc) {
  expectedModCount = mc;
  char[] keys = this.keys = set;
  int[] vals = this.vals = values;
  char free = this.free = freeValue;
  int nextI = keys.length;
  while (--nextI >= 0) {
    char key;
    if ((key = keys[nextI]) != free) {
      next = new MutableEntry(mc, nextI, key, vals[nextI]);
      break;
    }
  }
  nextIndex = nextI;
}

NoRemovedEntryIterator(int mc) {
  expectedModCount = mc;
  char[] keys = this.keys = set;
  int[] vals = this.vals = values;
  char free = this.free = freeValue;
  int nextI = keys.length;
  while (--nextI >= 0) {
    char key;
    if ((key = keys[nextI]) != free) {
      next = new MutableEntry(mc, nextI, key, vals[nextI]);
      break;
    }
  }
  nextIndex = nextI;
}

@Override
public Map.Entry<Character, Float> elem() {
  char curKey;
  if ((curKey = this.curKey) != free) {
    return new MutableEntry(expectedModCount, index, curKey, curValue);
  } else {
    throw new java.lang.IllegalStateException();
  }
}