List<@Nullable String> list = new ArrayList<>();
                for (String element : elements) {
                  list.add((element == null) ? null : "q" + element);
                }
                return Collections2.transform(
                    list, from -> isNullOrEmpty(from) ? null : from.substring(1));
              }
            })
        .named("Collections2.transform")
        .withFeatures(

    }

    @Override
    public @Nullable K higherKey(@ParametricNullness K key) {
      return sortedMap().higherKey(key);
    }

    @Override
    public @Nullable Entry<K, Collection<V>> firstEntry() {
      Entry<K, Collection<V>> entry = sortedMap().firstEntry();
      return (entry == null) ? null : wrapEntry(entry);
    }

    @Override

      ExecutionException ee = null;
      long lastTime = timed ? System.nanoTime() : 0;
      Iterator<? extends Callable<T>> it = tasks.iterator();

      futures.add(submitAndAddQueueListener(executorService, it.next(), futureQueue));
      --ntasks;
      int active = 1;

      while (true) {
        Future<T> f = futureQueue.poll();
        if (f == null) {
          if (ntasks > 0) {

    }

    @Test
    void testWrapMethodIsCalled() throws DcerpcException {
        // Test that the wrap method can be called without throwing an exception
        dcerpcSecurityProvider.wrap(mockNdrBuffer);

        // Verify that the wrap method was called exactly once with the mockNdrBuffer
        verify(dcerpcSecurityProvider, times(1)).wrap(mockNdrBuffer);
    }

    @Test

     *     {@code lock}, or {@code null} if no path was found.
     */
    private @Nullable ExampleStackTrace findPathTo(LockGraphNode node, Set<LockGraphNode> seen) {
      if (!seen.add(this)) {
        return null; // Already traversed this node.
      }
      ExampleStackTrace found = allowedPriorLocks.get(node);
      if (found != null) {
        return found; // Found a path ending at the node!

   *     been added to the filter. Note that {@code put(t)} always returns the <i>opposite</i>
   *     result to what {@code mightContain(t)} would have returned at the time it is called.
   * @since 12.0 (present in 11.0 with {@code void} return type})
   */
  @CanIgnoreReturnValue
  public boolean put(@ParametricNullness T object) {
    return strategy.put(object, funnel, numHashFunctions, bits);

  private val atomicRequestCount = AtomicInteger()

  private var serverSocketFactory_: ServerSocketFactory? = null
  private var serverSocket: ServerSocket? = null

  /** Non-null after [start]. */
  private var socketAddress_: InetSocketAddress? = null

  private var sslSocketFactory: SSLSocketFactory? = null
  private var clientAuth = CLIENT_AUTH_NONE

  private var closed: Boolean = false

  /**

   *
   * <p>Example:
   *
   * {@snippet :
   * Ordering.allEqual().nullsLast().sortedCopy(
   *     asList(t, null, e, s, null, t, null))
   * }
   *
   * <p>Assuming {@code t}, {@code e} and {@code s} are non-null, this returns {@code [t, e, s, t,
   * null, null, null]} regardless of the true comparison order of those three values (which might
   * not even implement {@link Comparable} at all).
   *

        // Verify MinIO client is not initialized before connect() is called
        assertNull(getField(conn, "minioClient"));
    }

    /**
     * Test that connect() method fails when STORAGE_ENDPOINT is not set.
     */
    public void test_connect_failsWithoutEndpoint() throws Exception {
        URL url = new URL("storage://mybucket/object.txt");

    // If a clear() happens close to the end of computation, one of two things should happen:
    // - computation ends first: the removal listener is called, and the cache does not contain the
    //   key/value pair
    // - clear() happens first: the removal listener is not called, and the cache contains the pair
    AtomicBoolean computationShouldWait = new AtomicBoolean();
    CountDownLatch computationLatch = new CountDownLatch(1);