wantOK: true,
		},
		{
			name: "min",
			fields: fields{
				value: []byte(strconv.FormatInt(math.MinInt64, 10)),
			},
			want:   math.MinInt64,
			wantOK: true,
		},
		{
			name: "max-overflow",
			fields: fields{
				value: []byte("9223372036854775808"),
			},
			// Seems to be what strconv.ParseInt returns
			want:   math.MaxInt64,
			wantOK: false,
		},
		{
			name: "min-underflow",

      assertThat(UnsignedInts.parseUnsignedInt(maxAsString, radix)).isEqualTo(-1);

      assertThrows(
          NumberFormatException.class,
          () -> {
            long overflow = 1L << 32;
            String overflowAsString = Long.toString(overflow, radix);
            UnsignedInts.parseUnsignedInt(overflowAsString, radix);
          });
    }
  }

  public void testParseIntThrowsExceptionForInvalidRadix() {

    static {
      BigInteger overflow = BigInteger.ONE.shiftLeft(64);
      for (int i = Character.MIN_RADIX; i <= Character.MAX_RADIX; i++) {
        maxValueDivs[i] = divide(MAX_VALUE, i);
        maxValueMods[i] = (int) remainder(MAX_VALUE, i);
        maxSafeDigits[i] = overflow.toString(i).length() - 1;
      }
    }

    /**

        assertTrue(stats.getFailureRate() <= 1.0);
    }

    @Test
    public void testBufferOverflowPrevention() throws Exception {
        validator.resetStats();

        // Trigger buffer overflow prevention
        try {
            byte[] buffer = new byte[10];
            validator.validateBufferAccess(buffer, 5, 10);
        } catch (SmbException e) {
            // Expected
        }

        throw new RuntimeException("Wrong length: " + x);
      }
    }
  }

  private static String oldRepeat(String string, int count) {
    // If this multiplication overflows, a NegativeArraySizeException or
    // OutOfMemoryError is not far behind
    int len = string.length();
    int size = len * count;
    char[] array = new char[size];
    for (int i = 0; i < size; i += len) {

        throw new RuntimeException("Wrong length: " + x);
      }
    }
  }

  private static String oldRepeat(String string, int count) {
    // If this multiplication overflows, a NegativeArraySizeException or
    // OutOfMemoryError is not far behind
    int len = string.length();
    int size = len * count;
    char[] array = new char[size];
    for (int i = 0; i < size; i += len) {

        verify(watchHandle, times(1)).watch();
    }

    /**
     * Test watch() method returning empty list when buffer overflow
     */
    @Test
    void testWatchBufferOverflow() throws CIFSException {
        // Setup mock behavior for buffer overflow scenario
        when(watchHandle.watch()).thenReturn(Collections.emptyList());

        // Execute

        byte[] buf = bufferQueue.poll();
        if (buf != null) {
            queueSize.decrementAndGet();
            return buf;
        }

        // Validate buffer size to prevent overflow
        int bufferSize = SmbComTransaction.TRANSACTION_BUF_SIZE;
        if (bufferSize < 0 || bufferSize > MAX_BUFFER_SIZE) {
            throw new IllegalStateException("Invalid buffer size: " + bufferSize);
        }

	if objectSize > maxMultipartPutObjectSize {
		err = errors.New("entity too large")
		return partSize, err
	}

	configuredPartSize := minPartSize
	// Use floats for part size for all calculations to avoid
	// overflows during float64 to int64 conversions.
	partSizeFlt := float64(objectSize / maxPartsCount)
	partSizeFlt = math.Ceil(partSizeFlt/float64(configuredPartSize)) * float64(configuredPartSize)

	// Part size.

 *
 * This is because the ModelProcessor interface extends ModelLocator and ModelReader. If we
 * made this component available under all its interfaces then it could end up being injected
 * into itself leading to a stack overflow.
 *
 * A side effect of using @Typed is that it translates to explicit bindings in the container.
 * So instead of binding the component under a 'wildcard' key it is now bound with an explicit