D | PersistentHashArrayMappedTrie.java | 88 public V get(K key, int hash, int bitsConsumed) { in get() argument 97 public Node<K,V> put(K key, V value, int hash, int bitsConsumed) { in put() argument 102 new Leaf<K,V>(key, value), hash, this, thisHash, bitsConsumed); in put() 145 public V get(K key, int hash, int bitsConsumed) { in get() argument 155 public Node<K,V> put(K key, V value, int hash, int bitsConsumed) { in put() argument 161 new Leaf<K,V>(key, value), hash, this, thisHash, bitsConsumed); in put() 222 public V get(K key, int hash, int bitsConsumed) { in get() argument 223 int indexBit = indexBit(hash, bitsConsumed); in get() 228 return values[compressedIndex].get(key, hash, bitsConsumed + BITS); in get() 232 public Node<K,V> put(K key, V value, int hash, int bitsConsumed) { in put() argument [all …]
|