- Sort Score
- Num 10 results
- Language All
Results 51 - 60 of 134 for deps (0.02 seconds)
-
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 Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 4.8K bytes - Click Count (0) -
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 Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 27 16:19:35 GMT 2024 - 5K bytes - Click Count (0) -
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 Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Jul 14 14:44:08 GMT 2025 - 6.9K bytes - Click Count (0) -
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 Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Jul 14 14:44:08 GMT 2025 - 6.9K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java
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) -
tensorflow/c/eager/immediate_execution_context.h
virtual bool IsCustomDevice(const string& device_name) = 0; // Register a custom device. It will return error is the device name is // already registered. // TODO(tfrt-devs): Remove this method. Let caller register it directly into // CustomDeviceOpHandler. virtual absl::Status RegisterCustomDevice( const string& name, std::unique_ptr<CustomDevice> device) = 0;
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Oct 12 05:11:17 GMT 2024 - 12.3K bytes - Click Count (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);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 3.5K bytes - Click Count (0) -
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 Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.6K bytes - Click Count (0) -
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 Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.6K bytes - Click Count (0) -
compat/maven-compat/src/test/resources/projects/scope/transitive-default-dep.xml
Guillaume Nodet <******@****.***> 1729859506 +0200
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Oct 25 12:31:46 GMT 2024 - 1.7K bytes - Click Count (0)