@Test public void testContainsValue() { map.put("hello", "world"); assertTrue(map.containsValue("world")); }
public boolean containsValue(Object value) { if (value == null) { for (Entry<K, V> e = header.after; e != header; e = e.after) if (e.value == null) return true; } else { for (Entry<K, V> e = header.after; e != header; e = e.after) if (value.equals(e.value)) return true; } return false; }
SortedHashMap extends AbstractMap<K, V> { public boolean containsValue(Object value) { if (value == null) { for (Entry<K, V> e = header.after; e != header; e = e.after) if (e.value == null) return true; } else { for (Entry<K, V> e = header.after; e != header; e = e.after) if (value.equals(e.value)) return true; } return false; } }
SortedHashMap extends AbstractMap<K, V> { public boolean containsValue(Object value) { if (value == null) { for (Entry<K, V> e = header.after; e != header; e = e.after) if (e.value == null) return true; } else { for (Entry<K, V> e = header.after; e != header; e = e.after) if (value.equals(e.value)) return true; } return false; } SortedHashMap();  SortedHashMap(int initialCapacity);  SortedHashMap(int initialCapacity, OrderingType orderingType);  SortedHashMap(int initialCapacity, float loadFactor, OrderingType orderingType); }
SortedHashMap extends AbstractMap<K, V> { public boolean containsValue(Object value) { if (value == null) { for (Entry<K, V> e = header.after; e != header; e = e.after) if (e.value == null) return true; } else { for (Entry<K, V> e = header.after; e != header; e = e.after) if (value.equals(e.value)) return true; } return false; } SortedHashMap();  SortedHashMap(int initialCapacity);  SortedHashMap(int initialCapacity, OrderingType orderingType);  SortedHashMap(int initialCapacity, float loadFactor, OrderingType orderingType); V put(K key, V value); static void touch(SortedHashMap linkedMap, Object key, OrderingType orderingType); static void moveToTop(SortedHashMap linkedMap, Object key); static OrderingType getOrderingTypeByName(String orderingType); boolean containsKey(Object key); V get(Object key); void clear(); V remove(Object key); boolean containsValue(Object value); Set<K> keySet(); Collection<V> values(); Set<Map.Entry<K, V>> entrySet(); }
SortedHashMap extends AbstractMap<K, V> { public boolean containsValue(Object value) { if (value == null) { for (Entry<K, V> e = header.after; e != header; e = e.after) if (e.value == null) return true; } else { for (Entry<K, V> e = header.after; e != header; e = e.after) if (value.equals(e.value)) return true; } return false; } SortedHashMap();  SortedHashMap(int initialCapacity);  SortedHashMap(int initialCapacity, OrderingType orderingType);  SortedHashMap(int initialCapacity, float loadFactor, OrderingType orderingType); V put(K key, V value); static void touch(SortedHashMap linkedMap, Object key, OrderingType orderingType); static void moveToTop(SortedHashMap linkedMap, Object key); static OrderingType getOrderingTypeByName(String orderingType); boolean containsKey(Object key); V get(Object key); void clear(); V remove(Object key); boolean containsValue(Object value); Set<K> keySet(); Collection<V> values(); Set<Map.Entry<K, V>> entrySet();  }