Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for log10 (0.02 sec)

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

      @GwtIncompatible // TODO
      public void testLog10HalfEven() {
        for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) {
          int halfEven = BigIntegerMath.log10(x, HALF_EVEN);
          // Now figure out what rounding mode we should behave like (it depends if FLOOR was
          // odd/even).
          boolean floorWasEven = (BigIntegerMath.log10(x, FLOOR) & 1) == 0;
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Wed Nov 19 01:35:24 UTC 2025
    - 27.1K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/math/IntMathTest.java

            assertEquals(BigIntegerMath.log10(valueOf(x), mode), IntMath.log10(x, mode));
          }
        }
      }
    
      // Relies on the correctness of log10(int, FLOOR) and of pow(int, int).
      @GwtIncompatible // pow()
      public void testLog10Exact() {
        for (int x : POSITIVE_INTEGER_CANDIDATES) {
          int floor = IntMath.log10(x, FLOOR);
          boolean expectSuccess = IntMath.pow(10, floor) == x;
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 24.1K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/BigIntegerMath.java

       *     is not a power of ten
       */
      @GwtIncompatible // TODO
      @SuppressWarnings("fallthrough")
      public static int log10(BigInteger x, RoundingMode mode) {
        checkPositive("x", x);
        if (fitsInLong(x)) {
          return LongMath.log10(x.longValue(), mode);
        }
    
        int approxLog10 = (int) (log2(x, FLOOR) * LN_2 / LN_10);
        BigInteger approxPow = BigInteger.TEN.pow(approxLog10);
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 18.8K bytes
    - Viewed (0)
  4. guava/src/com/google/common/math/LongMath.java

         * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6,
         * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2.
         */
        int y = maxLog10ForLeadingZeros[Long.numberOfLeadingZeros(x)];
        /*
         * y is the higher of the two possible values of floor(log10(x)). If x < 10^y, then we want the
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Nov 03 21:01:09 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/hash/BloomFilter.java

         * is close to 1 (why?), gives the following formula.
         */
        double fractionOfBitsSet = (double) bitCount / bitSize;
        return DoubleMath.roundToLong(
            -Math.log1p(-fractionOfBitsSet) * bitSize / numHashFunctions, RoundingMode.HALF_UP);
      }
    
      /** Returns the number of bits in the underlying bit array. */
      @VisibleForTesting
      long bitSize() {
        return bits.bitSize();
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 23 19:23:59 UTC 2025
    - 26.9K bytes
    - Viewed (0)
  6. RELEASE.md

            `tf.math.greater`, `tf.math.greater_equal`, `tf.math.igamma`,
            `tf.math.igammac`, `tf.math.invert_permutation`, `tf.math.less`,
            `tf.math.less_equal`, `tf.math.lgamma`, `tf.math.log`, `tf.math.log1p`,
            `tf.math.logical_and`, `tf.math.logical_not`, `tf.math.logical_or`,
            `tf.math.maximum`, `tf.math.minimum`, `tf.math.not_equal`,
            `tf.math.polygamma`, `tf.math.reciprocal`, `tf.math.rint`,
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Tue Oct 28 22:27:41 UTC 2025
    - 740.4K bytes
    - Viewed (3)
Back to top