<exclude>%regex[.*[$]\d+.class]</exclude>
            </excludes>
            <redirectTestOutputToFile>true</redirectTestOutputToFile>
            <runOrder>alphabetical</runOrder>
            <!-- Set max heap for tests. -->
            <!-- Catch dependencies on the default locale by setting it to hi-IN. -->
            <argLine>-Xmx1536M -Duser.language=hi -Duser.country=IN ${test.add.opens}</argLine>
          </configuration>

      // set the flow control window to 16MiB.  This avoids thrashing window updates every 64KiB, yet
      // small enough to avoid blowing up the heap.
      if (builder.client) {
        set(Settings.INITIAL_WINDOW_SIZE, OKHTTP_CLIENT_WINDOW_SIZE)
      }
    }

  /**

    private void readObject(ObjectInputStream stream) throws IOException, ClassNotFoundException {
    stream.defaultReadObject();
    int size = stream.readInt();
    init(16); // resist hostile attempts to allocate gratuitous heap
    Serialization.populateMap(this, stream, size);
  }

  // TODO(cpovirk): Should we have a serialVersionUID here?

    final Queue<IndexedIterator<T>> queue;

    MergingIterator(
        Iterable<? extends Iterator<? extends T>> iterators, Comparator<? super T> itemComparator) {
      // A comparator that's used by the heap, allowing the heap
      // to be sorted based on the top of each iterator, with insertion order as tiebreaker
      Comparator<IndexedIterator<T>> heapComparator =
          (o1, o2) ->
              ComparisonChain.start()

    final Queue<IndexedIterator<T>> queue;

    MergingIterator(
        Iterable<? extends Iterator<? extends T>> iterators, Comparator<? super T> itemComparator) {
      // A comparator that's used by the heap, allowing the heap
      // to be sorted based on the top of each iterator, with insertion order as tiebreaker
      Comparator<IndexedIterator<T>> heapComparator =
          (o1, o2) ->
              ComparisonChain.start()

   * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in
   * less allocation, but also having the GC do less work to scan the heap because of fewer
   * references, which is particularly hard to quantify.
   */

  /** Creates an empty {@code CompactHashMap} instance. */
  public static <K extends @Nullable Object, V extends @Nullable Object>

            test.exclude("**/*$*.class");

            test.jvmArgs(
                "-Xmx" + System.getProperty("tests.heap.size", "512m"),
                "-Xms" + System.getProperty("tests.heap.size", "512m"),
                "--illegal-access=deny",
                // TODO: only open these for mockito when it is modularized

   * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in
   * less allocation, but also having the GC do less work to scan the heap because of fewer
   * references, which is particularly hard to quantify.
   */

  /** Creates an empty {@code CompactHashMap} instance. */
  public static <K extends @Nullable Object, V extends @Nullable Object>

start counter as 64-bit limbs offset uint64 // for XORKeyStream only } func NewCTR(b *Block, iv []byte) *CTR { // Allocate the CTR here, in an easily inlineable function, so // the allocation can be done in the caller's stack frame // instead of the heap. See issue 70499. c := newCTR(b, iv) return &c } func newCTR(b *Block, iv []byte) CTR { if len(iv) != BlockSize { panic("bad IV length") } return CTR{ b: *b, ivlo: byteorder.BEUint64(iv[8:16]), ivhi: byteorder.BEUint64(iv[0:8]), offset: 0, } } func...

start counter as 64-bit limbs offset uint64 // for XORKeyStream only } func NewCTR(b *Block, iv []byte) *CTR { // Allocate the CTR here, in an easily inlineable function, so // the allocation can be done in the caller's stack frame // instead of the heap. See issue 70499. c := newCTR(b, iv) return &c } func newCTR(b *Block, iv []byte) CTR { if len(iv) != BlockSize { panic("bad IV length") } return CTR{ b: *b, ivlo: byteorder.BEUint64(iv[8:16]), ivhi: byteorder.BEUint64(iv[0:8]), offset: 0, } } func...