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