Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 19 for nonzero2 (0.06 seconds)

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

          int j = i & ARRAY_MASK;
          tmp += BigIntegerMath.divide(nonzero1[j], nonzero2[j], mode).intValue();
        }
        return tmp;
      }
    
      @Benchmark
      long roundToDouble(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += Double.doubleToRawLongBits(BigIntegerMath.roundToDouble(nonzero1[j], mode));
        }
        return tmp;
      }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.9K bytes
    - Click Count (0)
  2. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java

          int j = i & ARRAY_MASK;
          tmp += BigIntegerMath.divide(nonzero1[j], nonzero2[j], mode).intValue();
        }
        return tmp;
      }
    
      @Benchmark
      long roundToDouble(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += Double.doubleToRawLongBits(BigIntegerMath.roundToDouble(nonzero1[j], mode));
        }
        return tmp;
      }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.9K bytes
    - Click Count (0)
  3. android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java

      private static final long[] positive = new long[ARRAY_SIZE];
      private static final long[] nonzero = new long[ARRAY_SIZE];
      private static final long[] longs = new long[ARRAY_SIZE];
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue();
          nonzero[i] = randomNonZeroBigInteger(Long.SIZE - 2).longValue();
          longs[i] = RANDOM_SOURCE.nextLong();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  4. guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.java

      private static final int[] positive = new int[ARRAY_SIZE];
      private static final int[] nonzero = new int[ARRAY_SIZE];
      private static final int[] ints = new int[ARRAY_SIZE];
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          positive[i] = randomPositiveBigInteger(Integer.SIZE - 2).intValue();
          nonzero[i] = randomNonZeroBigInteger(Integer.SIZE - 2).intValue();
          ints[i] = RANDOM_SOURCE.nextInt();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  5. guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java

      private static final long[] positive = new long[ARRAY_SIZE];
      private static final long[] nonzero = new long[ARRAY_SIZE];
      private static final long[] longs = new long[ARRAY_SIZE];
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue();
          nonzero[i] = randomNonZeroBigInteger(Long.SIZE - 2).longValue();
          longs[i] = RANDOM_SOURCE.nextLong();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  6. guava/src/com/google/common/collect/ComparisonChain.java

     *       .compare(this.anEnum, that.anEnum, Ordering.natural().nullsLast())
     *       .result();
     * }
     * }
     *
     * <p>The value of this expression will have the same sign as the <i>first nonzero</i> comparison
     * result in the chain, or will be zero if every comparison result was zero.
     *
     * <p><b>Note:</b> {@code ComparisonChain} instances are <b>immutable</b>. For this utility to work
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 11.1K bytes
    - Click Count (0)
  7. schema/utils.go

    				continue
    			}
    			loaded[elemKey] = true
    
    			fieldValues := make([]interface{}, len(fields))
    			notZero = false
    			for idx, field := range fields {
    				fieldValues[idx], zero = field.ValueOf(ctx, elem)
    				notZero = notZero || !zero
    			}
    
    			if notZero {
    				dataKey := utils.ToStringKey(fieldValues...)
    				if _, ok := dataResults[dataKey]; !ok {
    					results = append(results, fieldValues)
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Thu Oct 30 11:15:36 GMT 2025
    - 5.9K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/collect/ComparisonChain.java

     *       .compare(this.anEnum, that.anEnum, Ordering.natural().nullsLast())
     *       .result();
     * }
     * }
     *
     * <p>The value of this expression will have the same sign as the <i>first nonzero</i> comparison
     * result in the chain, or will be zero if every comparison result was zero.
     *
     * <p><b>Note:</b> {@code ComparisonChain} instances are <b>immutable</b>. For this utility to work
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 10.5K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/primitives/UnsignedBytes.java

                 * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are
                 * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant
                 * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get
                 * that least significant nonzero byte.
                 */
                int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 16:38:16 GMT 2026
    - 21K bytes
    - Click Count (0)
  10. okhttp/src/commonJvmAndroid/kotlin/okhttp3/WebSocket.kt

       * is used to calculate this value. It also doesn't include any bytes buffered by the operating
       * system or network intermediaries. This method returns 0 if no messages are waiting in the
       * queue. If may return a nonzero value after the web socket has been canceled; this indicates
       * that enqueued messages were not transmitted.
       *
       * Use this to monitor backpressure and avoid exceeding the 16 MiB outgoing message buffer limit.
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Mar 10 21:45:14 GMT 2026
    - 6.1K bytes
    - Click Count (0)
Back to Top