public int hashCode() { Object val = getValue(); return hash ^ (val == null ? 0 : val.hashCode()); }
public int hashCode() { Object val = getValue(); return hash ^ (val == null ? 0 : val.hashCode()); }
public int hashCode() { Object val = getValue(); return hash ^ (val == null ? 0 : val.hashCode()); }
public int hashCode() { Object val = getValue(); return hash ^ (val == null ? 0 : val.hashCode()); }
public String toString() { return getKey() + "=" + getValue(); } }
public String toString() { return getKey() + "=" + getValue(); } }
public boolean equals(Object o) { if (!(o instanceof Map.Entry)) return false; Map.Entry e = (Map.Entry) o; return eq(getKey(), e.getKey()) && eq(getValue(), e.getValue()); }
public boolean equals(Object o) { if (!(o instanceof Map.Entry)) return false; Map.Entry e = (Map.Entry) o; return eq(getKey(), e.getKey()) && eq(getValue(), e.getValue()); }
public Object clone(ReferenceQueue queue) { // It is the callers responsibility to set the next field // correctly. return new WeakEntry(hash, getKey(), getValue(), keyRef, null, queue); }
public String toString() { return getKey() + "=" + getValue(); } }
public String toString() { return getKey() + "=" + getValue(); } }
public boolean equals(Object o) { if (!(o instanceof Map.Entry)) return false; Map.Entry e = (Map.Entry) o; return eq(getKey(), e.getKey()) && eq(getValue(), e.getValue()); }
public Object clone(ReferenceQueue queue) { // It is the callers responsibility to set the next field // correctly. return new WeakEntry(hash, getKey(), getValue(), keyRef, null, queue); }
public boolean equals(Object o) { if (!(o instanceof Map.Entry)) return false; Map.Entry e = (Map.Entry) o; return eq(getKey(), e.getKey()) && eq(getValue(), e.getValue()); }
public Object clone(ReferenceQueue queue) { // It is the callers responsibility to set the next field // correctly. return new WeakEntry(hash, getKey(), getValue(), keyRef, null, queue); }
public Object clone(ReferenceQueue queue) { // It is the callers responsibility to set the next field // correctly. return new WeakEntry(hash, getKey(), getValue(), keyRef, null, queue); }