/** {@inheritDoc} */ @Override public void fastForEach(final Consumer<? super Short2BooleanMap.Entry> consumer) { final AbstractShort2BooleanMap.BasicEntry entry = new AbstractShort2BooleanMap.BasicEntry(); if (containsNullKey) { entry.key = key[n]; entry.value = value[n]; consumer.accept(entry); } for (int pos = n; pos-- != 0;) if (!((key[pos]) == ((short) 0))) { entry.key = key[pos]; entry.value = value[pos]; consumer.accept(entry); } } }
@Override public ObjectIterator<Short2BooleanMap.Entry> fastIterator() { return new ObjectIterator<Short2BooleanMap.Entry>() { int next = 0, curr = -1; final BasicEntry entry = new BasicEntry(); @Override public boolean hasNext() { return next < size; } @Override public Entry next() { if (!hasNext()) throw new NoSuchElementException(); entry.key = key[curr = next]; entry.value = value[next++]; return entry; } @Override public void remove() { if (curr == -1) throw new IllegalStateException(); curr = -1; final int tail = size-- - next--; System.arraycopy(key, next + 1, key, next, tail); System.arraycopy(value, next + 1, value, next, tail); } }; } @Override
/** {@inheritDoc} */ @Override public void fastForEach(final Consumer<? super Short2BooleanMap.Entry> consumer) { final AbstractShort2BooleanMap.BasicEntry entry = new AbstractShort2BooleanMap.BasicEntry(); if (containsNullKey) { entry.key = key[n]; entry.value = value[n]; consumer.accept(entry); } for (int pos = n; pos-- != 0;) if (!((key[pos]) == ((short) 0))) { entry.key = key[pos]; entry.value = value[pos]; consumer.accept(entry); } } }
/** {@inheritDoc} */ @Override public void fastForEach(final Consumer<? super Short2BooleanMap.Entry> consumer) { final AbstractShort2BooleanMap.BasicEntry entry = new AbstractShort2BooleanMap.BasicEntry(); for (int i = size, curr, next = first; i-- != 0;) { curr = next; next = (int) link[curr]; entry.key = key[curr]; entry.value = value[curr]; consumer.accept(entry); } } }
/** {@inheritDoc} */ @Override public void forEach(final Consumer<? super Short2BooleanMap.Entry> consumer) { if (containsNullKey) consumer.accept(new AbstractShort2BooleanMap.BasicEntry(key[n], value[n])); for (int pos = n; pos-- != 0;) if (!((key[pos]) == ((short) 0))) consumer.accept(new AbstractShort2BooleanMap.BasicEntry(key[pos], value[pos])); } /** {@inheritDoc} */
@Override public ObjectSet<Short2BooleanMap.Entry> short2BooleanEntrySet() { if (entries == null) entries = ObjectSets.singleton(new AbstractShort2BooleanMap.BasicEntry(key, value)); return entries; } /**
@Override public ShortBidirectionalIterator iterator(final short from) { return new KeySetIterator(short2BooleanEntrySet().iterator(new BasicEntry(from, (false)))); } @Override
@Override public Entry next() { if (!hasNext()) throw new NoSuchElementException(); return new AbstractShort2BooleanMap.BasicEntry(key[curr = next], value[next++]); } @Override
/** {@inheritDoc} */ @Override public void forEach(final Consumer<? super Short2BooleanMap.Entry> consumer) { for (int i = size, curr, next = first; i-- != 0;) { curr = next; next = (int) link[curr]; consumer.accept(new AbstractShort2BooleanMap.BasicEntry(key[curr], value[curr])); } } /** {@inheritDoc} */
@Override public ObjectSortedSet<Short2BooleanMap.Entry> short2BooleanEntrySet() { if (entries == null) entries = ObjectSortedSets.singleton(new AbstractShort2BooleanMap.BasicEntry(key, value), entryComparator(comparator)); return (ObjectSortedSet<Short2BooleanMap.Entry>) entries; } /**
/** {@inheritDoc} */ @Override public void forEach(final Consumer<? super Short2BooleanMap.Entry> consumer) { if (containsNullKey) consumer.accept(new AbstractShort2BooleanMap.BasicEntry(key[n], value[n])); for (int pos = n; pos-- != 0;) if (!((key[pos]) == ((short) 0))) consumer.accept(new AbstractShort2BooleanMap.BasicEntry(key[pos], value[pos])); } /** {@inheritDoc} */