* this builder to sort entries by value.
   *
   * <p>Builder instances can be reused - it is safe to call {@link #buildOrThrow} multiple times to
   * build multiple bimaps in series. Each bimap is a superset of the bimaps created before it.
   *
   * @since 2.0
   */
  public static final class Builder<K, V> extends ImmutableMap.Builder<K, V> {
    /**

        MockNode nodeWithClass = new MockNode("div");
        nodeWithClass.addAttribute("class", "highlight");
        assertTrue(tag.matches(nodeWithClass));

        // Node with multiple classes including target
        MockNode nodeWithMultipleClasses = new MockNode("div");
        nodeWithMultipleClasses.addAttribute("class", "container highlight active");

        assertFalse(searchRequestParams.hasConditionQuery());
    }

    public void test_hasConditionQuery_withMultipleEmptyQueries() {
        // Test with multiple empty strings
        testParams.conditions.put(SearchRequestParams.AS_Q, new String[] { "", "  ", null });
        assertFalse(searchRequestParams.hasConditionQuery());
    }

    }
  }

  private fun ensureAllTaskQueuesIdle() {
    val entryTime = System.nanoTime()

    for (queue in TaskRunner.INSTANCE.activeQueues()) {
      // We wait at most 1 second, so we don't ever turn multiple lost threads into
      // a test timeout failure.
      val waitTime = (entryTime + 1_000_000_000L - System.nanoTime())
      if (!queue.idleLatch().await(waitTime, TimeUnit.NANOSECONDS)) {

///

## Combining information { #combining-information }

You can also combine response information from multiple places, including the `response_model`, `status_code`, and `responses` parameters.

 * passing in unsanitized user data then a malicious user could force it. A light shuffle of the
 * data using an unpredictable seed should normally be enough to thwart this attack.
 *
 * <p>The time taken to compute multiple quantiles on the same dataset using {@link Scale#indexes
 * indexes} is generally less than the total time taken to compute each of them separately, and

        // Test with leading/trailing spaces
        result = execJob.logSuffix("  another suffix  ");
        assertEquals("another_suffix", execJob.logSuffix);

        // Test with multiple spaces
        result = execJob.logSuffix("multi  space  suffix");
        assertEquals("multi__space__suffix", execJob.logSuffix);
    }

    // Test timeout setter
    public void test_timeout() {

     */
    long deadline = System.nanoTime() + unit.toNanos(timeout);
    int added = 0;
    while (added < numElements) {
      // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple
      // elements already available (e.g. LinkedBlockingQueue#drainTo locks only once)
      added += q.drainTo(buffer, numElements - added);

import java.util.Set;
import java.util.function.BiConsumer;
import org.jspecify.annotations.Nullable;

/**
 * A collection that maps keys to values, similar to {@link Map}, but in which each key may be
 * associated with <i>multiple</i> values. You can visualize the contents of a multimap either as a
 * map from keys to <i>nonempty</i> collections of values:
 *
 * <ul>
 *   <li>a → 1, 2
 *   <li>b → 3
 * </ul>
 *

        // Decode with excess length
        Referral referral2 = new Referral();
        decodedSize = referral2.decode(testBuffer, 0, 512);
        assertEquals(24, decodedSize);
    }

    // Multiple Expanded Names Tests

    @Test
    public void testSingleExpandedName() {
        ByteBuffer bb = ByteBuffer.wrap(testBuffer).order(ByteOrder.LITTLE_ENDIAN);

        bb.putShort((short) 3);