| D | PersistentHashArrayMappedTrieTest.java | 52     Key key2 = new Key(0);  in leaf_collision()  local 56     Node<Key, Object> ret = leaf.put(key2, value2, key2.hashCode(), 0);  in leaf_collision() 59     assertSame(value2, ret.get(key2, key2.hashCode(), 0));  in leaf_collision() 62     assertSame(null, leaf.get(key2, key2.hashCode(), 0));  in leaf_collision() 71     Key key2 = new Key(1);  in leaf_insert()  local 75     Node<Key, Object> ret = leaf.put(key2, value2, key2.hashCode(), 0);  in leaf_insert() 78     assertSame(value2, ret.get(key2, key2.hashCode(), 0));  in leaf_insert() 81     assertSame(null, leaf.get(key2, key2.hashCode(), 0));  in leaf_insert() 101     Key key2 = new Key(key1.hashCode());  in collisionLeaf_insert()  local 107         new CollisionLeaf<Key, Object>(key1, value1, key2, value2);  in collisionLeaf_insert() [all …] 
 |