}

  /**
   * Updates the pointers of the insertion order linked list so that {@code next} follows {@code
   * prev}. {@code ENDPOINT} represents either the first or last entry in the entire map (as
   * appropriate).
   */
  private void setSucceeds(int prev, int next) {
    if (prev == ENDPOINT) {
      firstInInsertionOrder = next;
    } else {
      nextInInsertionOrder[prev] = next;
    }

		dstRecords, err = globalDNSConfig.Get(dstBucket)
		if err != nil {
			writeErrorResponse(ctx, w, toAPIError(ctx, err), r.URL)
			return
		}

		// Send PutObject request to appropriate instance (in federated deployment)
		core, rerr := getRemoteInstanceClient(r, getHostFromSrv(dstRecords))
		if rerr != nil {
			writeErrorResponse(ctx, w, toAPIError(ctx, rerr), r.URL)
			return
		}

    @Throws(IOException::class)
    abstract fun onStream(stream: Http2Stream)

    /**
     * Notification that the connection's peer's settings may have changed to [settings].
     * Implementations should take appropriate action to handle the updated settings.
     *
     * Methods to this method may be made concurrently with [onStream]. But a calls to this method
     * are serialized.
     */
    open fun onSettings(

 *
 * <p>There are two ways to obtain a {@code Stats} instance:
 *
 * <ul>
 *   <li>If all the values you want to summarize are already known, use the appropriate {@code
 *       Stats.of} factory method below. Primitive arrays, iterables and iterators of any kind of
 *       {@code Number}, and primitive varargs are supported.

 *
 * @author Doug Lea
 * @author Justin T. Sampson
 * @param <E> the type of elements held in this collection
 */
// TODO(kak): consider removing some of the @CanIgnoreReturnValue annotations as appropriate
@NullUnmarked
@GwtIncompatible
@J2ktIncompatible
public class MonitorBasedArrayBlockingQueue<E> extends AbstractQueue<E>
    implements BlockingQueue<E> {

interprets them in // little-endian, and rejects values higher than q, until it drew 256 // values. (The rejection rate is approximately 19%.) // // To do this from a bytes stream, it draws three bytes at a time, and // splits them into two uint16 appropriately masked. // // r₀ r₁ r₂ // |- - - - - - - -|- - - - - - - -|- - - - - - - -| // // Uint16(r₀ || r₁) // |- - - - - - - - - - - - - - - -| // |- - - - - - - - - - - -| // d₁ // // Uint16(r₁ || r₂) // |- - - - - - - - - - - - - - - -| // |- - - - -...

interprets them in // little-endian, and rejects values higher than q, until it drew 256 // values. (The rejection rate is approximately 19%.) // // To do this from a bytes stream, it draws three bytes at a time, and // splits them into two uint16 appropriately masked. // // r₀ r₁ r₂ // |- - - - - - - -|- - - - - - - -|- - - - - - - -| // // Uint16(r₀ || r₁) // |- - - - - - - - - - - - - - - -| // |- - - - - - - - - - - -| // d₁ // // Uint16(r₁ || r₂) // |- - - - - - - - - - - - - - - -| // |- - - - -...

				return
			}

			fivs, err := entry.fileInfoVersions(bucket)
			if err != nil {
				return
			}

			// We need a reversed order for rebalance,
			// to create the appropriate stack.
			versionsSorter(fivs.Versions).reverse()

			var rebalanced, expired int
			for _, version := range fivs.Versions {

			}
			pad := blockPadding(int64(len(spb)))
			spb = append(spb, zeroBlock[:pad]...)
			hdr.Size += int64(len(spb)) // Accounts for encoded sparse map

			// Add and modify appropriate PAX records.
			dir, file := path.Split(realName)
			hdr.Name = path.Join(dir, "GNUSparseFile.0", file)
			paxHdrs[paxGNUSparseMajor] = "1"
			paxHdrs[paxGNUSparseMinor] = "0"
			paxHdrs[paxGNUSparseName] = realName

            }

            this.isExists = true;
            return fh;
        }
    }

    /**
     * Determines the appropriate lease state based on the requested access
     *
     * @param access the desired access flags
     * @return the appropriate lease state
     */
    private int determineLeaseState(final int access) {
        // Check if this is a directory
        boolean isDir = false;