}

    @Override
    Iterator<Entry<K, V>> entryIterator() {
      return Iterators.filter(unfiltered.entrySet().iterator(), entryPredicate);
    }

    @Override
    Iterator<Entry<K, V>> descendingEntryIterator() {
      return Iterators.filter(unfiltered.descendingMap().entrySet().iterator(), entryPredicate);
    }

    @Override
    public int size() {

    }

    @Override
    Iterator<Entry<K, V>> entryIterator() {
      return Iterators.filter(unfiltered.entrySet().iterator(), entryPredicate);
    }

    @Override
    Iterator<Entry<K, V>> descendingEntryIterator() {
      return Iterators.filter(unfiltered.descendingMap().entrySet().iterator(), entryPredicate);
    }

    @Override
    public int size() {

synchronized class FastMap$KeySet$1 implements java.util.Iterator { FastMap$EntryImpl after; FastMap$EntryImpl before; void FastMap$KeySet$1(FastMap$KeySet); public void remove(); public boolean hasNext(); public Object next(); } org/codehaus/plexus/util/FastMap$KeySet.class package org.codehaus.plexus.util; synchronized class FastMap$KeySet extends java.util.AbstractSet { private void FastMap$KeySet(FastMap); public java.util.Iterator iterator(); public int size(); public boolean contains(Object);...

    }

    @Override
    public Iterator<V> iterator() {
      return new ValueIterator();
    }

    @Override
    public boolean contains(Object o) {
      return LocalCache.this.containsValue(o);
    }
  }

  final class EntrySet extends AbstractCacheSet<Entry<K, V>> {

    @Override
    public Iterator<Entry<K, V>> iterator() {
      return new EntryIterator();
    }

          return null;
        }

        @Override
        public int size() {
          return 0;
        }

        @Override
        public Iterator<Object> iterator() {
          return ImmutableSet.of().iterator();
        }
      };

  /** Queue that discards all elements. */
  @SuppressWarnings("unchecked") // impl never uses a parameter or returns any non-null value

		v.mustBe(Map)
	}
	iter.m = v
	iter.hiter = hiter{}
}

// MapRange returns a range iterator for a map.
// It panics if v's Kind is not [Map].
//
// Call [MapIter.Next] to advance the iterator, and [MapIter.Key]/[MapIter.Value] to access each entry.
// [MapIter.Next] returns false when the iterator is exhausted.
// MapRange follows the same iteration semantics as a range statement.
//
// Example:
//

}

def NameAnonymousIteratorsPass : Pass<"tf-name-anonymous-iterators", "ModuleOp"> {
  let summary = "Converts anonymous iterators to named iterators";
  let description = [{
      This converts AnonymousIterator ops to Iterator, thus giving them a name.
      For example, this will convert
        %0 = "tf.AnonymousIteratorV3"() {...}
      to
        %0 = "tf.Iterator"() {shared_name = "_iterator1", ...}
  }];

        .body("c")
        .build(),
    )
    val urlC = server.url("/c")
    assertThat(get(urlC).body.string()).isEqualTo("c")

    // Confirm the iterator returns those responses...
    val i: Iterator<String> = cache.urls()
    assertThat(i.hasNext()).isTrue()
    assertThat(i.next()).isEqualTo(urlA.toString())
    assertThat(i.hasNext()).isTrue()

        if (reportSetMap == null) {
            reportSetMap = new java.util.LinkedHashMap<String, ReportSet>();
            if (getReportSets() != null) {
                for (java.util.Iterator<ReportSet> i = getReportSets().iterator(); i.hasNext(); ) {
                    ReportSet reportSet = (ReportSet) i.next();
                    reportSetMap.put(reportSet.getId(), reportSet);
                }
            }
        }

    return failure();
  }

  // Get the sizes
  const auto input_size = input_type.getNumElements();
  const auto output_size = output_type.getNumElements();

  // Get iterators to the tensors.
  const auto input_values_it = input_tensor.getValues<float>().begin();
  const auto weights_values_ptr = weights_tensor.getValues<float>().begin();
  auto weights_row_it = weights_values_ptr;