How to use com.koloboke.collect.impl.hash

void move(SeparateKVLongQHash hash) {
  super.copy(hash);
  freeValue = hash.freeValue();
  if (hash.supportRemoved())
    removedValue = hash.removedValue();
  set = hash.keys();
  if (!hash.supportRemoved()) {
    removedValue = freeValue;
    removedValue = findNewFreeOrRemoved();
  }
}

void move(ParallelKVShortQHash hash) {
  super.copy(hash);
  freeValue = hash.freeValue();
  if (hash.supportRemoved())
    removedValue = hash.removedValue();
  table = hash.table();
  if (!hash.supportRemoved()) {
    removedValue = freeValue;
    removedValue = findNewFreeOrRemoved();
  }
}

public CharIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedIterator(
      mc);
  return new NoRemovedIterator(mc);
}

void move(ParallelKVIntQHash hash) {
  super.copy(hash);
  freeValue = hash.freeValue();
  if (hash.supportRemoved())
    removedValue = hash.removedValue();
  table = hash.table();
  if (!hash.supportRemoved()) {
    removedValue = freeValue;
    removedValue = findNewFreeOrRemoved();
  }
}

public ShortIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedIterator(
      mc);
  return new NoRemovedIterator(mc);
}

@Override
public CharCursor setCursor() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedKeyCursor(
      mc);
  return new NoRemovedKeyCursor(mc);
}

public IntIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedIterator(
      mc);
  return new NoRemovedIterator(mc);
}

@Override
public IntIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedKeyIterator(
      mc);
  return new NoRemovedKeyIterator(mc);
}

public ShortIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedIterator(
      mc);
  return new NoRemovedIterator(mc);
}

public DoubleCursor setCursor() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedCursor(mc);
  return new NoRemovedCursor(mc);
}

public LongCursor setCursor() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedCursor(mc);
  return new NoRemovedCursor(mc);
}

public LongIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedIterator(
      mc);
  return new NoRemovedIterator(mc);
}

public LongCursor setCursor() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedCursor(mc);
  return new NoRemovedCursor(mc);
}

@Override
public CharIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedKeyIterator(
      mc);
  return new NoRemovedKeyIterator(mc);
}

public IntCursor setCursor() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedCursor(mc);
  return new NoRemovedCursor(mc);
}

public ByteIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedIterator(
      mc);
  return new NoRemovedIterator(mc);
}

public ByteCursor setCursor() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedCursor(mc);
  return new NoRemovedCursor(mc);
}

public FloatIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedIterator(
      mc);
  return new NoRemovedIterator(mc);
}

public CharIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedIterator(
      mc);
  return new NoRemovedIterator(mc);
}

@Override
public DoubleIterator iterator() {
  int mc = modCount();
  if (!noRemoved())
    return new SomeRemovedKeyIterator(
      mc);
  return new NoRemovedKeyIterator(mc);
}