// collisions when a single Object is inserted into multiple
// trees
int dest = Math.abs(o.hashCode() ^ this.hashCode()) % objects.length;
+ if (dest == 0) dest = 1;
Object search = alloc ? null : o;
int odest = dest;
boolean plus = true;
int tries = 1;
while (objects[dest] != search || !(alloc || root(dest) == root)) {
- if (dest == 0) dest++;
dest = Math.abs((odest + (plus ? 1 : -1) * tries * tries) % objects.length);
+ if (dest == 0) dest=1;
if (plus) tries++;
plus = !plus;
// FEATURE: GROW - if(tries > MAX_SLOT_DISTANCE) return -1;