@Override public boolean test(float a, short b) { return map.containsEntry(a, b); } });
@Override public void accept(float key, short value) { map.justPut(key, value); } });
public static boolean containsAllEntries(final InternalFloatShortMapOps map, Map<?, ?> another) { if (map == another) throw new IllegalArgumentException(); if (another instanceof FloatShortMap) { FloatShortMap m2 = (FloatShortMap) another; if (map.size() < m2.size()) return false; if (m2 instanceof InternalFloatShortMapOps) { //noinspection unchecked return ((InternalFloatShortMapOps) m2).allEntriesContainingIn(map); } return m2.forEachWhile(new FloatShortPredicate() { @Override public boolean test(float a, short b) { return map.containsEntry(a, b); } }); } for (Map.Entry<?, ?> e : another.entrySet()) { if (!map.containsEntry((Float) e.getKey(), (Short) e.getValue())) return false; } return true; }
public static void putAll(final InternalFloatShortMapOps map, Map<? extends Float, ? extends Short> another) { if (map == another) throw new IllegalArgumentException(); long maxPossibleSize = map.sizeAsLong() + Containers.sizeAsLong(another); map.ensureCapacity(maxPossibleSize); if (another instanceof FloatShortMap) { if (another instanceof InternalFloatShortMapOps) { ((InternalFloatShortMapOps) another).reversePutAllTo(map); } else { ((FloatShortMap) another).forEach(new FloatShortConsumer() { @Override public void accept(float key, short value) { map.justPut(key, value); } }); } } else { for (Map.Entry<? extends Float, ? extends Short> e : another.entrySet()) { map.justPut(e.getKey(), e.getValue()); } } }
public static void putAll(final InternalFloatShortMapOps map, Map<? extends Float, ? extends Short> another) { if (map == another) throw new IllegalArgumentException(); long maxPossibleSize = map.sizeAsLong() + Containers.sizeAsLong(another); map.ensureCapacity(maxPossibleSize); if (another instanceof FloatShortMap) { if (another instanceof InternalFloatShortMapOps) { ((InternalFloatShortMapOps) another).reversePutAllTo(map); } else { ((FloatShortMap) another).forEach(new FloatShortConsumer() { @Override public void accept(float key, short value) { map.justPut(key, value); } }); } } else { for (Map.Entry<? extends Float, ? extends Short> e : another.entrySet()) { map.justPut(e.getKey(), e.getValue()); } } }
@Override public void accept(float key, short value) { map.justPut(key, value); } });
@Override public boolean test(float a, short b) { return map.containsEntry(a, b); } });
public static boolean containsAllEntries(final InternalFloatShortMapOps map, Map<?, ?> another) { if (map == another) throw new IllegalArgumentException(); if (another instanceof FloatShortMap) { FloatShortMap m2 = (FloatShortMap) another; if (map.size() < m2.size()) return false; if (m2 instanceof InternalFloatShortMapOps) { //noinspection unchecked return ((InternalFloatShortMapOps) m2).allEntriesContainingIn(map); } return m2.forEachWhile(new FloatShortPredicate() { @Override public boolean test(float a, short b) { return map.containsEntry(a, b); } }); } for (Map.Entry<?, ?> e : another.entrySet()) { if (!map.containsEntry((Float) e.getKey(), (Short) e.getValue())) return false; } return true; }
@Override public void reversePutAllTo(InternalFloatShortMapOps m) { if (this.isEmpty()) return; int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } }
@Override public boolean allEntriesContainingIn(InternalFloatShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public void reversePutAllTo(InternalFloatShortMapOps m) { if (this.isEmpty()) return; int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } }
@Override public boolean allEntriesContainingIn(InternalFloatShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public void reversePutAllTo(InternalFloatShortMapOps m) { if (this.isEmpty()) return; int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } }
@Override public boolean allEntriesContainingIn(InternalFloatShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public void reversePutAllTo(InternalFloatShortMapOps m) { if (this.isEmpty()) return; int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } }
@Override public boolean allEntriesContainingIn(InternalFloatShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public void reversePutAllTo(InternalFloatShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public boolean allEntriesContainingIn(InternalFloatShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public void reversePutAllTo(InternalFloatShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public boolean allEntriesContainingIn(InternalFloatShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }