* the given {@code comparator}.
   *
   * <p>In detail, this method asserts
   *
   * <ul>
   *   <li><i>reflexivity</i>: {@code comparator.compare(t, t) = 0} for all {@code t} in {@code
   *       valuesInExpectedOrder}; and
   *   <li><i>consistency</i>: {@code comparator.compare(ti, tj) < 0} and {@code
   *       comparator.compare(tj, ti) > 0} for {@code i < j}, where {@code ti =

   * Multimap} entries in two distinct modes:
   *
   * <ul>
   *   <li>To output a separate entry for each key-value pair, pass {@code multimap.entries()} to a
   *       {@code MapJoiner} method that accepts entries as input, and receive output of the form
   *       {@code key1=A&key1=B&key2=C}.
   *   <li>To output a single entry for each key, pass {@code multimap.asMap()} to a {@code

   * by delaying the per-stack-frame work until each element is accessed. Roughly speaking:
   *
   * <ul>
   *   <li>{@code getStackTrace} takes {@code stackSize} time to return but then negligible time to
   *       retrieve each element of the returned list.
   *   <li>{@code lazyStackTrace} takes negligible time to return but then {@code 1/stackSize} time

    return new IteratorOperation() {
      @Override
      public @Nullable Object execute(Iterator<?> iterator) {
        @SuppressWarnings("unchecked")
        ListIterator<E> li = (ListIterator<E>) iterator;
        li.set(toInsert);
        return null;
      }
    };
  }

  abstract static class Stimulus<E extends @Nullable Object, T extends Iterator<E>> {
    private final String toString;

   * by delaying the per-stack-frame work until each element is accessed. Roughly speaking:
   *
   * <ul>
   *   <li>{@code getStackTrace} takes {@code stackSize} time to return but then negligible time to
   *       retrieve each element of the returned list.
   *   <li>{@code lazyStackTrace} takes negligible time to return but then {@code 1/stackSize} time

      this.size = calculateSize(inputList, comparator);
    }

    /**
     * The number of permutations with repeated elements is calculated as follows:
     *
     * <ul>
     *   <li>For an empty list, it is 1 (base case).
     *   <li>When r numbers are added to a list of n-r elements, the number of permutations is
     *       increased by a factor of (n choose r).
     * </ul>
     */
    private static <E> int calculateSize(

      this.size = calculateSize(inputList, comparator);
    }

    /**
     * The number of permutations with repeated elements is calculated as follows:
     *
     * <ul>
     *   <li>For an empty list, it is 1 (base case).
     *   <li>When r numbers are added to a list of n-r elements, the number of permutations is
     *       increased by a factor of (n choose r).
     * </ul>
     */
    private static <E> int calculateSize(

 * graph. The following test cases are left for the subclasses to handle:
 *
 * <ul>
 *   <li>Test cases related to whether the graph is directed, undirected, mutable, or immutable.
 *   <li>Test cases related to the specific implementation of the {@link Network} interface.
 * </ul>
 *
 * TODO(user): Make this class generic (using <N, E>) for all node and edge types.

 * graph. The following test cases are left for the subclasses to handle:
 *
 * <ul>
 *   <li>Test cases related to whether the graph is directed, undirected, mutable, or immutable.
 *   <li>Test cases related to the specific implementation of the {@link Network} interface.
 * </ul>
 *
 * TODO(user): Make this class generic (using <N, E>) for all node and edge types.

çnÐÎÍ 0Ø ‚Ù$73c9f651-f023-4566-b012-cc537fdb7ce2Ä’A0§i ˆ»°u•‡ðU ^sF" :5›…— ú >õ’È4> . çòH¯icaMLNpG¾ÙìpöÊ 4 ,A¼yL„cÁÐÚîÑðÍÉzêê ¼yL„c·ÀÀôñßÜïÖGþr Ž‡´’ª€¬µˆ G[ðõ‹©lI pNÈGš“ 0 $ ²€ùáDq µjuqZœÒÙ$1f163718-9bc5-4b01-bff7-5d8cf09caf10Ä’A0§i ˆ»°u•‡ðU ^sF" :5›…— ú >õ’È4> . çòH¯icaMLNpG¾ÙìpöÊ 4 ,A¼yL„cÁÐÚîÑðÍÉzêê ¼yL„c·ÀÀôñßÜïÖGþr Ž‡´’ª€¬µˆ G[ðõ‹©lI pNÈGš“ 0 $ ²€ùáDq µjuqZœÒ xl5/testbucket/hosts/xl.meta XL2 Æ n Ä$ Ä Ó ¹ô O/>Ä _ÒU_ Å B €Type ¥V2ObjÞ ¢IDÄ €DDirÄ Ö¥`°IÔ Ÿ 4þÄÿ ŠEcAlgo £EcM £EcN §EcBSizeÒ §EcIndex...