@Test public void test_containsValueLjava_lang_Object() { assertTrue("Returned false for valid value", hm .containsValue(new Integer(875))); assertTrue("Returned true for invalid valie", !hm .containsValue(new Integer(-9))); }
@Override @SuppressWarnings("unchecked") public boolean containsValue(Object value) { if (value != null) { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } if (resizingIntoElementData == null) return false; if (value != null) { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } return false; }
PauselessHashMap extends java.util.AbstractMap<K, V> implements Map<K, V>,
        Cloneable, Serializable { @Override @SuppressWarnings("unchecked") public boolean containsValue(Object value) { if (value != null) { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } if (resizingIntoElementData == null) return false; if (value != null) { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } return false; } }
PauselessHashMap extends java.util.AbstractMap<K, V> implements Map<K, V>,
        Cloneable, Serializable { @Override @SuppressWarnings("unchecked") public boolean containsValue(Object value) { if (value != null) { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } if (resizingIntoElementData == null) return false; if (value != null) { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } return false; } PauselessHashMap();  PauselessHashMap(int capacity);  PauselessHashMap(int capacity, float loadFactor);  PauselessHashMap(Map<? extends K, ? extends V> map); }
PauselessHashMap extends java.util.AbstractMap<K, V> implements Map<K, V>,
        Cloneable, Serializable { @Override @SuppressWarnings("unchecked") public boolean containsValue(Object value) { if (value != null) { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } if (resizingIntoElementData == null) return false; if (value != null) { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } return false; } PauselessHashMap();  PauselessHashMap(int capacity);  PauselessHashMap(int capacity, float loadFactor);  PauselessHashMap(Map<? extends K, ? extends V> map); @Override void clear(); @Override Object clone(); @Override boolean containsKey(Object key); @Override @SuppressWarnings("unchecked") boolean containsValue(Object value); @Override Set<Map.Entry<K, V>> entrySet(); @Override V get(Object key); @Override boolean isEmpty(); @Override Set<K> keySet(); @Override V put(K key, V value); @Override void putAll(Map<? extends K, ? extends V> map); @Override V remove(Object key); @Override int size(); @Override Collection<V> values(); }
PauselessHashMap extends java.util.AbstractMap<K, V> implements Map<K, V>,
        Cloneable, Serializable { @Override @SuppressWarnings("unchecked") public boolean containsValue(Object value) { if (value != null) { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < elementData.length; i++) { Entry<K, V> entry = elementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } if (resizingIntoElementData == null) return false; if (value != null) { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (areEqualValues(value, entry.value)) { return true; } entry = entry.next; } } } else { for (int i = 0; i < resizingIntoElementData.length; i++) { Entry<K, V> entry = resizingIntoElementData[i]; while (entry != null) { if (entry.value == null) { return true; } entry = entry.next; } } } return false; } PauselessHashMap();  PauselessHashMap(int capacity);  PauselessHashMap(int capacity, float loadFactor);  PauselessHashMap(Map<? extends K, ? extends V> map); @Override void clear(); @Override Object clone(); @Override boolean containsKey(Object key); @Override @SuppressWarnings("unchecked") boolean containsValue(Object value); @Override Set<Map.Entry<K, V>> entrySet(); @Override V get(Object key); @Override boolean isEmpty(); @Override Set<K> keySet(); @Override V put(K key, V value); @Override void putAll(Map<? extends K, ? extends V> map); @Override V remove(Object key); @Override int size(); @Override Collection<V> values();  }