while (entries[dest] != null) {
if (equals(k, entries[dest])) return dest;
dest = Math.abs((orig + (plus ? 1 : -1) * tries * tries) % (entries.length / indexmultiple)) * indexmultiple;
while (entries[dest] != null) {
if (equals(k, entries[dest])) return dest;
dest = Math.abs((orig + (plus ? 1 : -1) * tries * tries) % (entries.length / indexmultiple)) * indexmultiple;