@Override public boolean test(short a, byte b) { return map.containsEntry(a, b); } });
@Override public boolean test(short a, byte b) { return map.containsEntry(a, b); } });
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; short key; if ((key = keys[i]) != free && key != removed) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break;
public static boolean containsAllEntries(final InternalShortByteMapOps map, Map<?, ?> another) { if (map == another) throw new IllegalArgumentException(); if (another instanceof ShortByteMap) { ShortByteMap m2 = (ShortByteMap) another; if (map.size() < m2.size()) return false; if (m2 instanceof InternalShortByteMapOps) { //noinspection unchecked return ((InternalShortByteMapOps) m2).allEntriesContainingIn(map); } return m2.forEachWhile(new ShortBytePredicate() { @Override public boolean test(short a, byte b) { return map.containsEntry(a, b); } }); } for (Map.Entry<?, ?> e : another.entrySet()) { if (!map.containsEntry((Short) e.getKey(), (Byte) e.getValue())) return false; } return true; }
short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; short key; if ((key = keys[i]) != free && key != removed) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break;
public static boolean containsAllEntries(final InternalShortByteMapOps map, Map<?, ?> another) { if (map == another) throw new IllegalArgumentException(); if (another instanceof ShortByteMap) { ShortByteMap m2 = (ShortByteMap) another; if (map.size() < m2.size()) return false; if (m2 instanceof InternalShortByteMapOps) { //noinspection unchecked return ((InternalShortByteMapOps) m2).allEntriesContainingIn(map); } return m2.forEachWhile(new ShortBytePredicate() { @Override public boolean test(short a, byte b) { return map.containsEntry(a, b); } }); } for (Map.Entry<?, ?> e : another.entrySet()) { if (!map.containsEntry((Short) e.getKey(), (Byte) e.getValue())) return false; } return true; }
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public boolean allEntriesContainingIn(InternalShortByteMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }