- Sort Score
- Num 10 results
- Language All
Results 101 - 110 of 5,444 for gather (0.05 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/collect/Maps.java
} if (object instanceof MapDifference) { MapDifference<?, ?> other = (MapDifference<?, ?>) object; return entriesOnlyOnLeft().equals(other.entriesOnlyOnLeft()) && entriesOnlyOnRight().equals(other.entriesOnlyOnRight()) && entriesInCommon().equals(other.entriesInCommon()) && entriesDiffering().equals(other.entriesDiffering()); } return false; } @OverrideCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 157.6K bytes - Click Count (0) -
guava/src/com/google/common/collect/Maps.java
} if (object instanceof MapDifference) { MapDifference<?, ?> other = (MapDifference<?, ?>) object; return entriesOnlyOnLeft().equals(other.entriesOnlyOnLeft()) && entriesOnlyOnRight().equals(other.entriesOnlyOnRight()) && entriesInCommon().equals(other.entriesInCommon()) && entriesDiffering().equals(other.entriesDiffering()); } return false; } @OverrideCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 163.4K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/Ints.java
// array slot is read and written exactly once. However, it can have very poor memory locality: // benchmarking shows it can take 7 times longer than the other two in some cases. The other two // do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about // twice as many reads and writes. But benchmarking shows that they usually perform better thanCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 17 16:45:58 GMT 2026 - 31.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashMap.java
// entry was, and adjusting index links accordingly. /** * The hashtable object. This can be either: * * <ul> * <li>a byte[], short[], or int[], with size a power of two, created by * CompactHashing.createTable, whose values are either * <ul> * <li>UNSET, meaning "null pointer" * <li>one plus an index into the keys, values, and entries arrays
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 39.6K bytes - Click Count (0) -
compat/maven-model-builder/src/test/java/org/apache/maven/model/validation/DefaultModelValidatorTest.java
result.getWarnings().get(0), "'dependencies.dependency.version' for test:a:jar is either LATEST or RELEASE (both of them are being deprecated)"); assertContains( result.getWarnings().get(1), "'dependencies.dependency.version' for test:b:jar is either LATEST or RELEASE (both of them are being deprecated)"); } @Test
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Wed Sep 17 10:01:14 GMT 2025 - 33.9K bytes - Click Count (0) -
guava/src/com/google/common/collect/Lists.java
/** An implementation of {@link List#equals(Object)}. */ static boolean equalsImpl(List<?> thisList, @Nullable Object other) { if (other == checkNotNull(thisList)) { return true; } if (!(other instanceof List)) { return false; } List<?> otherList = (List<?>) other; int size = thisList.size(); if (size != otherList.size()) { return false; }Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 16:38:09 GMT 2026 - 42.5K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/ClosingFuture.java
* * <ol> * <li>A pipeline starts at its leaf step (or steps), which is created from either a callable * block or a {@link ListenableFuture}. * <li>Each other step is derived from one or more input steps. At each step, zero or more objects * can be captured for later closing. * <li>There is one last step (the root of the tree), from which you can extract the final result
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 101.7K bytes - Click Count (0) -
okhttp/src/jvmTest/kotlin/okhttp3/EventListenerTest.kt
CallEnd::class, ) } private fun assertBytesReadWritten( listener: EventRecorder, requestHeaderLength: Matcher<Long?>?, requestBodyBytes: Matcher<Long?>?, responseHeaderLength: Matcher<Long?>?, responseBodyBytes: Matcher<Long?>?, ) { if (requestHeaderLength != null) { val responseHeadersEnd = listener.removeUpToEvent<RequestHeadersEnd>()Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Feb 03 22:17:59 GMT 2026 - 70.7K bytes - Click Count (0) -
helm-releases/minio-2.0.1.tgz
Then install the chart, specifying that you want to use the TLS secret: ```bash helm install --set tls.enabled=true,tls.certSecret=tls-ssl-minio minio/minio ``` ### Installing certificates from third party CAs MinIO can connect to other servers, including MinIO nodes or other server types such as NATs and Redis. If these servers use certificates that were not registered with a known CA, add trust for these certificates to MinIO Server by bundling these certificates into a Kubernetes secret and providing...
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 31 09:09:09 GMT 2021 - 13.6K bytes - Click Count (0) -
helm-releases/minio-3.1.3.tgz
Then install the chart, specifying that you want to use the TLS secret: ```bash helm install --set tls.enabled=true,tls.certSecret=tls-ssl-minio minio/minio ``` ### Installing certificates from third party CAs MinIO can connect to other servers, including MinIO nodes or other server types such as NATs and Redis. If these servers use certificates that were not registered with a known CA, add trust for these certificates to MinIO Server by bundling these certificates into a Kubernetes secret and providing...
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sat Sep 18 18:09:59 GMT 2021 - 14.4K bytes - Click Count (0)