@Override public boolean containsKey(Object key) { return findByObject(key) != null; }
@Override public V get(Object key) { Entry<K, V> entry = findByObject(key); return entry != null ? entry.getValue() : null; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
/** * Returns this map's entry that has the same key and value as {@code * entry}, or null if this map has no such entry. * * <p>This method uses the comparator for key equality rather than {@code * equals}. If this map's comparator isn't consistent with equals (such as * {@code String.CASE_INSENSITIVE_ORDER}), then {@code remove()} and {@code * contains()} will violate the collections API. */ Node<K, V> findByEntry(Entry<?, ?> entry) { Node<K, V> mine = findByObject(entry.getKey()); boolean valuesEqual = mine != null && Objects.equal(mine.value, entry.getValue()); return valuesEqual ? mine : null; }
@Override public boolean containsKey(Object key) { return findByObject(key) != null; }
@Override public boolean containsKey(Object key) { return findByObject(key) != null; }
@Override public boolean containsKey(Object key) { return findByObject(key) != null; }
@Override public V get(Object key) { Entry<K, V> entry = findByObject(key); return entry != null ? entry.getValue() : null; }
@Override public V get(Object key) { Entry<K, V> entry = findByObject(key); return entry != null ? entry.getValue() : null; }
@Override public V get(Object key) { Entry<K, V> entry = findByObject(key); return entry != null ? entry.getValue() : null; }
@Override public V get(Object key) { Entry<K, V> entry = findByObject(key); return entry != null ? entry.getValue() : null; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
/** * Returns this map's entry that has the same key and value as {@code * entry}, or null if this map has no such entry. * * <p>This method uses the comparator for key equality rather than {@code * equals}. If this map's comparator isn't consistent with equals (such as * {@code String.CASE_INSENSITIVE_ORDER}), then {@code remove()} and {@code * contains()} will violate the collections API. */ Node<K, V> findByEntry(Entry<?, ?> entry) { Node<K, V> mine = findByObject(entry.getKey()); boolean valuesEqual = mine != null && Objects.equal(mine.value, entry.getValue()); return valuesEqual ? mine : null; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
Node<K, V> removeInternalByKey(Object key) { Node<K, V> node = findByObject(key); if (node != null) { removeInternal(node); } return node; }
/** * Returns this map's entry that has the same key and value as {@code * entry}, or null if this map has no such entry. * * <p>This method uses the comparator for key equality rather than {@code * equals}. If this map's comparator isn't consistent with equals (such as * {@code String.CASE_INSENSITIVE_ORDER}), then {@code remove()} and {@code * contains()} will violate the collections API. */ Node<K, V> findByEntry(Entry<?, ?> entry) { Node<K, V> mine = findByObject(entry.getKey()); boolean valuesEqual = mine != null && Objects.equal(mine.value, entry.getValue()); return valuesEqual ? mine : null; }