Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for exponents (0.14 sec)

  1. android/guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java

    /**
     * Benchmarks for the non-rounding methods of {@code LongMath}.
     *
     * @author Louis Wasserman
     */
    @NullUnmarked
    public class LongMathBenchmark {
      private static final int[] exponents = new int[ARRAY_SIZE];
      private static final int[] factorialArguments = new int[ARRAY_SIZE];
      private static final int[][] binomialArguments = new int[ARRAY_SIZE][2];
      private static final long[] positive = new long[ARRAY_SIZE];
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/math/DoubleUtils.java

        // This is an extremely fast implementation of BigInteger.doubleValue(). JDK patch pending.
        BigInteger absX = x.abs();
        int exponent = absX.bitLength() - 1;
        // exponent == floor(log2(abs(x)))
        if (exponent < Long.SIZE - 1) {
          return x.longValue();
        } else if (exponent > MAX_EXPONENT) {
          return x.signum() * POSITIVE_INFINITY;
        }
    
        /*
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/DoubleUtils.java

        // This is an extremely fast implementation of BigInteger.doubleValue(). JDK patch pending.
        BigInteger absX = x.abs();
        int exponent = absX.bitLength() - 1;
        // exponent == floor(log2(abs(x)))
        if (exponent < Long.SIZE - 1) {
          return x.longValue();
        } else if (exponent > MAX_EXPONENT) {
          return x.signum() * POSITIVE_INFINITY;
        }
    
        /*
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  4. LICENSES/vendor/github.com/exponent-io/jsonpath/LICENSE

    = vendor/github.com/exponent-io/jsonpath licensed under: =
    
    The MIT License (MIT)
    
    Copyright (c) 2015 Exponent Labs LLC
    
    Permission is hereby granted, free of charge, to any person obtaining a copy
    of this software and associated documentation files (the "Software"), to deal
    in the Software without restriction, including without limitation the rights
    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Fri May 08 04:49:00 UTC 2020
    - 1.2K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/collect/Platform.java

        return e.getDeclaringClass();
      }
    
      static int reduceIterationsIfGwt(int iterations) {
        return iterations;
      }
    
      static int reduceExponentIfGwt(int exponent) {
        return exponent;
      }
    
      private Platform() {}
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 5.3K bytes
    - Viewed (0)
  6. guava/src/com/google/common/collect/Platform.java

        return e.getDeclaringClass();
      }
    
      static int reduceIterationsIfGwt(int iterations) {
        return iterations;
      }
    
      static int reduceExponentIfGwt(int exponent) {
        return exponent;
      }
    
      private Platform() {}
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 5.5K bytes
    - Viewed (0)
  7. guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/Platform.java

        return ******@****.***::getDeclaringClass()();
      }-*/;
    
      static int reduceIterationsIfGwt(int iterations) {
        return iterations / 10;
      }
    
      static int reduceExponentIfGwt(int exponent) {
        return exponent / 2;
      }
    
      private Platform() {}
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jun 10 15:17:16 UTC 2025
    - 5.5K bytes
    - Viewed (0)
Back to top