- Sort Score
- Result 10 results
- Languages All
Results 451 - 460 of 2,007 for there (0.02 sec)
-
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/cache/DiskLruCache.kt
journalIsCorrupt, ) } // The cache is corrupted, attempt to delete the contents of the directory. This can throw and // we'll let that propagate out as it likely means there is a severe filesystem problem. try { delete() } finally { closed = false } } rebuildJournal() initialized = true }Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed May 28 23:28:25 UTC 2025 - 34.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashingTest.java
import org.jspecify.annotations.NullUnmarked; /** * Unit tests for {@link Hashing}. * * <p>TODO(b/33919189): Migrate repeated testing methods to {@link HashTestUtils} and tweak unit * tests to reference them from there. * * @author Dimitris Andreou * @author Kurt Alfred Kluever */ @NullUnmarked public class HashingTest extends TestCase { public void testMd5() { HashTestUtils.checkAvalanche(Hashing.md5(), 100, 0.4);Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 26.4K bytes - Viewed (0) -
cmd/handler-api.go
} if cap(t.requestsPool) != apiRequestsMaxPerNode { // Only replace if needed. // Existing requests will use the previous limit, // but new requests will use the new limit. // There will be a short overlap window, // but this shouldn't last long. t.requestsPool = make(chan struct{}, apiRequestsMaxPerNode) } listQuorum := cfg.ListQuorum if listQuorum == "" { listQuorum = "strict" }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Feb 18 16:25:55 UTC 2025 - 10.4K bytes - Viewed (0) -
cmd/signature-v4-utils.go
const unsignedPayload = "UNSIGNED-PAYLOAD" // http Header "x-amz-content-sha256" == "STREAMING-UNSIGNED-PAYLOAD-TRAILER" indicates that the // client did not calculate sha256 of the payload and there is a trailer. const unsignedPayloadTrailer = "STREAMING-UNSIGNED-PAYLOAD-TRAILER" // skipContentSha256Cksum returns true if caller needs to skip // payload checksum, false if not.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Mon Nov 25 17:10:22 UTC 2024 - 9.1K bytes - Viewed (0) -
cmd/metrics-realtime.go
CollectedAt: UTCNow(), } cm, err := c.Times(false) if err != nil { m.Errors = append(m.Errors, fmt.Sprintf("%s: %v (cpuTimes)", byHostName, err.Error())) } else { // not collecting per-cpu stats, so there will be only one element if len(cm) == 1 { m.Aggregated.CPU.TimesStat = &cm[0] } else { m.Errors = append(m.Errors, fmt.Sprintf("%s: Expected one CPU stat, got %d", byHostName, len(cm))) } }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sat Jun 01 05:16:24 UTC 2024 - 6.3K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractService.java
private void checkCurrentState(State expected) { State actual = state(); if (actual != expected) { if (actual == FAILED) { // Handle this specially so that we can include the failureCause, if there is one. throw new IllegalStateException( "Expected the service " + this + " to be " + expected + ", but the service has FAILED", failureCause()); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Feb 19 21:24:11 UTC 2025 - 20.7K bytes - Viewed (0) -
cmd/peer-rest-client.go
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Mon Sep 09 16:58:30 UTC 2024 - 26.1K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/Exchange.kt
private val codec: ExchangeCodec, ) { /** True if the request body need not complete before the response body starts. */ internal var isDuplex: Boolean = false private set /** True if there was an exception on the connection to the peer. */ internal var hasFailure: Boolean = false private set internal val connection: RealConnectionRegistered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue Jul 29 22:04:11 UTC 2025 - 9.7K bytes - Viewed (0) -
src/bytes/bytes.go
return i + j - last } } else { // If bytealg.Index is not available a brute force search is // ~1.5-3x faster than Rabin-Karp since n is small. c0 := b[last] c1 := b[last-1] // There are at least 2 chars to match loop: for ; i < len(s); i++ { if s[i] == c0 && s[i-1] == c1 { for k := 2; k < n; k++ { if s[i-k] != b[last-k] { continue loop } }Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Sep 03 14:04:47 UTC 2025 - 35.5K bytes - Viewed (0) -
compat/maven-compat/src/main/mdo/profiles.mdo
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Wed Jan 22 11:03:29 UTC 2025 - 13.8K bytes - Viewed (0)