try {
                        startLatch.await();
                        for (int j = 0; j < 100; j++) {
                            testTransformer.setName("thread" + threadId + "_iteration" + j);
                            String name = testTransformer.getName();
                            assertNotNull(name);
                            assertTrue(name.startsWith("thread"));
                        }

        t.url = null; // Null URL
        t.numIter = 0; // No iterations to avoid NPE

        // Should not throw exception
        assertDoesNotThrow(() -> t.run(), "run() should handle null URL gracefully");
        assertEquals(1, t.numComplete, "numComplete should still be incremented");
    }

    @Test
    @DisplayName("run method handles zero iterations")
    void testRunWithZeroIterations() {

                        innerCount++;
                    }
                }
                assertEquals(0, innerCount, "Inner iteration should not execute");
            }
            assertEquals(0, outerCount, "Outer iteration should not execute");
        }, "EmptyIterator should work correctly in nested iteration");
    }

    @Test
    @DisplayName("EmptyIterator should follow Iterator contract for empty collections")

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

        verify(filter, times(2)).accept(resource);
        verify(resource, times(2)).close();
    }

    @Test
    @DisplayName("Multiple iterations")
    void multipleIterations() {
        // Setup for three items

                        try {
                            // Mix of success and failure
                            final int iteration = i;
                            String result = circuitBreaker.executeWithCircuitBreaker(() -> {
                                if ((threadId + iteration) % 10 == 0) {
                                    throw new RuntimeException("Simulated failure");
                                }

     * with each iteration, so this algorithm takes O(log(digits)) iterations.
     *
     * We start out with a double-precision approximation, which may be higher or lower than the
     * true value. Therefore, we perform at least one Newton iteration to get a guess that's
     * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point.
     */
    BigInteger sqrt0;
    int log2 = log2(x, FLOOR);

        # args, so each arg winds up back in the position where it started, but
        # possibly modified.
        #
        # NB: a `for` loop captures its iteration list before it begins, so
        # changing the positional parameters here affects neither the number of
        # iterations, nor the values presented in `arg`.
        shift                   # remove old arg
        set -- "$@" "$arg"      # push replacement arg
    done
fi

 *
 * Class<?> someClass = ...;
 * for (Class<?> clazz : iterable(someClass)) {
 *     ...
 * }
 * </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
 */

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({

  /**
   * 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()}
   */