- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 356 for tant (0.78 sec)
-
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/publicsuffix/BasePublicSuffixList.kt
initCause(readFailure) } } } abstract val path: Any /** * Reads the public suffix list treating the operation as uninterruptible. We always want to read * the list otherwise we'll be left in a bad state. If the thread was interrupted prior to this * operation, it will be re-interrupted after the list is read. */ private fun readTheListUninterruptibly() {
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Mon Jul 28 07:33:49 UTC 2025 - 3.6K bytes - Viewed (0) -
internal/grid/benchmark_test.go
got := 0 for b := range in { PutByteBuffer(b) got++ } if got != requests { return NewRemoteErrf("wrong number of requests. want %d, got %d", requests, got) } return nil }, Subroute: "some-subroute", OutCapacity: 1, InCapacity: 1, // Only one message buffered. })) errFatal(err) }Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 15.5K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeVisitor.java
} else { throw new AssertionError("Unknown type: " + type); } succeeded = true; } finally { if (!succeeded) { // When the visitation failed, we don't want to ignore the second. visited.remove(type); } } } } void visitClass(Class<?> t) {} void visitGenericArrayType(GenericArrayType t) {}Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 3.6K bytes - Viewed (0) -
.teamcity/src/main/kotlin/util/AdHocPerformanceScenario.kt
text( "performance.baselines", "", display = ParameterDisplay.PROMPT, allowEmpty = true, description = "The baselines you want to run performance tests against. Empty means default baseline.", ) text( "testProject", "", display = ParameterDisplay.PROMPT,
Registered: Wed Dec 31 11:36:14 UTC 2025 - Last Modified: Mon Dec 22 07:15:16 UTC 2025 - 5.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
* * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@code * ImmutableSortedSet.copyOf(elements)}; if you want a {@code List} you can use its {@code * asList()} view. * * <p><b>Java 8+ users:</b> If you want to convert a {@link java.util.stream.Stream} to a sorted * {@code ImmutableList}, use {@code stream.sorted().collect(toImmutableList())}. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Nov 17 22:50:48 UTC 2025 - 30.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractScheduledService.java
return new FutureAsCancellable(immediateCancelledFuture()); } // We reschedule ourselves with a lock held for two reasons. 1. we want to make sure that // cancel calls cancel on the correct future. 2. we want to make sure that the assignment // to currentFuture doesn't race with itself so that currentFuture is assigned in the // correct order.
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 27.7K bytes - Viewed (0) -
docs/en/docs/tutorial/request-forms.md
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 2.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/net/HttpHeadersTest.java
for (Field field : HttpHeaders.class.getDeclaredFields()) { /* * Coverage mode generates synthetic fields. If we ever add private * fields, they will cause similar problems, and we may want to switch * this check to isAccessible(). */ if (!field.isSynthetic() && field.getType() == String.class) { builder.add(field); } } return builder.build(); }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 3.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
// the result will definitely fit into a long long result = 1; for (int i = n1 + 1; i <= n2; i++) { result *= i; } return BigInteger.valueOf(result); } /* * We want each multiplication to have both sides with approximately the same number of digits. * Currently, we just divide the range in half. */ int mid = (n1 + n2) >>> 1;Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.5K bytes - Viewed (0) -
cmd/erasure-encode_test.go
if w == nil { disks[i] = OfflineDisk } } if err == nil { if length := int64(len(data[test.offset:])); n != length { t.Errorf("Test %d: invalid number of bytes written: got: #%d want #%d", i, n, length) } writers := make([]io.Writer, len(disks)) for i, disk := range disks { if disk == nil { continue }Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 11.8K bytes - Viewed (0)