Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 41 - 50 of 334 for rels (0.02 seconds)

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

        }
      }
    
      @Benchmark
      int log2(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += BigIntegerMath.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;
    Created: Fri Dec 26 12:43:10 GMT 2025
    - 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/DoubleMathBenchmark.java

        }
      }
    
      @Benchmark
      long log2(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += Double.doubleToRawLongBits(DoubleMath.log2(positiveDoubles[j]));
        }
        return tmp;
      }
    
      @Benchmark
      long factorial(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  3. internal/s3select/sql/jsonpath_test.go

    			// Read only the first json object from the file
    			recs, err := getJSONStructs(b)
    			if err != nil || len(recs) != 3 {
    				t.Fatalf("%v or length was not 3", err)
    			}
    
    			for j, rec := range recs {
    				// fmt.Println(rec)
    				r, _, err := jsonpathEval(jp.PathExpr, rec)
    				if err != nil {
    					t.Errorf("Error: %d %d %v", i, j, err)
    				}
    				if !reflect.DeepEqual(r, tc.res[j]) {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 2.7K bytes
    - Click Count (0)
  4. guava-tests/benchmark/com/google/common/math/DoubleMathRoundingBenchmark.java

        }
      }
    
      @Benchmark
      int roundToInt(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += DoubleMath.roundToInt(doubleInIntRange[j], mode);
        }
        return tmp;
      }
    
      @Benchmark
      long roundToLong(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.7K bytes
    - Click Count (0)
  5. android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java

          longs[i] = RANDOM_SOURCE.nextLong();
        }
      }
    
      @Benchmark
      int log2(int reps) {
        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);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  6. android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java

        requests.set(0);
        misses.set(0);
      }
    
      @Benchmark
      int time(int reps) {
        int dummy = 0;
        for (int i = 0; i < reps; i++) {
          dummy += cache.getUnchecked(nextRandomKey());
        }
        requests.addAndGet(reps);
        return dummy;
      }
    
      private int nextRandomKey() {
        int a = random.nextInt(max);
    
        /*
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 3.4K bytes
    - Click Count (0)
  7. android/guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.java

      RoundingMode mode;
    
      @Benchmark
      int log2(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += IntMath.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 += IntMath.log10(positive[j], mode);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  8. guava-tests/benchmark/com/google/common/io/BaseEncodingBenchmark.java

        }
      }
    
      @Benchmark
      public int encode(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          tmp += System.identityHashCode(encoding.encoding.encode(encodingInputs[i & INPUTS_MASK]));
        }
        return tmp;
      }
    
      @Benchmark
      public int decode(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 3.2K bytes
    - Click Count (0)
  9. guava-tests/benchmark/com/google/common/base/LazyStackTraceBenchmark.java

          throw new SkipThisScenarioException();
        }
      }
    
      @Benchmark
      public boolean timeFindCaller(int reps) {
        return timeFindCaller(reps, recursionCount);
      }
    
      private boolean timeFindCaller(int reps, int recurse) {
        return recurse > 0 ? timeFindCaller(reps, recurse - 1) : mode.timeIt(reps, breakAt);
      }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
  10. android/guava-tests/benchmark/com/google/common/base/LazyStackTraceBenchmark.java

          throw new SkipThisScenarioException();
        }
      }
    
      @Benchmark
      public boolean timeFindCaller(int reps) {
        return timeFindCaller(reps, recursionCount);
      }
    
      private boolean timeFindCaller(int reps, int recurse) {
        return recurse > 0 ? timeFindCaller(reps, recurse - 1) : mode.timeIt(reps, breakAt);
      }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.6K bytes
    - Click Count (0)
Back to Top