public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { changed |= c.add(key); } } return changed; }
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { changed |= c.add(key); } } return changed; }
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { changed |= c.add(key); } } return changed; }
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { changed |= c.add(key); } } return changed; }
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { changed |= c.add(key); } } return changed; }
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { changed |= c.add(key); } } return changed; }
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { changed |= c.add(key); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Double, Long>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, tab[i + 1])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Double, Double>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, tab[i + 1])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Double, Double>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, tab[i + 1])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Double, Long>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, tab[i + 1])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Double, Double>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, tab[i + 1])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Float, Double>> c) { if (this.isEmpty()) return false; boolean changed = false; int[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, vals[i])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Double, Character>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] keys = set; char[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, vals[i])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Float, Float>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { int key; if ((key = (int) (entry = tab[i])) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, (int) (entry >>> 32))); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Float, Short>> c) { if (this.isEmpty()) return false; boolean changed = false; int[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, vals[i])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Float, Float>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { int key; if ((key = (int) (entry = tab[i])) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, (int) (entry >>> 32))); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Double, Float>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, vals[i])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Float, Double>> c) { if (this.isEmpty()) return false; boolean changed = false; int[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, vals[i])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Float, Integer>> c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { int key; if ((key = (int) (entry = tab[i])) < FREE_BITS) { changed |= c.add(new ImmutableEntry(key, (int) (entry >>> 32))); } } return changed; }