Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 5 of 5 for Fractional (0.06 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 Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 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 Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  3. 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 Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.4K bytes
    - Viewed (0)
  4. 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 Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.4K bytes
    - Viewed (0)
  5. common-protos/k8s.io/apimachinery/pkg/api/resource/generated.proto

    // This means that Exponent/suffix will be adjusted up or down (with a
    // corresponding increase or decrease in Mantissa) such that:
    //
    // - No precision is lost
    // - No fractional digits will be emitted
    // - The exponent (or suffix) is as large as possible.
    //
    // The sign will be omitted unless the number is negative.
    //
    // Examples:
    //
    // - 1.5 will be serialized as "1500m"
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 3.9K bytes
    - Viewed (0)
Back to top