D | PersistentHashArrayMappedTrieTest.java | 51 Key key1 = new Key(0); in leaf_collision() local 55 Leaf<Key, Object> leaf = new Leaf<Key, Object>(key1, value1); in leaf_collision() 58 assertSame(value1, ret.get(key1, key1.hashCode(), 0)); in leaf_collision() 61 assertSame(value1, leaf.get(key1, key1.hashCode(), 0)); in leaf_collision() 70 Key key1 = new Key(0); in leaf_insert() local 74 Leaf<Key, Object> leaf = new Leaf<Key, Object>(key1, value1); in leaf_insert() 77 assertSame(value1, ret.get(key1, key1.hashCode(), 0)); in leaf_insert() 80 assertSame(value1, leaf.get(key1, key1.hashCode(), 0)); in leaf_insert() 89 Key key1 = new Key(0); in collisionLeaf_assertKeysDifferent() local 90 new CollisionLeaf<Key, Object>(key1, new Object(), key1, new Object()); in collisionLeaf_assertKeysDifferent() [all …]
|