- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 527 for repl (0.12 sec)
-
docs/en/docs/how-to/custom-docs-ui-assets.md
If you integrate your API with an OAuth2 provider, you will be able to authenticate and come back to the API docs with the acquired credentials. And interact with it using the real OAuth2 authentication. Swagger UI will handle it behind the scenes for you, but it needs this "redirect" helper. ### Create a *path operation* to test it
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Mon Oct 30 09:58:58 GMT 2023 - 7.5K bytes - Viewed (0) -
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) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java
} } @Benchmark int pow(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.pow(positive[j], exponents[j]); } return tmp; } @Benchmark int mod(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.mod(longs[j], positive[j]);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (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;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 6.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 30 13:06:20 GMT 2020 - 2.8K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/aether/LegacyRepositorySystemSessionExtender.java
if (selector != null) { RemoteRepository repo = RepositoryUtils.toRepo(repository); org.eclipse.aether.repository.Authentication auth = selector.getAuthentication(repo); if (auth != null) { repo = new RemoteRepository.Builder(repo) .setAuthentication(auth) .build();
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 6.7K 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); Collections.sort(copy); dummy += copy.get(0); } } else { for (int i = 0; i < reps; i++) { List<Integer> copy = new ArrayList<>(input);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/primitives/UnsignedBytesBenchmark.java
} @Benchmark void longEqualJava(int reps) { for (int i = 0; i < reps; ++i) { if (javaImpl.compare(ba1, ba2) != 0) { throw new Error(); // deoptimization } } } @Benchmark void longEqualUnsafe(int reps) { for (int i = 0; i < reps; ++i) { if (unsafeImpl.compare(ba1, ba2) != 0) { throw new Error(); // deoptimization
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.8K bytes - Viewed (0) -
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);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0)