Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 161 - 170 of 620 for resp (0.02 seconds)

  1. android/guava-tests/benchmark/com/google/common/util/concurrent/CycleDetectingLockFactoryBenchmark.java

        }
      }
    
      @Benchmark
      void unorderedPlainLocks(int reps) {
        lockAndUnlock(new ReentrantLock(), reps);
      }
    
      @Benchmark
      void unorderedCycleDetectingLocks(int reps) {
        lockAndUnlock(factory.newReentrantLock("foo"), reps);
      }
    
      private static void lockAndUnlock(Lock lock, int reps) {
        for (int i = 0; i < reps; i++) {
          lock.lock();
          lock.unlock();
        }
      }
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 2.5K bytes
    - Click Count (0)
  2. guava-tests/benchmark/com/google/common/collect/ComparatorDelegationOverheadBenchmark.java

        }
      }
    
      @Benchmark
      int arraysSortNoComparator(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          Integer[] copy = inputArrays[i & 0xFF].clone();
          sort(copy);
          tmp += copy[0];
        }
        return tmp;
      }
    
      @Benchmark
      int arraysSortOrderingNatural(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          Integer[] copy = inputArrays[i & 0xFF].clone();
    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. android/guava-tests/benchmark/com/google/common/collect/IteratorBenchmark.java

        }
      }
    
      @Benchmark
      int arrayIndexed(int reps) {
        int sum = 0;
        for (int i = 0; i < reps; i++) {
          for (int index = 0; index < size; index++) {
            sum += array[index].hashCode();
          }
        }
        return sum;
      }
    
      @Benchmark
      int arrayIndexedLength(int reps) {
        int sum = 0;
        for (int i = 0; i < reps; i++) {
          for (int index = 0; index < array.length; index++) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue May 13 17:27:14 GMT 2025
    - 3.5K bytes
    - Click Count (0)
  4. android/guava-tests/benchmark/com/google/common/base/AsciiBenchmark.java

      }
    
      @Benchmark
      int asciiStringToUpperCase(int reps) {
        String string = noWorkToDo ? Ascii.toUpperCase(testString) : testString;
    
        int dummy = 0;
        for (int i = 0; i < reps; i++) {
          dummy += Ascii.toUpperCase(string).length();
        }
        return dummy;
      }
    
      @Benchmark
      int asciiCharSequenceToUpperCase(int reps) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 4.8K bytes
    - Click Count (0)
  5. android/guava-tests/benchmark/com/google/common/base/JoinerBenchmark.java

      @Benchmark
      int joinerWithStringDelimiter(int reps) {
        int dummy = 0;
        for (int i = 0; i < reps; i++) {
          dummy ^= JOINER_ON_STRING.join(components).length();
        }
        return dummy;
      }
    
      /** {@link Joiner} with a character delimiter. */
      @Benchmark
      int joinerWithCharacterDelimiter(int reps) {
        int dummy = 0;
        for (int i = 0; i < reps; i++) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Fri Dec 27 16:19:35 GMT 2024
    - 5K bytes
    - Click Count (0)
  6. guava-tests/benchmark/com/google/common/util/concurrent/SingleThreadAbstractFutureBenchmark.java

      }
    
      @Benchmark
      public long timeComplete_Normal(int reps) throws Exception {
        long r = 0;
        List<Facade<Integer>> list = new ArrayList<>(reps);
        for (int i = 0; i < reps; i++) {
          Facade<Integer> localFuture = impl.newFacade();
          list.add(localFuture);
          localFuture.set(i);
        }
        for (int i = 0; i < reps; i++) {
          r += list.get(i).get();
        }
        return r;
      }
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue May 13 18:46:00 GMT 2025
    - 3.7K bytes
    - Click Count (0)
  7. android/guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java

        }
      }
    
      @Benchmark
      long factorialDouble(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += Double.doubleToRawLongBits(impl.factorialDouble(factorials[j]));
        }
        return tmp;
      }
    
      @Benchmark
      int intGCD(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: Mon Jul 14 14:44:08 GMT 2025
    - 6.9K bytes
    - Click Count (0)
  8. android/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)
  9. cmd/object-api-multipart_test.go

    		// Failed to create newbucket, abort.
    		t.Fatalf("%s : %s", instanceType, err.Error())
    	}
    
    	resN, err := obj.NewMultipartUpload(context.Background(), "abc", "def", opts)
    	if err != nil {
    		// Failed to create NewMultipartUpload, abort.
    		t.Fatalf("%s : %s", instanceType, err.Error())
    	}
    
    	uploadID := res.UploadID
    	// Creating a dummy bucket for tests.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 89.4K bytes
    - Click Count (0)
  10. guava-tests/benchmark/com/google/common/math/LessThanBenchmark.java

      @Benchmark
      int branchFreeLtIntInlined(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & SAMPLE_MASK;
          int x = xInts[j];
          int y = yInts[j];
          int z = constant[j];
          tmp += z + ((x - y) >>> (Integer.SIZE - 1));
        }
        return tmp;
      }
    
      @Benchmark
      int branchFreeLtInt(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & SAMPLE_MASK;
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 4.1K bytes
    - Click Count (0)
Back to Top