localDelegate.execute(this);
        }
      } finally {
        // Important to null this out here - if we did *not* execute inline, we might still
        // run() on the same thread that called execute() - such as in a thread pool, and think
        // that it was happening inline. As a side benefit, avoids holding on to the Thread object
        // longer than necessary.
        submitting = null;
      }
    }

        o -> orElseNull(o), Comparator.nullsLast(valueComparator));
  }

  @IgnoreJRERequirement // helper for emptiesFirst+emptiesLast
  /*
   * If we make these calls inline inside the lambda inside emptiesFirst()/emptiesLast(), we get an
   * Animal Sniffer error, despite the @IgnoreJRERequirement annotation there. For details, see
   * ImmutableSortedMultiset.
   */

 * there are multiple `this` objects in scope.
 */
interface Lockable

internal inline fun Lockable.wait() = (this as Object).wait()

internal inline fun Lockable.notify() = (this as Object).notify()

internal inline fun Lockable.notifyAll() = (this as Object).notifyAll()

internal inline fun Lockable.awaitNanos(nanos: Long) {
  val ms = nanos / 1_000_000L
  val ns = nanos - (ms * 1_000_000L)

      return inline.invokeAll(tasks, timeout, unit);
    }

    // Define the invokeAny methods to invoke the first task
    @Override
    public <T> T invokeAny(Collection<? extends Callable<T>> tasks)
        throws ExecutionException, InterruptedException {
      assertTaskWrapped(tasks);
      lastMethodCalled = "invokeAny";
      return inline.submit(Iterables.get(tasks, 0)).get();
    }

žùç°§MetaSys ¼x-minio-internal-inline-dataÄ true§MetaUsr‚¤etagÙ 14a1119d5fe668d77000¬content-type¸application/octet-stream¡v Î@<ÉD ¤nullÄ7ÇZß ã?øO¼¡*gý V‰}z† Ír­!ù¬· 0Âéÿ S e ÚòP9WËpè‚ Jó±% multisitea/data/disterasure/xl12/bucket/2/xl.meta XL2 Æ i Ä$•Ä Ó É ¥— HÄ ABGJ Å =ƒ¤Type ¥V2ObjÞ ¢IDÄ ¤DDirÄ ¹Ü±Ÿ>!HÈ’¹Ž¦iÄ ÷¦EcAlgo £EcM £EcN §EcBSizeÒ §EcIndex ¦EcDistœ ¨CSumAlgo ¨PartNums‘ ©PartETagsÀ©PartSizes‘|ªPartASizes‘|¤Size|¥MTimeÓ É ¥— H§MetaSys ¼x-minio-internal-inline-dataÄ true§MetaUsr‚¬content-typeªtext/plain¤etagÙ...

```

### More technical details { #more-technical-details }

You might have noticed that `await` can only be used inside of functions defined with `async def`.

But at the same time, functions defined with `async def` have to be "awaited". So, functions with `async def` can only be called inside of functions defined with `async def` too.

So, about the egg and the chicken, how do you call the first `async` function?

  inline cpp_impl *unwrap(wrapper *w) {                                        \
    return reinterpret_cast<cpp_impl *>(w);                                    \
  }                                                                            \
                                                                               \
  inline const cpp_impl *unwrap(const wrapper *w) {                            \

Ensure to set the following header `x-minio-extract` to `true` in your S3 requests.

## How to access to files inside a ZIP archive

Accessing to contents inside an archive can be done using regular S3 API with a modified request path. You just need to append the path of the content inside the archive to the path of the archive itself.

e.g.:

      return inline.invokeAll(tasks, timeout, unit);
    }

    // Define the invokeAny methods to invoke the first task
    @Override
    public <T> T invokeAny(Collection<? extends Callable<T>> tasks)
        throws ExecutionException, InterruptedException {
      assertTaskWrapped(tasks);
      lastMethodCalled = "invokeAny";
      return inline.submit(Iterables.get(tasks, 0)).get();
    }

 *    119 : Ignored.
 *    120 : Valid.
 *    121 : Disallowed
 *    122 : Mapped inline to the sequence: [b2].
 *    123 : Mapped inline to the sequence: [b2a].
 *    124 : Mapped inline to the sequence: [b2, b3].
 *    125 : Mapped inline to the sequence: [b2a, b3].
 *    126 : Mapped inline to the sequence: [b2, b3a].
 *    127 : Mapped inline to the sequence: [b2a, b3a].
 *
 * The range goes until the beginning of the next range.
 *