transferKind.setBody(mockResponse, "I love puppies but hate spiders", 1)
    server.enqueue(mockResponse.build())

    // Make sure that calling skip() doesn't omit bytes from the cache.
    val request = Request.Builder().url(server.url("/")).build()
    val response1 = client.newCall(request).execute()
    val in1 = response1.body.source()
    assertThat(in1.readUtf8("I love ".length.toLong())).isEqualTo("I love ")

  public <T extends @Nullable Object> T[] toArray(T[] array) {
    return snapshotElementsToList().toArray(array);
  }

  /*
   * We'd love to use 'new ArrayList(this)' or 'list.addAll(this)', but
   * either of these would recurse back to us again!
   */
  private List<E> snapshotElementsToList() {
    List<E> list = newArrayListWithExpectedSize(size());

        if (cancelled) {
          // Unless it is cancelled, the delegate may continue being scheduled
          scheduledDelegate.cancel(mayInterruptIfRunning);

          /*
           * We'd love to also arrange for the inverse -- that is, to also automatically cancel this
           * future if scheduledDelegate is cancelled (as happens after the delegate executor is

    }

    /**
     * Gets the live streaming flag.
     * @return the live value
     */
    public String getLive() {
        return live;
    }

    /**
     * Sets the live streaming flag.
     * @param live the live value to set
     */
    public void setLive(final String live) {
        this.live = live;
    }

    @Override
    public String toString() {

  boolean allowsSelfLoops();

  /** Returns the order of iteration for the elements of {@link #nodes()}. */
  ElementOrder<N> nodeOrder();

  //
  // Element-level accessors
  //

  /**
   * Returns a live view of the nodes which have an incident edge in common with {@code node} in
   * this graph.
   *
   * <p>This is equal to the union of {@link #predecessors(Object)} and {@link #successors(Object)}.
   *

    if (comparator != null) { // can't use ? : because of javac bug 5080917
      return comparator;
    }
    return (Comparator<E>) Ordering.natural();
  }

  /**
   * Returns a live {@link Map} view whose keys are the contents of {@code set} and whose values are
   * computed on demand using {@code function}. To get an immutable <i>copy</i> instead, use {@link
   * #toMap(Iterable, Function)}.
   *

     */
    @Execute
    @Secured({ ROLE, ROLE + VIEW })
    public HtmlResponse move(final ListForm form) {
        saveToken();
        return doMove(form, 0);
    }

    /**
     * Handles pagination movement logic.
     *
     * @param form the list form containing current state
     * @param move the direction to move (-1 for previous, 0 for specific page, 1 for next)

  //
  // Network-level accessors
  //

  /** Returns all edges in this network, in the order specified by {@link #edgeOrder()}. */
  Set<E> edges();

  /**
   * Returns a live view of this network as a {@link Graph}. The resulting {@link Graph} will have
   * an edge connecting node A to node B if this {@link Network} has an edge connecting A to B.
   *

  fun invalidatesCache(method: String): Boolean =
    (
      method == "POST" ||
        method == "PATCH" ||
        method == "PUT" ||
        method == "DELETE" ||
        method == "MOVE"
    )

  @JvmStatic // Despite being 'internal', this method is called by popular 3rd party SDKs.
  fun requiresRequestBody(method: String): Boolean =
    (
      method == "POST" ||
        method == "PUT" ||

    // wait, so that entries have just 10 ms to live
    ticker.advance(ttl * 2 / 3, MILLISECONDS);

    assertThat(CacheTesting.expirationQueueSize(cache)).isEqualTo(10);
    assertThat(removalListener.getCount()).isEqualTo(0);

    int shift2 = shift1 + 10;
    loader.setValuePrefix(shift2);
    // fill with new data - has to live for 20 ms more
    for (int i = 0; i < 10; i++) {