@Override public void justPut(long key, long value) { int index = insert(key, value); if (index < 0) { // key was absent return; } else { // key is present table[index + 1] = value; return; } }
@Override public void justPut(long key, long value) { int index = insert(key, value); if (index < 0) { // key was absent return; } else { // key is present table[index + 1] = value; return; } }
@Override public Long putIfAbsent(Double key, Long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return null; } else { // key is present return table[index + 1]; } }
@Override public Long putIfAbsent(Double key, Long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return null; } else { // key is present return table[index + 1]; } }
@Override public void justPut(double key, long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return; } else { // key is present table[index + 1] = value; return; } }
@Override public void justPut(double key, long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return; } else { // key is present table[index + 1] = value; return; } }
@Override public Long put(Double key, Long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return null; } else { // key is present long[] tab = table; long prevValue = tab[index + 1]; tab[index + 1] = value; return prevValue; } }
@Override public long addValue(double key, long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return value; } else { // key is present long[] tab = table; long newValue = tab[index + 1] + value; tab[index + 1] = newValue; return newValue; } }
@Override public Long put(Double key, Long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return null; } else { // key is present long[] tab = table; long prevValue = tab[index + 1]; tab[index + 1] = value; return prevValue; } }
@Override public long addValue(double key, long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return value; } else { // key is present long[] tab = table; long newValue = tab[index + 1] + value; tab[index + 1] = newValue; return newValue; } }
@Override public long addValue(double key, long addition, long defaultValue) { long k = Double.doubleToLongBits(key); long value = defaultValue + addition; int index = insert(k, value); if (index < 0) { // key was absent return value; } else { // key is present long[] tab = table; long newValue = tab[index + 1] + addition; tab[index + 1] = newValue; return newValue; } }
@Override public long addValue(double key, long addition, long defaultValue) { long k = Double.doubleToLongBits(key); long value = defaultValue + addition; int index = insert(k, value); if (index < 0) { // key was absent return value; } else { // key is present long[] tab = table; long newValue = tab[index + 1] + addition; tab[index + 1] = newValue; return newValue; } }
@Override public long putIfAbsent(double key, long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present return table[index + 1]; } }
@Override public long putIfAbsent(double key, long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present return table[index + 1]; } }
@Override public long put(double key, long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present long[] tab = table; long prevValue = tab[index + 1]; tab[index + 1] = value; return prevValue; } }
@Override public long put(double key, long value) { long k = Double.doubleToLongBits(key); int index = insert(k, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present long[] tab = table; long prevValue = tab[index + 1]; tab[index + 1] = value; return prevValue; } }