- Sort Score
- Num 10 results
- Language All
Results 81 - 90 of 164 for together (0.6 seconds)
-
guava/src/com/google/common/collect/ImmutableMultimap.java
* <p><a id="iteration"></a> * * <p><b>Key-grouped iteration.</b> All view collections follow the same iteration order. In all * current implementations, the iteration order always keeps multiple entries with the same key * together. Any creation method that would customarily respect insertion order (such as {@link * #copyOf(Multimap)}) instead preserves key-grouped order by inserting entries for an existing key * immediately after the last entry having that key.
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Mar 08 16:16:42 GMT 2026 - 28.1K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
* article on <a href="https://github.com/google/guava/wiki/ListenableFutureExplained">{@code * ListenableFuture}</a>. * * <p>The main purpose of {@code ListenableFuture} is to help you chain together a graph of * asynchronous operations. You can chain them together manually with calls to methods like {@link * Futures#transform(ListenableFuture, Function, Executor) Futures.transform}, but you will often
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 17 19:26:39 GMT 2026 - 64.2K bytes - Click Count (0) -
android/guava/src/com/google/common/base/Predicates.java
* <li>The {@link Predicate} returned by this method catches {@link ClassCastException} and * {@link NullPointerException}. * <li>Code that chains multiple predicates together (especially negations) may be more readable * using this method. For example, {@code not(in(target))} is generally more readable than * {@code not(target::contains)}.
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Mar 08 16:16:42 GMT 2026 - 26.6K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/ImmutableMultimap.java
* <p><a id="iteration"></a> * * <p><b>Key-grouped iteration.</b> All view collections follow the same iteration order. In all * current implementations, the iteration order always keeps multiple entries with the same key * together. Any creation method that would customarily respect insertion order (such as {@link * #copyOf(Multimap)}) instead preserves key-grouped order by inserting entries for an existing key * immediately after the last entry having that key.
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Dec 09 15:58:48 GMT 2025 - 27.1K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/ServiceManager.java
* correctly installed * * <p>{@link #transitioned}: is set by {@link #transitionService} to indicate that some * transition has been performed. * * <p>Together, they allow us to enforce that all services have their listeners installed prior * to any service performing a transition, then we can fail in the ServiceManager constructor * rather than in a Service.Listener callback.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 33.2K bytes - Click Count (1) -
docs/en/docs/alternatives.md
/// check | Inspired **FastAPI** to Support the open standard for APIs, OpenAPI. /// ### [Flask-apispec](https://flask-apispec.readthedocs.io/en/latest/) { #flask-apispec } It's a Flask plug-in, that ties together Webargs, Marshmallow and APISpec. It uses the information from Webargs and Marshmallow to automatically generate OpenAPI schemas, using APISpec.Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 22.2K bytes - Click Count (0) -
src/archive/tar/common.go
// The input must have been already validated. // // This function mutates src and returns a normalized map where: // - adjacent fragments are coalesced together // - only the last fragment may be empty // - the endOffset of the last fragment is the total size func invertSparseEntries(src []sparseEntry, size int64) []sparseEntry { dst := src[:0] var pre sparseEntry
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Oct 07 19:46:36 GMT 2025 - 24.5K bytes - Click Count (0) -
docs/smb3-features/06-witness-protocol-design.md
processNotificationBatch(batch); } } private void processNotificationBatch(List<WitnessNotification> notifications) { // Process multiple notifications together for efficiency for (WitnessNotification notification : notifications) { // Handle notification } } } ``` ## 10. Security Considerations
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 02:53:50 GMT 2025 - 42K bytes - Click Count (0) -
docs/en/docs/async.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 23.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashMap.java
* implementation. Experimentally determined. */ private static final int MAX_HASH_BUCKET_LENGTH = 9; // The way the `table`, `entries`, `keys`, and `values` arrays work together is as follows. // // The `table` array always has a size that is a power of 2. The hashcode of a key in the map // is masked in order to correspond to the current table size. For example, if the table size
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)