public void putAll(Collection<? extends K> keyColl) { if (f <= .5) ensureCapacity(keyColl.size()); // The resulting map will be sized for // keyColl.size() elements else tryCapacity(size() + keyColl.size()); // The resulting map will be // tentatively sized for size() + keyColl.size() elements Iterator<? extends K> it = keyColl.iterator(); while (it.hasNext()) add(it.next()); }
@Override public void putAll(Map<? extends K, ? extends Integer> 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 int n = m.size(); final Iterator<? extends K> i = m .keySet().iterator(); while (n-- != 0) { add(i.next()); } }
public Arrangement(final Arrangement<? extends K> a) { this(a.size(), a.f, a.hasher); ensureCapacity(a.size()); // The resulting map will be sized for System.arraycopy(a.key, 0, key, 0, a.key.length); System.arraycopy(a.value, 0, value, 0, a.value.length); order.addAll(a.order); containsNullKey = a.containsNullKey; }
public void putAll(K[] keyArray) { int n = keyArray.length; if (f <= .5) ensureCapacity(n); // The resulting map will be sized for // m.size() elements else tryCapacity(size() + n); // The resulting map will be // tentatively sized for size() + keyArray.length elements for (int i = 0; i < n; i++) { add(keyArray[i]); } }