/*
     * We keep an array of elements and counts.  Periodically -- when we need more room in the
     * array, or when we're building, or the like -- we sort, deduplicate, and combine the counts.
     * Negative counts indicate a setCount operation with ~counts[i].
     */

    private final Comparator<? super E> comparator;

    @VisibleForTesting E[] elements;
    private int[] counts;

    /*

        }

        @Test
        @DisplayName("Should handle negative status codes")
        void testNegativeStatusCode() throws SMBProtocolDecodingException {
            byte[] buffer = new byte[256];
            System.arraycopy(SMBUtil.SMB2_HEADER, 0, buffer, 0, 4);
            SMBUtil.writeInt4(-1, buffer, 8); // negative status

            // Write error response structure at offset 64

            assertTrue(true);
        } catch (Exception e) {
            assertTrue(true);
        }
    }

    @Test
    public void test_setters_edgeCases() {
        // Test setting negative values
        webFsIndexHelper.setMaxAccessCount(-1L);
        assertEquals(-1L, webFsIndexHelper.maxAccessCount);

        webFsIndexHelper.setCrawlingExecutionInterval(-1000L);

   * @return a new, empty {@code CompactLinkedHashSet} with enough capacity to hold {@code
   *     expectedSize} elements without resizing
   * @throws IllegalArgumentException if {@code expectedSize} is negative
   */
  public static <E extends @Nullable Object> CompactLinkedHashSet<E> createWithExpectedSize(
      int expectedSize) {
    return new CompactLinkedHashSet<>(expectedSize);
  }

   * @return a new, empty {@code CompactLinkedHashSet} with enough capacity to hold {@code
   *     expectedSize} elements without resizing
   * @throws IllegalArgumentException if {@code expectedSize} is negative
   */
  public static <E extends @Nullable Object> CompactLinkedHashSet<E> createWithExpectedSize(
      int expectedSize) {
    return new CompactLinkedHashSet<>(expectedSize);
  }

		nodes[i] = httptest.NewServer(router)
	}
}

const WriteLock = -1

type lockServer struct {
	mutex sync.Mutex
	// Map of locks, with negative value indicating (exclusive) write lock
	// and positive values indicating number of read locks
	lockMap map[string]int64

	// Refresh returns lock not found if set to true
	lockNotFound bool

        assertEquals(0x00, dst[13]);

        // Check security information
        assertEquals(0x12345678, SMBUtil.readInt4(dst, 14));
    }

    @Test
    @DisplayName("Test with negative FID value (should handle as unsigned)")
    void testNegativeFidValue() {
        int fid = -1; // Will be treated as 0xFFFF in unsigned 16-bit

        int[] invalidSizes = { -1, 0, 1, 2, 3, 5, 6, 8, 16, 32, 64, 128, 256, 512, 1024 };

        for (int invalidSize : invalidSizes) {
            byte[] buffer = new byte[256];

            // Handle negative values (will wrap around in writeInt2)
            if (invalidSize >= 0) {
                SMBUtil.writeInt2(invalidSize, buffer, 0);

                // When & Then

  }

  @CanIgnoreReturnValue
  static int checkNonNegative(int value) {
    checkArgument(value >= 0, "Not true that %s is non-negative.", value);
    return value;
  }

  @CanIgnoreReturnValue
  static long checkNonNegative(long value) {
    checkArgument(value >= 0, "Not true that %s is non-negative.", value);
    return value;
  }

  @CanIgnoreReturnValue
  static int checkPositive(int value) {

   * scattered in memory and thus don't interfere much with each
   * other. But Atomic objects residing in arrays will tend to be
   * placed adjacent to each other, and so will most often share
   * cache lines (with a huge negative performance impact) without
   * this precaution.
   *
   * In part because Cells are relatively large, we avoid creating
   * them until they are needed.  When there is no contention, all