value %= divisor
			}
		case lex.LSH:
			p.next()
			shift := p.factor()
			if int64(shift) < 0 {
				p.errorf("negative left shift count")
			}
			return value << shift
		case lex.RSH:
			p.next()
			shift := p.term()
			if int64(shift) < 0 {
				p.errorf("negative right shift count")
			}
			if int64(value) < 0 {
				p.errorf("right shift of value with high bit set")
			}

  // https://github.com/google/guava/issues/1781
  public void testOptimalNumOfHashFunctionsRounding() {
    assertEquals(5, BloomFilter.optimalNumOfHashFunctions(0.03));
  }

  /** Tests that we always get a non-negative optimal size. */
  public void testOptimalSize() {
    for (int n = 1; n < 1000; n++) {
      for (double fpp = Double.MIN_VALUE; fpp < 1.0; fpp += 0.001) {
        assertTrue(BloomFilter.optimalNumOfBits(n, fpp) >= 0);

 */
public abstract class SearchRequestParams {

    /**
     * Default constructor.
     */
    protected SearchRequestParams() {
        // Default constructor
    }

    /** The parameter for negative query. */
    public static final String AS_NQ = "nq";

    /** The parameter for OR query. */
    public static final String AS_OQ = "oq";

    /** The parameter for exact phrase query. */

    }

    @Test
    void testReadDataWireFormatWithNegativeLength() {
        byte[] buffer = new byte[100];
        // Negative length should cause ArrayIndexOutOfBoundsException from System.arraycopy
        assertThrows(ArrayIndexOutOfBoundsException.class, () -> response.readDataWireFormat(buffer, 0, -1));
    }

var errNotFirstDisk = errors.New("Not first drive")

// error returned by first disk waiting to initialize other servers.
var errFirstDiskWait = errors.New("Waiting on other drives")

// error returned for a negative actual size.
var errInvalidDecompressedSize = errors.New("Invalid Decompressed Size")

// error returned in IAM subsystem when user doesn't exist.
var errNoSuchUser = errors.New("Specified user does not exist")

            assertEquals(Integer.MAX_VALUE, response.getCount());
            assertEquals(Integer.MAX_VALUE, response.getRemaining());
        }

        @Test
        @DisplayName("Should handle negative values as unsigned")
        void testNegativeValuesAsUnsigned() throws SMBProtocolDecodingException {
            byte[] buffer = new byte[64];
            SMBUtil.writeInt2(17, buffer, 0); // Structure size

   * @throws IllegalArgumentException if {@code limitSize} is negative
   * @since 3.0
   */
  public static <T extends @Nullable Object> Iterator<T> limit(
      Iterator<T> iterator, int limitSize) {
    checkNotNull(iterator);
    checkArgument(limitSize >= 0, "limit is negative");
    return new Iterator<T>() {
      private int count;

      @Override

   * @param columnIndex position of the row key in {@link #columnKeyList()}
   * @return the value with the specified row and column
   * @throws IndexOutOfBoundsException if either index is negative, {@code rowIndex} is greater than
   *     or equal to the number of allowed row keys, or {@code columnIndex} is greater than or equal
   *     to the number of allowed column keys
   */

            assertEquals(statusCode, exception.getStatusCode());
        }
    }

    public void test_statusCode_negativeValue() {
        // Test with negative status code
        int statusCode = -1;
        String message = "Invalid status";

        WebApiException exception = new WebApiException(statusCode, message);

    this.allowsSelfLoops = allowsSelfLoops;
    return this;
  }

  /**
   * Specifies the expected number of nodes in the graph.
   *
   * @throws IllegalArgumentException if {@code expectedNodeCount} is negative
   */
  @CanIgnoreReturnValue
  public GraphBuilder<N> expectedNodeCount(int expectedNodeCount) {
    this.expectedNodeCount = Optional.of(checkNonNegative(expectedNodeCount));
    return this;
  }

  /**