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