- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 781 for Leach (0.18 sec)
-
guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
// should never reach here! throw new UnsupportedOperationException(); } @Override public Entry<K, V> belowSamplesGreater() { // should never reach here! throw new UnsupportedOperationException(); } @Override public Entry<K, V> aboveSamplesLesser() { // should never reach here! throw new UnsupportedOperationException();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
// should never reach here! throw new UnsupportedOperationException(); } @Override public Entry<K, V> belowSamplesGreater() { // should never reach here! throw new UnsupportedOperationException(); } @Override public Entry<K, V> aboveSamplesLesser() { // should never reach here! throw new UnsupportedOperationException();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/CharStreamsTest.java
* reduced the available size of the buffer each time a call to read didn't fill up the available * space in the buffer completely. In general this is a performance problem since the buffer size * is permanently reduced, but with certain Reader implementations it could also cause the buffer * size to reach 0, causing an infinite loop. */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/CharStreamsTest.java
* reduced the available size of the buffer each time a call to read didn't fill up the available * space in the buffer completely. In general this is a performance problem since the buffer size * is permanently reduced, but with certain Reader implementations it could also cause the buffer * size to reach 0, causing an infinite loop. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
cmd/erasure-multipart.go
ChecksumAlgo: userDefined[hash.MinIOMultipartChecksum], }, nil } // NewMultipartUpload - initialize a new multipart upload, returns a // unique id. The unique id returned here is of UUID form, for each // subsequent request each UUID is unique. // // Implements S3 compatible initiate multipart API. func (er erasureObjects) NewMultipartUpload(ctx context.Context, bucket, object string, opts ObjectOptions) (*NewMultipartUploadResult, error) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Apr 28 17:53:50 GMT 2024 - 43K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
architecture/ambient/ztunnel.md
If it is allowed, we will forward to the target destination. #### Hairpin In the case that the destination has a waypoint, that waypoint must have been bypassed to reach the inbound passthrough codepath. How we handle this is [under discussion](https://docs.google.com/document/d/1uM1c3zzoehiijh1ZpZuJ1-SzuVVupenv8r5yuCaFshs/edit#heading=h.dwbqvwmg6ud3). ### Inbound
Plain Text - Registered: Wed May 01 22:53:12 GMT 2024 - Last Modified: Thu Apr 25 22:35:16 GMT 2024 - 16.6K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/connection/ConnectPlan.kt
* * * [TCP handshake][connectSocket] * * Optional [CONNECT tunnels][connectTunnel]. When using an HTTP proxy to reach an HTTPS server * we must send a `CONNECT` request, and handle authorization challenges from the proxy. * * Optional [TLS handshake][connectTls]. * * Each step may fail. If a retry is possible, a new instance is created with the next plan, which * will be configured differently. */
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Sat Apr 20 17:03:43 GMT 2024 - 18.6K bytes - Viewed (0)