@Override public boolean test(Object a, long b) { return map.containsEntry(a, b); } });
@Override public boolean test(Object a, long b) { return map.containsEntry(a, b); } });
@Override public boolean allEntriesContainingIn(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) 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(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) 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(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) 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(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
if (!m.containsEntry(key, vals[i])) { containsAll = false; break; if (!m.containsEntry(key, vals[i])) { containsAll = false; break;
if (!m.containsEntry(key, vals[i])) { containsAll = false; break; if (!m.containsEntry(key, vals[i])) { containsAll = false; break;
@Override public boolean allEntriesContainingIn(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) 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(InternalObjLongMapOps<?> m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); Object[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { if (!m.containsEntry(key, vals[i])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
if (!map.containsEntry(e.getKey(), (Long) e.getValue())) return false;
if (!map.containsEntry(e.getKey(), (Long) e.getValue())) return false;