* }
 * </pre>
 * <p>
 * By default, the {@link Object} class is also included in the iteration. If you do not want to include {@link Object},
 * specify {@literal false} for the second argument of {@link #iterable(Class, boolean)} or {@link #ClassIterator(Class, boolean)}.
 * </p>
 *
 * @author koichik
 */
public class ClassIterator implements Iterator<Class<?>> {

    /** The class */
    protected Class<?> clazz;

public interface PeekingIterator<E extends @Nullable Object> extends Iterator<E> {
  /**
   * Returns the next element in the iteration, without advancing the iteration.
   *
   * <p>Calls to {@code peek()} should not change the state of the iteration, except that it
   * <i>may</i> prevent removal of the most recent element via {@link #remove()}.
   *
   * @throws NoSuchElementException if the iteration has no more elements according to {@link
   *     #hasNext()}

    void testTryWithResources() {
        // When & Then
        assertDoesNotThrow(() -> {
            try (EmptyIterator iterator = new EmptyIterator()) {
                assertFalse(iterator.hasNext(), "Iterator should be empty in try-with-resources");
                assertNull(iterator.next(), "Iterator should return null in try-with-resources");
            } catch (CIFSException e) {
                throw new RuntimeException(e);

import com.google.common.collect.BenchmarkHelpers.SetImpl;
import com.google.common.collect.CollectionBenchmarkSampleData.Element;
import java.util.Set;
import org.jspecify.annotations.NullUnmarked;

/**
 * Test iteration speed at various size for {@link Set} instances.
 *
 * @author Christopher Swenson
 */
@NullUnmarked
public class SetIterationBenchmark {
  @Param({

    this.e4 = e4;
  }

  @Override
  public Iterator<E> iterator() {
    return asList().iterator();
  }

  public List<E> asList() {
    return Arrays.asList(e0(), e1(), e2(), e3(), e4());
  }

  public static class Strings extends SampleElements<String> {
    public Strings() {
      // elements aren't sorted, to better test SortedSet iteration ordering
      super("b", "a", "c", "d", "e");
    }

    this.e4 = e4;
  }

  @Override
  public Iterator<E> iterator() {
    return asList().iterator();
  }

  public List<E> asList() {
    return Arrays.asList(e0(), e1(), e2(), e3(), e4());
  }

  public static class Strings extends SampleElements<String> {
    public Strings() {
      // elements aren't sorted, to better test SortedSet iteration ordering
      super("b", "a", "c", "d", "e");
    }

import com.google.caliper.Param;
import com.google.common.base.Preconditions;
import java.util.Random;
import org.jspecify.annotations.NullUnmarked;

/**
 * Tests the speed of iteration of different iteration methods for collections.
 *
 * @author David Richter
 */
@NullUnmarked
public class MultisetIteratorBenchmark {
  @Param({"0", "1", "16", "256", "4096", "65536"})
  int size;

  }

  /**
   * Returns an immutable copy of the provided table.
   *
   * <p>The {@link Table#cellSet()} iteration order of the provided table determines the iteration
   * ordering of all views in the returned table. Note that some views of the original table and the
   * copied table may have different iteration orders. For more control over the ordering, create a

        TestIterator iterator = new TestIterator(null);

        // Verify iteration
        assertTrue(iterator.hasNext());
        assertSame(resource, iterator.next());

        assertTrue(iterator.hasNext());
        assertSame(resource, iterator.next());

        assertTrue(iterator.hasNext());
        assertSame(resource, iterator.next());

        assertFalse(iterator.hasNext());

    } else {
      return RegularImmutableMultiset.create(entries);
    }
  }

  ImmutableMultiset() {}

  @Override
  public UnmodifiableIterator<E> iterator() {
    Iterator<Entry<E>> entryIterator = entrySet().iterator();
    return new UnmodifiableIterator<E>() {
      int remaining;
      @Nullable E element;

      @Override
      public boolean hasNext() {