Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for fitsInInt (1.26 sec)

  1. guava-tests/test/com/google/common/math/IntMathTest.java

      }
    
      public void testConstantsBiggestBinomials() {
        for (int k = 0; k < IntMath.biggestBinomials.length; k++) {
          assertTrue(fitsInInt(BigIntegerMath.binomial(IntMath.biggestBinomials[k], k)));
          assertTrue(
              IntMath.biggestBinomials[k] == Integer.MAX_VALUE
                  || !fitsInInt(BigIntegerMath.binomial(IntMath.biggestBinomials[k] + 1, k)));
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 23.1K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/math/IntMathTest.java

      }
    
      public void testConstantsBiggestBinomials() {
        for (int k = 0; k < IntMath.biggestBinomials.length; k++) {
          assertTrue(fitsInInt(BigIntegerMath.binomial(IntMath.biggestBinomials[k], k)));
          assertTrue(
              IntMath.biggestBinomials[k] == Integer.MAX_VALUE
                  || !fitsInInt(BigIntegerMath.binomial(IntMath.biggestBinomials[k] + 1, k)));
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 23.1K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/LongMath.java

       *     sqrt(x)} is not an integer
       */
      @GwtIncompatible // TODO
      public static long sqrt(long x, RoundingMode mode) {
        checkNonNegative("x", x);
        if (fitsInInt(x)) {
          return IntMath.sqrt((int) x, mode);
        }
        /*
         * Let k be the true value of floor(sqrt(x)), so that
         *
         *            k * k <= x          <  (k + 1) * (k + 1)
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/math/LongMath.java

       *     sqrt(x)} is not an integer
       */
      @GwtIncompatible // TODO
      public static long sqrt(long x, RoundingMode mode) {
        checkNonNegative("x", x);
        if (fitsInInt(x)) {
          return IntMath.sqrt((int) x, mode);
        }
        /*
         * Let k be the true value of floor(sqrt(x)), so that
         *
         *            k * k <= x          <  (k + 1) * (k + 1)
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
Back to top