@Override public void clear() { AbstractShort2BooleanMap.this.clear(); } @Override
@Override public boolean contains(final short k) { return containsKey(k); } @Override
@Override public boolean contains(final boolean k) { return containsValue(k); } @Override
@Override public boolean equals(Object o) { if (o == this) return true; if (!(o instanceof Map)) return false; final Map<?, ?> m = (Map<?, ?>) o; if (m.size() != size()) return false; return short2BooleanEntrySet().containsAll(m.entrySet()); } @Override
@Override public int size() { return AbstractShort2BooleanMap.this.size(); } @Override
@Override public void putAll(Map<? extends Short, ? extends Boolean> m) { if (f <= .5) ensureCapacity(m.size()); // The resulting map will be sized for m.size() elements else tryCapacity(size() + m.size()); // The resulting map will be tentatively sized for size() + m.size() // elements super.putAll(m); }
@Override public boolean containsValue(final boolean v) { return values().contains(v); } @Override
/** {@inheritDoc} */ @SuppressWarnings({"unchecked", "deprecation"}) @Override public void putAll(final Map<? extends Short, ? extends Boolean> m) { if (m instanceof Short2BooleanMap) { ObjectIterator<Short2BooleanMap.Entry> i = Short2BooleanMaps.fastIterator((Short2BooleanMap) m); while (i.hasNext()) { final Short2BooleanMap.Entry e = i.next(); put(e.getShortKey(), e.getBooleanValue()); } } else { int n = m.size(); final Iterator<? extends Map.Entry<? extends Short, ? extends Boolean>> i = m.entrySet().iterator(); Map.Entry<? extends Short, ? extends Boolean> e; while (n-- != 0) { e = i.next(); put(e.getKey(), e.getValue()); } } } /**
@Override public boolean containsKey(final short k) { final ObjectIterator<Short2BooleanMap.Entry> i = short2BooleanEntrySet().iterator(); while (i.hasNext()) if (i.next().getShortKey() == k) return true; return false; } @Override
@Override public boolean isEmpty() { return size() == 0; } /**
@Override public void putAll(Map<? extends Short, ? extends Boolean> m) { if (f <= .5) ensureCapacity(m.size()); // The resulting map will be sized for m.size() elements else tryCapacity(size() + m.size()); // The resulting map will be tentatively sized for size() + m.size() // elements super.putAll(m); }
@Override public int size() { return AbstractShort2BooleanMap.this.size(); } @Override
@Override public void clear() { AbstractShort2BooleanMap.this.clear(); } @Override
/** * Returns a hash code for this map. * * The hash code of a map is computed by summing the hash codes of its entries. * * @return a hash code for this map. */ @Override public int hashCode() { int h = 0, n = size(); final ObjectIterator<Short2BooleanMap.Entry> i = Short2BooleanMaps.fastIterator(this); while (n-- != 0) h += i.next().hashCode(); return h; } @Override
@Override public String toString() { final StringBuilder s = new StringBuilder(); final ObjectIterator<Short2BooleanMap.Entry> i = Short2BooleanMaps.fastIterator(this); int n = size(); Short2BooleanMap.Entry e; boolean first = true; s.append("{"); while (n-- != 0) { if (first) first = false; else s.append(", "); e = i.next(); s.append(String.valueOf(e.getShortKey())); s.append("=>"); s.append(String.valueOf(e.getBooleanValue())); } s.append("}"); return s.toString(); } }