final int f = (t = table) == null ? 0 : t.length; final Traverser<K, V> it = new Traverser<K, V>(t, f, 0, f); for (Node<K, V> p; (p = it.advance()) != null; ) { final V val = p.val; final Object v = m.get(p.key);
/** * Returns the hash code value for this {@link Map}, i.e., * the sum of, for each key-value pair in the map, * {@code key.hashCode() ^ value.hashCode()}. * * @return the hash code value for this map */ public int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) h += p.key.hashCode() ^ p.val.hashCode(); } return h; }
/** * Returns the hash code value for this {@link Map}, i.e., * the sum of, for each key-value pair in the map, * {@code key.hashCode() ^ value.hashCode()}. * * @return the hash code value for this map */ public int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) h += p.key.hashCode() ^ p.val.hashCode(); } return h; }
/** * Returns the hash code value for this {@link Map}, i.e., * the sum of, for each key-value pair in the map, * {@code key.hashCode() ^ value.hashCode()}. * * @return the hash code value for this map */ public int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) h += p.key.hashCode() ^ p.val.hashCode(); } return h; }
public final int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = map.table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { h += p.hashCode(); } } return h; }
public final int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = map.table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { h += p.hashCode(); } } return h; }
public final int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = map.table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { h += p.hashCode(); } } return h; }
public final int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = map.table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { h += p.hashCode(); } } return h; }
public final int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = map.table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { h += p.hashCode(); } } return h; }
final int f = (t = table) == null ? 0 : t.length; final Traverser<K, V> it = new Traverser<K, V>(t, f, 0, f); for (Node<K, V> p; (p = it.advance()) != null; ) { final V val = p.val; final Object v = m.get(p.key);
if ((t = table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { s.writeObject(p.key); s.writeObject(p.val);
if ((t = table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { s.writeObject(p.key); s.writeObject(p.val);
/** * Returns {@code true} if this map maps one or more keys to the * specified value. Note: This method may require a full traversal * of the map, and is much slower than method {@code containsKey}. * * @param value value whose presence in this map is to be tested * @return {@code true} if this map maps one or more keys to the * specified value * @throws NullPointerException if the specified value is null */ public boolean containsValue(final Object value) { if (value == null) throw new NullPointerException(); final Node<K, V>[] t; if ((t = table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { final V v; if ((v = p.val) == value || (v != null && value.equals(v))) return true; } } return false; }
/** * Returns {@code true} if this map maps one or more keys to the * specified value. Note: This method may require a full traversal * of the map, and is much slower than method {@code containsKey}. * * @param value value whose presence in this map is to be tested * @return {@code true} if this map maps one or more keys to the * specified value * @throws NullPointerException if the specified value is null */ public boolean containsValue(final Object value) { if (value == null) throw new NullPointerException(); final Node<K, V>[] t; if ((t = table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { final V v; if ((v = p.val) == value || (v != null && value.equals(v))) return true; } } return false; }
/** * Returns the hash code value for this {@link Map}, i.e., * the sum of, for each key-value pair in the map, * {@code key.hashCode() ^ value.hashCode()}. * * @return the hash code value for this map */ public int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) h += p.key.hashCode() ^ p.val.hashCode(); } return h; }
/** * Returns the hash code value for this {@link Map}, i.e., * the sum of, for each key-value pair in the map, * {@code key.hashCode() ^ value.hashCode()}. * * @return the hash code value for this map */ public int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) h += p.key.hashCode() ^ p.val.hashCode(); } return h; }
public final int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = map.table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { h += p.hashCode(); } } return h; }
public final int hashCode() { int h = 0; final Node<K, V>[] t; if ((t = map.table) != null) { final Traverser<K, V> it = new Traverser<K, V>(t, t.length, 0, t.length); for (Node<K, V> p; (p = it.advance()) != null; ) { h += p.hashCode(); } } return h; }