// Copyright (c) 2015-2023 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

// Copyright (c) 2015-2022 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

// Copyright (c) 2015-2021 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

   * value that are {@linkplain Range#isConnected connected} to this range.
   *
   * <p>The behavior of {@link #get(Comparable) get(k)} after calling this method is identical to
   * the behavior described in {@link #put(Range, Object) put(range, value)}, however the ranges
   * returned from {@link #asMapOfRanges} will be different if there were existing entries which
   * connect to the given range and value.
   *

        private final byte[] salt;
        private final int hashAlgorithm;
        private volatile byte[] currentHash;
        private volatile boolean isValid;
        private final Object hashLock = new Object();

        public PreauthIntegrityContext(byte[] salt, int hashAlgorithm) {
            this.salt = salt != null ? salt.clone() : new byte[0];
            this.hashAlgorithm = hashAlgorithm;

        super(url, auth);
        this.pipeType = pipeType;
        type = TYPE_NAMED_PIPE;
    }

    /**
     * Constructs an SmbNamedPipe from a URL object.
     *
     * @param url the URL object representing the named pipe
     * @param pipeType the type of the pipe
     * @param auth the authentication credentials to use
     * @throws MalformedURLException if the URL is not properly formatted

     */
    protected abstract void doSend(Request request) throws IOException;

    /**
     * Receives a response from the remote endpoint.
     *
     * @param response the response object to populate
     * @throws IOException if an I/O error occurs
     */
    protected abstract void doRecv(Response response) throws IOException;

    /**
     * Skips an unexpected or unrecognized message.

Вы должны увидеть очень длинный JavaScript-файл для **ReDoc**.

Он может начинаться примерно так:

```JavaScript
/*! For license information please see redoc.standalone.js.LICENSE.txt */
!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t(require("null")):
...
```

Это подтверждает, что ваше приложение умеет отдавать статические файлы и что вы поместили файлы документации в нужное место.

    public void test_evaluate_returnCollections() {
        final Map<String, Object> params = new HashMap<>();

        // List
        final Object listResult = groovyEngine.evaluate("return [1, 2, 3]", params);
        assertNotNull(listResult);
        assertTrue(listResult instanceof java.util.List);

        // Map
        final Object mapResult = groovyEngine.evaluate("return [key: 'value']", params);

   */
  static boolean safeRemove(Collection<?> collection, @Nullable Object object) {
    checkNotNull(collection);
    try {
      return collection.remove(object);
    } catch (ClassCastException | NullPointerException e) {
      return false;
    }
  }

  static class FilteredCollection<E extends @Nullable Object> extends AbstractCollection<E> {
    final Collection<E> unfiltered;