multipartReader.use {
      while (true) {
        val part = multipartReader.nextPart() ?: break
        process(part.headers, part.body)
      }
    }
    ```

 *  New: `MediaType.parameter()` gets a parameter like `boundary` from a media type like
    `multipart/mixed; boundary="abc"`.

 *  New: `Authenticator.JAVA_NET_AUTHENTICATOR` forwards authentication requests to

            if (fields != null) {
                requestBuilder.setFetchSource(fields, null);
            }
            return true;
        });
    }

    /**
     * Gets the total number of documents that match the specified query.
     *
     * @param searchEngineClient the search engine client to use for the count
     * @param queryBuilder the query to count documents for

    int hashTableBits = Integer.SIZE - Integer.numberOfLeadingZeros(mask);
    metadata =
        CompactHashing.maskCombine(metadata, hashTableBits, CompactHashing.HASH_TABLE_BITS_MASK);
  }

  /** Gets the hash table mask using the stored number of hash table bits. */
  private int hashTableMask() {
    return (1 << (metadata & CompactHashing.HASH_TABLE_BITS_MASK)) - 1;
  }

  void incrementModCount() {

            stk.peek().location = "missing";
            validator.accept(fa.getMissing());
            stk.pop();
            stk.pop();
        });
        root.map(Activation::getOs).ifPresent(oa -> {
            stk.push(new ActivationFrame("os", Optional.of(oa)));
            stk.push(new ActivationFrame("arch", Optional.empty()));
            validator.accept(oa.getArch());

    int hashTableBits = Integer.SIZE - Integer.numberOfLeadingZeros(mask);
    metadata =
        CompactHashing.maskCombine(metadata, hashTableBits, CompactHashing.HASH_TABLE_BITS_MASK);
  }

  /** Gets the hash table mask using the stored number of hash table bits. */
  private int hashTableMask() {
    return (1 << (metadata & CompactHashing.HASH_TABLE_BITS_MASK)) - 1;
  }

  void incrementModCount() {

      return this;
    }

    /**
     * By default, if we are handed a value collection bigger than expectedValuesPerKey, presize to
     * accept that many elements.
     *
     * <p>This gets overridden in ImmutableSetMultimap.Builder to only trust the size of {@code
     * values} if it is a Set and therefore probably already deduplicated.
     */

func (c *Connection) reconnected() {
	c.updateState(StateConnectionError)
	c.reconnects.Add(1)

	// Drain the outQueue, so any blocked messages can be sent.
	// We keep the queue, but start draining it, if it gets full.
	stopDraining := make(chan struct{})
	var wg sync.WaitGroup
	wg.Add(1)
	defer func() {
		close(stopDraining)
		wg.Wait()
	}()
	go func() {
		defer wg.Done()
		for {
			select {

    CountDownLatch thirdSignal = new CountDownLatch(1);
    // tells the main thread when the third get has started
    CountDownLatch fourthSignal = new CountDownLatch(1);
    // tells the test when all gets have returned
    CountDownLatch doneSignal = new CountDownLatch(count);

    CacheLoader<String, String> computeFunction =
        new CacheLoader<String, String>() {
          @Override

    server.enqueue(
      MockResponse(body = "This gets leaked."),
    )
    client =
      clientTestRule
        .newClientBuilder()
        .connectionPool(ConnectionPool(0, 10, TimeUnit.MILLISECONDS))
        .build()
    val request = Request(server.url("/"))
    client.newCall(request).execute() // Ignore the response so it gets leaked then GC'd.
    awaitGarbageCollection()

        if (this.disallowCompound == null) {
            return true;
        }
        return !this.disallowCompound.contains(command);
    }

    /**
     * Gets the batch limit for a specific command
     *
     * @param cmd the command to get the batch limit for
     * @return the batch limit for the command, or null if not set
     */