@Override public boolean test(long a, double b) { return map.containsEntry(a, b); } });
@Override public boolean test(long a, double b) { return map.containsEntry(a, b); } });
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; long key; if ((key = tab[i]) != free && key != removed) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break;
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; long key; if ((key = tab[i]) != free && key != removed) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break;
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
public static boolean containsAllEntries(final InternalLongDoubleMapOps map, Map<?, ?> another) { if (map == another) throw new IllegalArgumentException(); if (another instanceof LongDoubleMap) { LongDoubleMap m2 = (LongDoubleMap) another; if (map.size() < m2.size()) return false; if (m2 instanceof InternalLongDoubleMapOps) { //noinspection unchecked return ((InternalLongDoubleMapOps) m2).allEntriesContainingIn(map); } return m2.forEachWhile(new LongDoublePredicate() { @Override public boolean test(long a, double b) { return map.containsEntry(a, b); } }); } for (Map.Entry<?, ?> e : another.entrySet()) { if (!map.containsEntry((Long) e.getKey(), (Double) e.getValue())) return false; } return true; }
public static boolean containsAllEntries(final InternalLongDoubleMapOps map, Map<?, ?> another) { if (map == another) throw new IllegalArgumentException(); if (another instanceof LongDoubleMap) { LongDoubleMap m2 = (LongDoubleMap) another; if (map.size() < m2.size()) return false; if (m2 instanceof InternalLongDoubleMapOps) { //noinspection unchecked return ((InternalLongDoubleMapOps) m2).allEntriesContainingIn(map); } return m2.forEachWhile(new LongDoublePredicate() { @Override public boolean test(long a, double b) { return map.containsEntry(a, b); } }); } for (Map.Entry<?, ?> e : another.entrySet()) { if (!map.containsEntry((Long) e.getKey(), (Double) e.getValue())) return false; } return true; }
@Override public boolean allEntriesContainingIn(InternalLongDoubleMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }