ReferenceEntry<K, V> next = head.getNextInWriteQueue();
      return (next == head) ? null : next;
    }

    @CheckForNull
    @Override
    public ReferenceEntry<K, V> poll() {
      ReferenceEntry<K, V> next = head.getNextInWriteQueue();
      if (next == head) {
        return null;
      }

      remove(next);
      return next;
    }

    @Override

      ReferenceEntry<K, V> next = head.getNextInWriteQueue();
      return (next == head) ? null : next;
    }

    @CheckForNull
    @Override
    public ReferenceEntry<K, V> poll() {
      ReferenceEntry<K, V> next = head.getNextInWriteQueue();
      if (next == head) {
        return null;
      }

      remove(next);
      return next;
    }

    @Override

return SelfDescribing SelfDescribing SelfDescribingValueI.next() Overview Package Class Use Tree Deprecated Index Help PREV NEXT FRAMES NO FRAMES All Classes org/hamcrest/class-use/StringDescription.html Overview Package Class Use Tree Deprecated Index Help PREV NEXT FRAMES NO FRAMES All Classes Uses of Class org.hamcrest.StringDescription No usage of org.hamcrest.StringDescription Overview Package Class Use Tree Deprecated Index Help PREV NEXT FRAMES NO FRAMES All Classes org/hamcrest/class-use/Ty...

    private final ReferenceEntry<K, V> next;

    public DummyEntry(K key, int hash, ReferenceEntry<K, V> next) {
      this.key = key;
      this.hash = hash;
      this.next = next;
    }

    public static <K, V> DummyEntry<K, V> create(
        K key, int hash, @Nullable ReferenceEntry<K, V> next) {
      return new DummyEntry<>(key, hash, next);
    }

    public void clearKey() {

    private final ReferenceEntry<K, V> next;

    public DummyEntry(K key, int hash, ReferenceEntry<K, V> next) {
      this.key = key;
      this.hash = hash;
      this.next = next;
    }

    public static <K, V> DummyEntry<K, V> create(
        K key, int hash, @Nullable ReferenceEntry<K, V> next) {
      return new DummyEntry<>(key, hash, next);
    }

    public void clearKey() {

mpl.class package org.codehaus.plexus.util; final synchronized class FastMap$EntryImpl implements java.util.Map$Entry { private Object _key; private Object _value; private int _index; private FastMap$EntryImpl _previous; private FastMap$EntryImpl _next; private FastMap$EntryImpl _before; private FastMap$EntryImpl _after; private void FastMap$EntryImpl(); public Object getKey(); public Object getValue(); public Object setValue(Object); public boolean equals(Object); public int hashCode(); public String...

 *
 * Each derivation can capture the next value or any intermediate objects for later closing.
 *
 * <p>A step can be the input to at most one derived step. Once you transform its value, catch its
 * exception, or combine it with others, you cannot do anything else with it, including declare it
 * to be the last step of the pipeline.
 *
 * <h4>Transforming</h4>
 *

void FastMap$KeySet$1(FastMap$KeySet); public void remove(); public boolean hasNext(); public Object next(); } org/codehaus/plexus/util/FastMap$EntryImpl.class package org.codehaus.plexus.util; final synchronized class FastMap$EntryImpl implements java.util.Map$Entry { private Object _key; private Object _value; private int _index; private FastMap$EntryImpl _previous; private FastMap$EntryImpl _next; private FastMap$EntryImpl _before; private FastMap$EntryImpl _after; private void FastMap$EntryImpl();...

mpl.class package org.codehaus.plexus.util; final synchronized class FastMap$EntryImpl implements java.util.Map$Entry { private Object _key; private Object _value; private int _index; private FastMap$EntryImpl _previous; private FastMap$EntryImpl _next; private FastMap$EntryImpl _before; private FastMap$EntryImpl _after; private void FastMap$EntryImpl(); public Object getKey(); public Object getValue(); public Object setValue(Object); public boolean equals(Object); public int hashCode(); public String...

    }
    Entry<K, ? extends V> entry1 = entryItr.next();
    K key1 = entry1.getKey();
    V value1 = entry1.getValue();
    checkEntryNotNull(key1, value1);
    // Do something that works for j2cl, where we can't call getDeclaredClass():
    EnumMap<K, V> enumMap = new EnumMap<>(singletonMap(key1, value1));
    while (entryItr.hasNext()) {
      Entry<K, ? extends V> entry = entryItr.next();
      K key = entry.getKey();