}

  @LazyInit @RetainedWith @CheckForNull Set<Entry<K, V>> entrySet;

  @Override
  @GwtIncompatible // Not supported.
  public Set<Entry<K, V>> entrySet() {
    // does not impact recency ordering
    Set<Entry<K, V>> es = entrySet;
    return (es != null) ? es : (entrySet = new EntrySet());
  }

  // Iterator Support

        Map<K, V> map, Predicate<? super Entry<K, V>> entryPredicate, Collection<?> keyCollection) {
      Iterator<Entry<K, V>> entryItr = map.entrySet().iterator();
      boolean result = false;
      while (entryItr.hasNext()) {
        Entry<K, V> entry = entryItr.next();
        if (entryPredicate.apply(entry) && keyCollection.contains(entry.getKey())) {
          entryItr.remove();
          result = true;
        }

        Map<K, V> map, Predicate<? super Entry<K, V>> entryPredicate, Collection<?> keyCollection) {
      Iterator<Entry<K, V>> entryItr = map.entrySet().iterator();
      boolean result = false;
      while (entryItr.hasNext()) {
        Entry<K, V> entry = entryItr.next();
        if (entryPredicate.apply(entry) && keyCollection.contains(entry.getKey())) {
          entryItr.remove();
          result = true;
        }

equals(Object); public int hashCode(); public String toString(); } org/codehaus/plexus/util/FastMap$EntrySet$1.class package org.codehaus.plexus.util; synchronized class FastMap$EntrySet$1 implements java.util.Iterator { FastMap$EntryImpl after; FastMap$EntryImpl before; void FastMap$EntrySet$1(FastMap$EntrySet); public void remove(); public boolean hasNext(); public Object next(); } org/codehaus/plexus/util/FastMap$EntrySet.class package org.codehaus.plexus.util; synchronized class FastMap$EntrySet extends j...

	// Entry 40 - 5F
	0x00000001827c0813, 0x000000014240385f, 0x0000000103c1c813, 0x000000011e420813,
	0x0000000112000001, 0x0000000106000001, 0x0000000101400001, 0x000000010a000001,
	0x0000000102020001,
}

// regionInclusionNext marks, for each entry in regionInclusionBits, the set of
// all groups that are reachable from the groups set in the respective entry.
// Size: 73 bytes, 73 elements

equals(Object); public int hashCode(); public String toString(); } org/codehaus/plexus/util/FastMap$EntrySet$1.class package org.codehaus.plexus.util; synchronized class FastMap$EntrySet$1 implements java.util.Iterator { FastMap$EntryImpl after; FastMap$EntryImpl before; void FastMap$EntrySet$1(FastMap$EntrySet); public void remove(); public boolean hasNext(); public Object next(); } org/codehaus/plexus/util/FastMap$EntrySet.class package org.codehaus.plexus.util; synchronized class FastMap$EntrySet extends j...

	R_386_TLS_IE_32     R_386 = 33 /* 32 bit offset to GOT static TLS offset entry */
	R_386_TLS_LE_32     R_386 = 34 /* 32 bit offset within static TLS block */
	R_386_TLS_DTPMOD32  R_386 = 35 /* GOT entry containing TLS index */
	R_386_TLS_DTPOFF32  R_386 = 36 /* GOT entry containing TLS offset */
	R_386_TLS_TPOFF32   R_386 = 37 /* GOT entry of -ve static TLS offset */
	R_386_SIZE32        R_386 = 38

equals(Object); public int hashCode(); public String toString(); } org/codehaus/plexus/util/FastMap$EntrySet$1.class package org.codehaus.plexus.util; synchronized class FastMap$EntrySet$1 implements java.util.Iterator { FastMap$EntryImpl after; FastMap$EntryImpl before; void FastMap$EntrySet$1(FastMap$EntrySet); public void remove(); public boolean hasNext(); public Object next(); } org/codehaus/plexus/util/FastMap$EntrySet.class package org.codehaus.plexus.util; synchronized class FastMap$EntrySet extends j...

                addMethod(ACC_STATIC, "<clinit>", "()V", methodVisitor -> new MethodVisitorScope(methodVisitor) {{
                    for (Map.Entry<java.lang.reflect.Type, ReturnTypeEntry> entry : genericReturnTypeConstantsIndex.entrySet()) {
                        ReturnTypeEntry returnType = entry.getValue();
                        addField(PV_FINAL_STATIC, returnType.fieldName, JAVA_REFLECT_TYPE_DESCRIPTOR);

  }

  @LazyInit @RetainedWith @CheckForNull Set<Entry<K, V>> entrySet;

  @Override
  @GwtIncompatible // Not supported.
  public Set<Entry<K, V>> entrySet() {
    // does not impact recency ordering
    Set<Entry<K, V>> es = entrySet;
    return (es != null) ? es : (entrySet = new EntrySet());
  }

  // Iterator Support