* #incidentNodes(Object)}). If this network does not {@link #allowsParallelEdges() allow parallel
   * edges}, the resulting set will contain at most one edge (equivalent to {@code
   * edgeConnecting(endpoints).asSet()}).
   *
   * <p>If this network is directed, {@code endpoints} must be ordered.
   *
   * <p>If either element of {@code endpoints} is removed from the network after this method is

   *
   * Client configuration may be used to make follow-up decisions, such as:
   *
   *  * [OkHttpClient.followRedirects] must be true to follow redirects.
   *  * [OkHttpClient.followSslRedirects] must be true to follow redirects that add or remove HTTPS.
   *  * [OkHttpClient.authenticator] must respond to an authorization challenge.
   *
   * @param networkResponse the intermediate response that may require a follow-up request.

      checkEmpty(entrySet);
      checkEmpty(cache);
    }
  }

  /* ---------------- Local utilities -------------- */

  /** Most of the tests in this class run against every one of these caches. */
  private Iterable<LoadingCache<Object, Object>> caches() {
    // lots of different ways to configure a LoadingCache

        // Since it returns a Set, duplicates should be handled by URL comparison
        // The exact behavior depends on RequestData.equals() implementation
        assertTrue("Should have at most 5 items", result.size() <= 5);
    }

 * allowed to be reclaimed if nobody is holding on to them. This is useful, for example, if one
 * wants to create a {@code Striped<Lock>} of many locks, but worries that in most cases only a
 * small portion of these would be in use.
 *
 * <p>Prior to this class, one might be tempted to use {@code Map<K, Lock>}, where {@code K}

            if (polled == null) {
                break;
            }
            count++;
        }

        assertTrue(count <= 2); // At most 2 items (may be deduplicated)
        urlQueueService.delete(sessionId);
    }

 * method equivalent to {@link java.util.concurrent.locks.ReentrantLock#hasQueuedThread(Thread)}. If
 * the {@link #callAndAssertWaits} method is ever called in a test, the lock-like object must have a
 * method equivalent to {@link
 * java.util.concurrent.locks.ReentrantLock#hasWaiters(java.util.concurrent.locks.Condition)},

import java.util.logging.Logger
import okhttp3.TestUtil.threadFactory

/**
 * Runs a [TaskRunner] in a controlled environment so that everything is sequential and
 * deterministic.
 *
 * This class ensures that at most one thread is running at a time. This is initially the JUnit test
 * thread, which yields its execution privilege while calling [runTasks], [runNextTask], or

   * new method with the existing behavior; we believe that most callers will want to use the {@code
   * ADD_SELF_LOOPS_FOR_CYCLES} strategy.
   *
   * @since 33.1.0 (present with return type {@code Graph} since 20.0)
   * @deprecated Use {@link #transitiveClosure(Graph, TransitiveClosureSelfLoopStrategy)} instead.
   */
  @SuppressWarnings("InlineMeSuggester") // We expect most users to want to change behavior.
  @Deprecated

 *
 * <p>The <dfn>Dependency graph flattening</dfn> process in Maven reduces a complex,
 * multi-level dependency graph to a map of ordered lists that can be turned into classpaths.
 * During this process only the most relevant version of each artifact
 * (based on group ID and artifact ID) is retained, resolving conflicts and eliminating duplicates to ensure
 * that each dependency is included only once in the final build.</p>
 *