- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 34 for design (0.24 sec)
-
CONTRIBUTING.md
issue if there is one) requesting the feature and describing specific use cases for it. If the feature has merit, it will go through a thorough process of API design and review. Any code should come after this. [APIs]: https://en.wikipedia.org/wiki/Application_programming_interface [issue]: https://github.com/google/guava/issues Pull requests -------------
Plain Text - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Nov 17 18:47:47 GMT 2023 - 3.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
/* * This is an implementation of ImmutableMap optimized especially for Android, which does not like * objects per entry. Instead we use an open-addressed hash table. This design is basically * equivalent to RegularImmutableSet, save that instead of having a hash table containing the * elements directly and null for empty positions, we store indices of the keys in the hash table,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* interpretation of the edge value as its multiplicity.) * * <h3>Building a {@code ValueGraph}</h3> * * <p>The implementation classes that {@code common.graph} provides are not public, by design. To * create an instance of one of the built-in implementations of {@code ValueGraph}, use the {@link * ValueGraphBuilder} class: * * <pre>{@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
// Imagine: // guard.lock(); // try { /* monitor locked and guard satisfied here */ } // finally { guard.unlock(); } // Here are Justin's design notes about this: // // This idea has come up from time to time, and I think one of my // earlier versions of Monitor even did something like this. I ended // up strongly favoring the current interface. //
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ListenerCallQueue.java
* * <p>Listeners are registered once via {@link #addListener} and then may be invoked by {@linkplain * #enqueue enqueueing} and then {@linkplain #dispatch dispatching} events. * * <p>The API of this class is designed to make it easy to achieve the following properties * * <ul> * <li>Multiple events for the same listener are never dispatched concurrently. * <li>Events for the different listeners are dispatched concurrently.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Dec 13 19:45:20 GMT 2023 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* extensions with parallel edges. If you need parallel edges, use {@link Network}. * * <h3>Building a {@code Graph}</h3> * * <p>The implementation classes that {@code common.graph} provides are not public, by design. To * create an instance of one of the built-in implementations of {@code Graph}, use the {@link * GraphBuilder} class: * * <pre>{@code * MutableGraph<Integer> graph = GraphBuilder.undirected().build(); * }</pre>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
// A note on memory visibility. // Many of the utilities in this class (transform, withFallback, withTimeout, asList, combine) // have two requirements that significantly complicate their design. // 1. Cancellation should propagate from the returned future to the input future(s). // 2. The returned futures shouldn't unnecessarily 'pin' their inputs after completion. //
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 59.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// * Future completion is defined by when #value becomes non-null/non SetFuture // * Future completion can be observed if the waiters field contains a TOMBSTONE // Timed Get // There are a few design constraints to consider // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I // have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* <li>graphs whose edges are unique objects * </ul> * * <h3>Building a {@code Network}</h3> * * <p>The implementation classes that {@code common.graph} provides are not public, by design. To * create an instance of one of the built-in implementations of {@code Network}, use the {@link * NetworkBuilder} class: * * <pre>{@code * MutableNetwork<Integer, MyEdge> network = NetworkBuilder.directed().build();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
this.hashFunction = new ChecksumHashFunction(this, 32, toString); } } /** * Returns a hash function implementing FarmHash's Fingerprint64, an open-source algorithm. * * <p>This is designed for generating persistent fingerprints of strings. It isn't * cryptographically secure, but it produces a high-quality hash with fewer collisions than some * alternatives we've used in the past. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0)