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