return hasCycle(network.asGraph());
  }

  /**
   * Performs a traversal of the nodes reachable from {@code startNode}. If we ever reach a node
   * we've already visited (following only outgoing edges and without reusing edges), we know
   * there's a cycle in the graph.
   */
  private static <N> boolean subgraphHasCycle(
      Graph<N> graph, Map<Object, NodeVisitState> visitedNodes, N startNode) {

    elements.add(null);
    collection = getSubjectGenerator().create(elements.toArray());
    assertEquals(
        "A Set's hashCode() should be the sum of those of its elements (with "
            + "a null element counting as having a hash of zero).",
        expectedHashCode,
        getSet().hashCode());
  }

  /**
   * Returns the {@link Method} instances for the test methods in this class which call {@code

            }
            return id;
        }
    }

    /**
     * Statistics data object that stores timestamped events and maintains reference counting.
     * Extends LinkedHashMap to store event names mapped to their timestamps.
     * Includes reference counting for multi-threaded access tracking.
     */
    public static class StatsObject extends LinkedHashMap<String, Long> {

    assertThat(cookie.name).isEqualTo("a")
    assertThat(cookie.value).isEqualTo("android")
    assertThat(cookie.commentURL).isNull()
    assertThat(cookie.discard).isFalse()
    // Converting to a fixed date can cause rounding!
    assertThat(cookie.maxAge.toDouble()).isCloseTo(60.0, 5.0)
    assertThat(cookie.path).isEqualTo("/path")
    assertThat(cookie.secure).isTrue()
  }

  @Test
  fun testQuotedAttributeValues() {

        // even if you set true manually and forget to set false back
        direction.directFrameworkDebug(fessConfig.isFrameworkDebug()); // basically false

        // you can add your own process when your application is booting or closing
        direction.directCurtainBefore(createCurtainBeforeHook());
        direction.directCurtainFinally(createCurtainFinallyHook()); // when destroy

        direction.directSecurity(createSecurityResourceProvider());

import com.google.caliper.BeforeExperiment;
import com.google.caliper.Benchmark;
import com.google.caliper.Param;
import java.math.BigInteger;
import org.jspecify.annotations.NullUnmarked;

/**
 * Benchmarks for the non-rounding methods of {@code BigIntegerMath}.
 *
 * @author Louis Wasserman
 */
@NullUnmarked
public class BigIntegerMathBenchmark {
  private static final int[] factorials = new int[ARRAY_SIZE];

import com.google.caliper.BeforeExperiment;
import com.google.caliper.Benchmark;
import com.google.caliper.Param;
import java.math.BigInteger;
import org.jspecify.annotations.NullUnmarked;

/**
 * Benchmarks for the non-rounding methods of {@code BigIntegerMath}.
 *
 * @author Louis Wasserman
 */
@NullUnmarked
public class BigIntegerMathBenchmark {
  private static final int[] factorials = new int[ARRAY_SIZE];

    ArrayList<ListenableFuture<Integer>> lengthChecks = new ArrayList<>();
    List<Integer> completeLengthChecks;
    int baseStackDepth;
    ExecutorService service = newFixedThreadPool(5);
    try {
      // Avoid counting frames from the executor itself, or the ExecutionSequencer
      baseStackDepth =
          serializer
              .submit(
                  new Callable<Integer>() {
                    @Override

 * number of streams, dynamically configured with `SETTINGS_MAX_CONCURRENT_STREAMS`. A connection
 * currently carrying zero streams is an idle stream. We keep it alive because reusing an existing
 * connection is typically faster than establishing a new one.
 *
 * When a single logical call requires multiple streams due to redirects or authorization

 * **Exchange** carries a single HTTP request/response pair.

 * **ExchangeFinder** chooses which connection carries each exchange. Where possible it will use the same connection for all exchanges in a single call. It prefers reusing pooled connections over establishing new connections.      

#### Per-Connection Locks