Home
last modified time | relevance | path

Searched refs:keyToKeyHead (Results 1 – 2 of 2) sorted by relevance

/external/guava/guava/src/com/google/common/collect/
DLinkedListMultimap.java132 private transient Map<K, Node<K, V>> keyToKeyHead; // the head for a given key field in LinkedListMultimap
168 keyToKeyHead = Maps.newHashMap(); in LinkedListMultimap()
174 keyToKeyHead = Maps.newHashMapWithExpectedSize(expectedKeys); in LinkedListMultimap()
194 keyToKeyHead.put(key, node); in addNode()
201 keyToKeyHead.put(key, node); in addNode()
214 keyToKeyHead.put(key, node); in addNode()
249 keyToKeyHead.put(node.key, node.nextSibling); in removeNode()
251 keyToKeyHead.remove(node.key); // don't leak a key-null entry in removeNode()
402 next = keyToKeyHead.get(key); in ValueForKeyIterator()
424 next = keyToKeyHead.get(key); in ValueForKeyIterator()
[all …]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DLinkedListMultimap.java128 private transient Map<K, Node<K, V>> keyToKeyHead; // the head for a given key field in LinkedListMultimap
164 keyToKeyHead = Maps.newHashMap(); in LinkedListMultimap()
170 keyToKeyHead = Maps.newHashMapWithExpectedSize(expectedKeys); in LinkedListMultimap()
190 keyToKeyHead.put(key, node); in addNode()
197 keyToKeyHead.put(key, node); in addNode()
210 keyToKeyHead.put(key, node); in addNode()
245 keyToKeyHead.put(node.key, node.nextSibling); in removeNode()
247 keyToKeyHead.remove(node.key); // don't leak a key-null entry in removeNode()
398 next = keyToKeyHead.get(key); in ValueForKeyIterator()
420 next = keyToKeyHead.get(key); in ValueForKeyIterator()
[all …]