}

    @Override
    protected SortedSet<E> delegate() {
      return unmodifiableDelegate;
    }

    @Override
    public @Nullable E lower(@ParametricNullness E e) {
      return delegate.lower(e);
    }

    @Override
    public @Nullable E floor(@ParametricNullness E e) {
      return delegate.floor(e);
    }

    @Override

    }

    @Override
    public void forEach(Consumer<? super E> action) {
      delegate.forEach(action);
    }

    @Override
    public @Nullable E lower(@ParametricNullness E e) {
      return delegate.lower(e);
    }

    @Override
    public @Nullable E floor(@ParametricNullness E e) {
      return delegate.floor(e);
    }

    @Override

    assertMean(2, 1, 3);

    assertMean(-2, -3, -1);
    assertMean(0, -1, 1);
    assertMean(1, -1, 3);
    assertMean((1L << 62) - 1, -1, Long.MAX_VALUE);

    // Even-sized ranges should prefer the lower mean
    assertMean(2, 1, 4);
    assertMean(-3, -4, -1);
    assertMean(0, -1, 2);
    assertMean(0, Long.MIN_VALUE + 2, Long.MAX_VALUE);
    assertMean(0, 0, 1);
    assertMean(-1, -1, 0);

	PreserveETag                        string    // preserves this etag during a PUT call.
	NoLock                              bool      // indicates to lower layers if the caller is expecting to hold locks.
	HasIfMatch                          bool      // indicates if the request has If-Match header

        // Mock transports
        SmbTransportImpl trans1 = mock(SmbTransportImpl.class);
        SmbTransportImpl trans2 = mock(SmbTransportImpl.class);

        // trans2 fails first (lower fail count, tried first), trans1 succeeds
        when(trans2.unwrap(SmbTransportImpl.class)).thenReturn(trans2);
        when(trans2.ensureConnected()).thenThrow(new IOException("Connection failed"));

   * k) worst case.
   */
  private void trim() {
    int left = 0;
    int right = 2 * k - 1;

    int minThresholdPosition = 0;
    // The leftmost position at which the greatest of the k lower elements
    // -- the new value of threshold -- might be found.

    int iterations = 0;
    int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;
    while (left < right) {

    @DisplayName("Test readDataWireFormat with various share types")
    @CsvSource({ "0, SHARE, Normal share", "1, PRINTER, Printer share", "3, IPC$, IPC share", "32768, HIDDEN, Hidden share", // 0x8000 - hidden flag in lower 16 bits
            "32769, HIDDENP, Hidden printer" // 0x8001 - hidden flag + printer type
    })
    void testReadDataWireFormatWithVariousShareTypes(int type, String name, String remark) throws Exception {

    /**
     * Creates a NetBIOS session message header.
     * The header format is:
     * - Byte 0: Message type (0x00 for SESSION_MESSAGE)
     * - Byte 1: High bit of 17-bit length field
     * - Bytes 2-3: Lower 16 bits of length field
     */
    private static byte[] messageHeader(int length) {
        byte[] h = new byte[4];
        h[0] = (byte) SessionServicePacket.SESSION_MESSAGE;
        h[1] = (byte) ((length >> 16) & 0x01);

// the maximum number of bytes allowed for each string field and
// the integer type used to store each numeric field
// (where timestamps are stored as the number of seconds since the Unix epoch).
//
// The table's lower portion shows specialized features of each format,
// such as supported string encodings, support for sub-second timestamps,
// or support for sparse files.
//
// The Writer currently provides no support for sparse files.

     * with each iteration, so this algorithm takes O(log(digits)) iterations.
     *
     * We start out with a double-precision approximation, which may be higher or lower than the
     * true value. Therefore, we perform at least one Newton iteration to get a guess that's
     * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point.
     */