- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 16 for reqps (0.03 sec)
-
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();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 2.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
} @Benchmark int slowFactorial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += oldSlowFactorial(slowFactorials[j]).intValue(); } return tmp; } @Benchmark int factorial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Aug 19 16:21:24 UTC 2024 - 3.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/StopwatchBenchmark.java
@Benchmark long stopwatch(int reps) { long total = 0; for (int i = 0; i < reps; i++) { Stopwatch s = Stopwatch.createStarted(); // here is where you would do something total += s.elapsed(NANOSECONDS); } return total; } @Benchmark long manual(int reps) { long total = 0; for (int i = 0; i < reps; i++) { long start = System.nanoTime();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 1.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/SortedCopyBenchmark.java
} @Benchmark int collections(int reps) { int dummy = 0; // Yes, this could be done more elegantly if (mutable) { for (int i = 0; i < reps; i++) { List<Integer> copy = new ArrayList<>(input); sort(copy); dummy += copy.get(0); } } else { for (int i = 0; i < reps; i++) { List<Integer> copy = new ArrayList<>(input);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 3.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/hash/ChecksumBenchmark.java
// CRC32C @Benchmark byte crc32cHashFunction(int reps) { return runHashFunction(reps, Hashing.crc32c()); } // Adler32 @Benchmark byte adler32HashFunction(int reps) { return runHashFunction(reps, Hashing.adler32()); } @Benchmark byte adler32Checksum(int reps) throws Exception { byte result = 0x01; for (int i = 0; i < reps; i++) { Adler32 checksum = new Adler32();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 16:53:43 UTC 2024 - 3.4K bytes - Viewed (0) -
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++) { final 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; }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 22:10:29 UTC 2024 - 3.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/ExecutionListBenchmark.java
list.add(listener, directExecutor()); } return list.getImpl(); } @Benchmark int addThenExecute_singleThreaded(int reps) { int returnValue = 0; for (int i = 0; i < reps; i++) { list = impl.newExecutionList(); listenerLatch = new CountDownLatch(numListeners); for (int j = 0; j < numListeners; j++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 22:10:29 UTC 2024 - 20.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/StopwatchBenchmark.java
@Benchmark long stopwatch(int reps) { long total = 0; for (int i = 0; i < reps; i++) { Stopwatch s = Stopwatch.createStarted(); // here is where you would do something total += s.elapsed(NANOSECONDS); } return total; } @Benchmark long manual(int reps) { long total = 0; for (int i = 0; i < reps; i++) { long start = System.nanoTime();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 1.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/ChecksumBenchmark.java
// CRC32C @Benchmark byte crc32cHashFunction(int reps) { return runHashFunction(reps, Hashing.crc32c()); } // Adler32 @Benchmark byte adler32HashFunction(int reps) { return runHashFunction(reps, Hashing.adler32()); } @Benchmark byte adler32Checksum(int reps) throws Exception { byte result = 0x01; for (int i = 0; i < reps; i++) { Adler32 checksum = new Adler32();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 16:53:43 UTC 2024 - 3.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/SortedCopyBenchmark.java
} @Benchmark int collections(int reps) { int dummy = 0; // Yes, this could be done more elegantly if (mutable) { for (int i = 0; i < reps; i++) { List<Integer> copy = new ArrayList<>(input); sort(copy); dummy += copy.get(0); } } else { for (int i = 0; i < reps; i++) { List<Integer> copy = new ArrayList<>(input);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 3.5K bytes - Viewed (0)