sneakyThrow(exception);
    }
  }

  /**
   * Returns a {@link Stream} containing the elements of the first stream, followed by the elements
   * of the second stream, and so on.
   *
   * <p>This is equivalent to {@code Stream.of(streams).flatMap(stream -> stream)}, but the returned
   * stream may perform better.
   *
   * @see Stream#concat(Stream, Stream)
   */

        Map<String, Object> dataMap = new HashMap<>();

        // First addition
        transformer.putResultDataBody(dataMap, "tags", "tag1");

        // Second addition with array
        String[] tags2 = new String[] { "tag2", "tag3" };
        transformer.putResultDataBody(dataMap, "tags", tags2);

        // Third addition with another array

    Serialization.writeMultiset(this, stream);
  }

  /**
   * @serialData the {@code Class<E>} for the enum type, the number of distinct elements, the first
   *     element, its count, the second element, its count, and so on
   */
  @GwtIncompatible // java.io.ObjectInputStream
  private void readObject(ObjectInputStream stream) throws IOException, ClassNotFoundException {
    stream.defaultReadObject();

		throughputHighestGet := uint64(0)
		throughputHighestPut := uint64(0)
		var throughputHighestResults []SpeedTestResult

		sendResult := func() {
			var result madmin.SpeedTestResult

			durationSecs := opts.duration.Seconds()

			result.GETStats.ThroughputPerSec = throughputHighestGet / uint64(durationSecs)
			result.GETStats.ObjectsPerSec = throughputHighestGet / uint64(opts.objectSize) / uint64(durationSecs)

      "ConnectionReleased",
    )
  }

  @Test
  fun failedCallEventSequence() {
    server.enqueue(
      MockResponse
        .Builder()
        .headersDelay(2, TimeUnit.SECONDS)
        .build(),
    )
    client =
      client
        .newBuilder()
        .readTimeout(Duration.ofMillis(250))
        .build()
    val call =
      client.newCall(
        Request

    //    were added to the queue. It's easily possible for one thread to take the head of the
    //    queue, immediately followed by another thread taking the next element in the queue. That
    //    second thread can then dispatch to the subscriber it took before the first thread does.
    //
    // All this makes me really wonder if there's any value in queueing here at all. A dispatcher

import static com.google.common.collect.Iterators.peekingIterator;
import static java.nio.charset.StandardCharsets.UTF_8;
import static java.util.Objects.requireNonNull;
import static java.util.concurrent.TimeUnit.SECONDS;

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import com.google.common.base.CharMatcher;
import com.google.common.base.Defaults;

 - Apply that

IMPORTANT: There is an option in **Gradle** for **Automatic Project Synchronization**.
           As convenient as it'd be for the projects to always be perfect this
           tends to add many many seconds to every branch change. Instead, you
           should manually right click on a project and
           **Gradle > Refresh Gradle Project** if the configuration is out of
           date.

            latch.countDown();
        }, e -> {
            latch.countDown();
        });

        // ## Assert ##
        assertTrue("Async execution should complete within 5 seconds", latch.await(5, TimeUnit.SECONDS));
        assertNotNull(threadName.get());
        // The async execution should have run on a ForkJoinPool thread, not the main thread
        assertTrue("Should run on ForkJoinPool thread: " + threadName.get(),

        this.cacheTemplateName = cacheTemplateName;
    }

    /**
     * Sets the facet cache duration in seconds.
     *
     * @param facetCacheDuration the cache duration in seconds
     */
    public void setFacetCacheDuration(final long facetCacheDuration) {
        this.facetCacheDuration = facetCacheDuration;
    }

    /**