Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 25 for LongMath (0.07 sec)

  1. android/guava/src/com/google/common/math/LongMath.java

     * values, see {@link com.google.common.primitives.Longs}.
     *
     * @author Louis Wasserman
     * @since 11.0
     */
    @GwtCompatible(emulated = true)
    @ElementTypesAreNonnullByDefault
    public final class LongMath {
      @VisibleForTesting static final long MAX_SIGNED_POWER_OF_TWO = 1L << (Long.SIZE - 2);
    
      /**
       * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  2. guava/src/com/google/common/math/LongMath.java

     * values, see {@link com.google.common.primitives.Longs}.
     *
     * @author Louis Wasserman
     * @since 11.0
     */
    @GwtCompatible(emulated = true)
    @ElementTypesAreNonnullByDefault
    public final class LongMath {
      @VisibleForTesting static final long MAX_SIGNED_POWER_OF_TWO = 1L << (Long.SIZE - 2);
    
      /**
       * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  3. guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java

        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += LongMath.pow(positive[j], exponents[j]);
        }
        return tmp;
      }
    
      @Benchmark
      int mod(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += LongMath.mod(longs[j], positive[j]);
        }
        return tmp;
      }
    
      @Benchmark
      int gCD(int reps) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.5K bytes
    - Viewed (0)
  4. android/guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java

        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += LongMath.pow(positive[j], exponents[j]);
        }
        return tmp;
      }
    
      @Benchmark
      int mod(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += LongMath.mod(longs[j], positive[j]);
        }
        return tmp;
      }
    
      @Benchmark
      int gCD(int reps) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.5K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/math/LongMathTest.java

        for (int i = 0; i < LongMath.powersOf10.length; i++) {
          assertEquals(LongMath.checkedPow(10, i), LongMath.powersOf10[i]);
        }
        assertThrows(
            ArithmeticException.class, () -> LongMath.checkedPow(10, LongMath.powersOf10.length));
      }
    
      @GwtIncompatible // TODO
      public void testConstantsHalfPowersOf10() {
        for (int i = 0; i < LongMath.halfPowersOf10.length; i++) {
          assertEquals(
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 15:00:32 UTC 2024
    - 30.6K bytes
    - Viewed (0)
  6. android/guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java

            return IntMath.gcd(a, b);
          }
    
          @Override
          public long gcdLong(long a, long b) {
            return LongMath.gcd(a, b);
          }
    
          @Override
          public long binomialCoefficient(int n, int k) {
            return LongMath.binomial(n, k);
          }
    
          @Override
          public boolean noAddOverflow(int a, int b) {
            try {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 6.9K bytes
    - Viewed (0)
  7. android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java

        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += LongMath.log2(positive[j], mode);
        }
        return tmp;
      }
    
      @Benchmark
      int log10(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += LongMath.log10(positive[j], mode);
        }
        return tmp;
      }
    
      @Benchmark
      int sqrt(int reps) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 2.6K bytes
    - Viewed (0)
  8. guava/src/com/google/common/math/BigIntegerMath.java

        int startingNumber = LongMath.factorials.length;
        long product = LongMath.factorials[startingNumber - 1];
        // Strip off 2s from this value.
        int shift = Long.numberOfTrailingZeros(product);
        product >>= shift;
    
        // Use floor(log2(num)) + 1 to prevent overflow of multiplication.
        int productBits = LongMath.log2(product, FLOOR) + 1;
        int bits = LongMath.log2(startingNumber, FLOOR) + 1;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 18.8K bytes
    - Viewed (0)
  9. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

      private static BigInteger oldSlowFactorial(int n) {
        if (n <= 20) {
          return BigInteger.valueOf(LongMath.factorial(n));
        } else {
          int k = 20;
          return BigInteger.valueOf(LongMath.factorial(k)).multiply(oldSlowFactorial(k, n));
        }
      }
    
      /** Returns the product of {@code n1} exclusive through {@code n2} inclusive. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  10. guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

          return builder.buildOrThrow();
        }
    
        private double singleQuantileFromSorted(int index, int scale, double[] dataset) {
          long numerator = (long) index * (dataset.length - 1);
          int positionFloor = (int) LongMath.divide(numerator, scale, RoundingMode.DOWN);
          int remainder = (int) (numerator - positionFloor * scale);
          if (remainder == 0) {
            return dataset[positionFloor];
          } else {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Feb 01 16:30:37 UTC 2022
    - 7.1K bytes
    - Viewed (0)
Back to top