Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for Fractional (0.08 sec)

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

        long signifFloor = twiceSignifFloor >> 1;
        signifFloor &= SIGNIFICAND_MASK; // remove the implied bit
    
        /*
         * We round up if either the fractional part of signif is strictly greater than 0.5 (which is
         * true if the 0.5 bit is set and any lower bit is set), or if the fractional part of signif is
         * >= 0.5 and signifFloor is odd (which is true if both the 0.5 bit and the 1 bit are set).
         */
        boolean increment =
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  2. guava/src/com/google/common/math/DoubleUtils.java

        long signifFloor = twiceSignifFloor >> 1;
        signifFloor &= SIGNIFICAND_MASK; // remove the implied bit
    
        /*
         * We round up if either the fractional part of signif is strictly greater than 0.5 (which is
         * true if the 0.5 bit is set and any lower bit is set), or if the fractional part of signif is
         * >= 0.5 and signifFloor is odd (which is true if both the 0.5 bit and the 1 bit are set).
         */
        boolean increment =
    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-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java

      private int nextRandomKey() {
        int a = random.nextInt(max);
    
        /*
         * For example, if concentration=2.0, the following takes the square root of
         * the uniformly-distributed random integer, then truncates any fractional
         * part, so higher integers would appear (in this case linearly) more often
         * than lower ones.
         */
        return (int) Math.pow(a, 1.0 / concentration);
      }
    
      @AfterExperiment
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  4. android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java

      private int nextRandomKey() {
        int a = random.nextInt(max);
    
        /*
         * For example, if concentration=2.0, the following takes the square root of
         * the uniformly-distributed random integer, then truncates any fractional
         * part, so higher integers would appear (in this case linearly) more often
         * than lower ones.
         */
        return (int) Math.pow(a, 1.0 / concentration);
      }
    
      @AfterExperiment
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.4K bytes
    - Viewed (0)
Back to top