How to use

insert

method

in

net.openhft.koloboke.collect.impl.hash.UpdatableQHashSeparateKVCharLongMapGO

@Override
public void justPut(char key, long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return;
  } else {
    // key is present
    values[index] = value;
    return;
  }
}

@Override
public void justPut(char key, long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return;
  } else {
    // key is present
    values[index] = value;
    return;
  }
}

@Override
public Long putIfAbsent(Character key, Long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return null;
  } else {
    // key is present
    return values[index];
  }
}

@Override
public long addValue(char key, long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return value;
  } else {
    // key is present
    long[] vals = values;
    long newValue = vals[index] + value;
    vals[index] = newValue;
    return newValue;
  }
}

@Override
public Long put(Character key, Long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return null;
  } else {
    // key is present
    long[] vals = values;
    long prevValue = vals[index];
    vals[index] = value;
    return prevValue;
  }
}

@Override
public Long put(Character key, Long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return null;
  } else {
    // key is present
    long[] vals = values;
    long prevValue = vals[index];
    vals[index] = value;
    return prevValue;
  }
}

@Override
public Long putIfAbsent(Character key, Long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return null;
  } else {
    // key is present
    return values[index];
  }
}

@Override
public long addValue(char key, long addition, long defaultValue) {
  long value = defaultValue + addition;
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return value;
  } else {
    // key is present
    long[] vals = values;
    long newValue = vals[index] + addition;
    vals[index] = newValue;
    return newValue;
  }
}

@Override
public long addValue(char key, long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return value;
  } else {
    // key is present
    long[] vals = values;
    long newValue = vals[index] + value;
    vals[index] = newValue;
    return newValue;
  }
}

@Override
public long addValue(char key, long addition, long defaultValue) {
  long value = defaultValue + addition;
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return value;
  } else {
    // key is present
    long[] vals = values;
    long newValue = vals[index] + addition;
    vals[index] = newValue;
    return newValue;
  }
}

@Override
public long putIfAbsent(char key, long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return defaultValue();
  } else {
    // key is present
    return values[index];
  }
}

@Override
public long putIfAbsent(char key, long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return defaultValue();
  } else {
    // key is present
    return values[index];
  }
}

@Override
public long put(char key, long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return defaultValue();
  } else {
    // key is present
    long[] vals = values;
    long prevValue = vals[index];
    vals[index] = value;
    return prevValue;
  }
}

@Override
public long put(char key, long value) {
  int index = insert(key, value);
  if (index < 0) {
    // key was absent
    return defaultValue();
  } else {
    // key is present
    long[] vals = values;
    long prevValue = vals[index];
    vals[index] = value;
    return prevValue;
  }
}