- Sort Score
- Result 10 results
- Languages All
Results 171 - 180 of 471 for consider (0.04 sec)
-
android/guava-tests/test/com/google/common/graph/GraphsTest.java
private static final String E34 = "3-4"; private static final String E44 = "4-4"; private static final int NODE_COUNT = 20; private static final int EDGE_COUNT = 20; // TODO(user): Consider adding both error messages from here and {@link AbstractNetworkTest} // in one class (may be a utility class for error messages). private static final String ERROR_PARALLEL_EDGE = "connected by a different edge";
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 24.6K bytes - Viewed (0) -
guava/src/com/google/common/base/Joiner.java
* linear-time operation, and it can even have side effects. Thus, we limit the special case to * List, which is _even more likely_ to have size() implemented to be fast and side-effect-free. * * We could consider recognizing specific other collections as safe (like ImmutableCollection, * except ContiguousSet!) or as not worth this optimization (CopyOnWriteArrayList?). */ if (parts instanceof List) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Apr 14 15:16:19 UTC 2025 - 21K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FluentFuture.java
* who can't use Java 8, or who want an API more focused than {@code CompletableFuture}. (If you * need to adapt between {@code CompletableFuture} and {@code ListenableFuture}, consider <a * href="https://github.com/lukas-krecan/future-converter">Future Converter</a>.) * * <h3>Extension</h3> * * If you want a class like {@code FluentFuture} but with extra methods, we recommend declaring your
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 19.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFutureState.java
// * Future completion can be observed if the waitersField 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
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 33.2K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/NullPointerTester.java
* explicit {@code @NullableDecl} annotation (see <a * href="https://github.com/google/guava/issues/1819">#1819</a>). * * <p>It is not necessary to consider visibility, return type, or type parameter declarations. The * declaration of a method with the same name and formal parameters as {@link Object#equals} that
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Jul 14 14:44:08 UTC 2025 - 24.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
* be updated after modifications to {@code graph}. * * @since 33.1.0 (present with return type {@code Graph} since 20.0) */ // TODO(b/31438252): Consider potential optimizations for this algorithm. public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) { ImmutableGraph.Builder<N> transitiveClosure =
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
*/ public static class Builder<C extends Comparable<?>> { private final List<Range<C>> ranges; public Builder() { this.ranges = new ArrayList<>(); } // TODO(lowasser): consider adding union, in addition to add, that does allow overlap /** * Add the specified range to this builder. Adjacent ranges are permitted and will be merged,
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 27.4K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/Striped.java
* stripes (much like the birthday paradox, where much fewer than anticipated birthdays are needed * for a pair of them to match). Please consider carefully the implications of the number of * stripes, the intended concurrency level, and the typical number of keys used in a {@code * bulkGet(keys)} operation. See <a href="http://www.mathpages.com/home/kmath199.htm">Balls in
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 20.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
* be updated after modifications to {@code graph}. * * @since 33.1.0 (present with return type {@code Graph} since 20.0) */ // TODO(b/31438252): Consider potential optimizations for this algorithm. public static <N> ImmutableGraph<N> transitiveClosure(Graph<N> graph) { ImmutableGraph.Builder<N> transitiveClosure =
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractFutureState.java
// * Future completion can be observed if the waitersField 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
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 34.8K bytes - Viewed (0)