@Override public boolean test(/* raw */byte a, /* raw */short b) { return map.containsEntry(a, b); } });
@Override public boolean test(/* raw */byte a, /* raw */short b) { return map.containsEntry(a, b); } });
@Override public boolean allEntriesContainingIn(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; byte free = freeValue; byte[] keys = set; short[] 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(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; byte free = freeValue; byte[] keys = set; short[] 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(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; byte free = freeValue; byte[] keys = set; short[] 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(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; byte free = freeValue; byte[] keys = set; short[] 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; }
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(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); byte free = freeValue; byte[] keys = set; short[] 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(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); byte free = freeValue; byte[] keys = set; short[] 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(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); byte free = freeValue; byte[] keys = set; short[] 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(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); byte free = freeValue; byte[] keys = set; short[] 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(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); byte free = freeValue; byte[] keys = set; short[] 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(InternalByteShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true; int mc = modCount(); byte free = freeValue; byte[] keys = set; short[] 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; }
if (!map.containsEntry(/* if !(obj key) */(Byte) /* endif */e.getKey(), /* if !(obj value) */(Short) /* endif */e.getValue())) return false;
if (!map.containsEntry(/* if !(obj key) */(Byte) /* endif */e.getKey(), /* if !(obj value) */(Short) /* endif */e.getValue())) return false;