static String getMessageByCode(final int errcode) {
        /* Note there's a signedness error here because 0xC0000000 based values are
         * negative so it with NT_STATUS_SUCCESS (0) the binary search will not be
         * performed properly. The effect is that the code at index 1 is never found
         * (NT_STATUS_UNSUCCESSFUL). So here we factor out NT_STATUS_SUCCESS

            "48, 16, true", // DIRECTORY | ARCHIVE vs DIRECTORY
            "48, 32, true", // DIRECTORY | ARCHIVE vs ARCHIVE
            "21, 5, true", // READONLY | SYSTEM | DIRECTORY vs READONLY | SYSTEM

            // Negative cases (should be rejected)
            "1, 2, false", // READONLY vs HIDDEN
            "2, 1, false", // HIDDEN vs READONLY
            "16, 32, false", // DIRECTORY vs ARCHIVE

import java.math.BigInteger;
import java.util.Arrays;
import java.util.Comparator;

/**
 * Static utility methods pertaining to {@code long} primitives that interpret values as
 * <i>unsigned</i> (that is, any negative value {@code x} is treated as the positive value {@code
 * 2^64 + x}). The methods for which signedness is not an issue are in {@link Longs}, as well as
 * signed versions of methods for which signedness is an issue.
 *

        }
        if (securityBufferOffset < 0) {
            throw new SMBProtocolDecodingException("Invalid security buffer offset: " + securityBufferOffset + " (must be non-negative)");
        }

        final int hdrStart = getHeaderStart();
        if (securityBufferLength > 0) {
            // Validate that security buffer doesn't exceed available data

                assertEquals(expected, buffer[i], "Pattern mismatch at position " + i);
            }
        }

        @Test
        @DisplayName("Should handle chunks with negative values")
        void testChunksWithNegativeValues() {
            // Given
            byte[] sourceKey = new byte[SOURCE_KEY_SIZE];
            SrvCopychunk chunk = new SrvCopychunk(-1L, -100L, -1);

            transport.release();
            assertEquals(beforeRelease - 1, transport.getUsageCount());
        }

        @Test
        @DisplayName("release should throw exception when usage count would go negative")
        void shouldThrowOnNegativeUsage() {
            transport.release(); // Make it 0
            assertThrows(RuntimeCIFSException.class, transport::release);
        }

        @Test

   *     minValue()}
   */
  public abstract @Nullable C previous(C value);

  /**
   * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or
   * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}.
   * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3}

      int hash2 = (int) (hash64 >>> 32);

      boolean bitsChanged = false;
      for (int i = 1; i <= numHashFunctions; i++) {
        int combinedHash = hash1 + (i * hash2);
        // Flip all the bits if it's negative (guaranteed positive number)
        if (combinedHash < 0) {
          combinedHash = ~combinedHash;
        }
        bitsChanged |= bits.set(combinedHash % bitSize);
      }
      return bitsChanged;
    }

   * The index in the {@link #parts()} list at which the public suffix begins. For example, for the
   * domain name {@code myblog.blogspot.co.uk}, the value would be 1 (the index of the {@code
   * blogspot} part). The value is negative (specifically, {@link #NO_SUFFIX_FOUND}) if no public
   * suffix was found.
   */
  private int publicSuffixIndex() {
    int publicSuffixIndexLocal = publicSuffixIndexCache;

    static final int SESSION_REQUEST = 0x81;
    /**
     * NetBIOS positive session response packet type.
     */
    public static final int POSITIVE_SESSION_RESPONSE = 0x82;
    /**
     * NetBIOS negative session response packet type.
     */
    public static final int NEGATIVE_SESSION_RESPONSE = 0x83;
    static final int SESSION_RETARGET_RESPONSE = 0x84;
    static final int SESSION_KEEP_ALIVE = 0x85;