- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 70 for much (0.22 sec)
-
guava/pom.xml
<url>https://github.com/google/guava</url> <description> Guava is a suite of core and expanded libraries that include utility classes, Google's collections, I/O classes, and much more. </description> <dependencies> <dependency> <groupId>com.google.guava</groupId> <artifactId>failureaccess</artifactId> <version>1.0.2</version> </dependency> <dependency>
XML - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Mar 11 16:37:45 GMT 2024 - 8.9K bytes - Viewed (0) -
android/guava/pom.xml
<url>https://github.com/google/guava</url> <description> Guava is a suite of core and expanded libraries that include utility classes, Google's collections, I/O classes, and much more. </description> <dependencies> <dependency> <groupId>com.google.guava</groupId> <artifactId>failureaccess</artifactId> <version>1.0.2</version> </dependency> <dependency>
XML - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 11 16:37:45 GMT 2024 - 8.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
* * <p><i>Performance notes:</i> while the cartesian product of lists of size {@code m, n, p} is a * list of size {@code m x n x p}, its actual memory consumption is much smaller. When the * cartesian product is constructed, the input lists are merely copied. Only as the resulting list * is iterated are the individual lists created, and these are not retained after iteration. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 16:48:36 GMT 2024 - 41.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
* them, even though they usually won't be needed. If you have such arguments, use the conventional * if/throw idiom instead. * * <p>Depending on your message arguments, memory may be allocated for boxing and varargs array * creation. However, the methods of this class have a large number of overloads that prevent such * allocations in many common cases. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
* <li>If many tasks will be triggered by the same event, one heavyweight task may delay other * tasks -- even tasks that are not themselves {@code directExecutor} tasks. * <li>If many such tasks are chained together (such as with {@code * future.transform(...).transform(...).transform(...)....}), they may overflow the stack. * (In simple cases, callers can avoid this by registering all tasks with the same {@link
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 41.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* such as {@code removeAll()} and {@code clear()} are called on the filtered set, only elements * that satisfy the filter will be removed from the underlying set. * * <p>The returned set isn't threadsafe or serializable, even if {@code unfiltered} is. * * <p>Many of the filtered set's methods, such as {@code size()}, iterate across every element in
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// override .get() (since it is final) and therefore this is equivalent to calling .get() // and unpacking the exceptions like we do below (just much faster because it is a single // field read instead of a read, several branches and possibly creating exceptions). Object v = ((AbstractFuture<?>) future).value; if (v instanceof Cancellation) {
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/collect/ImmutableMultiset.java
public Builder<E> addAll(Iterator<? extends E> elements) { super.addAll(elements); return this; } /** * If the specified collection is backed by an ObjectCountHashMap, it will be much more * efficient to iterate over it by index rather than an entry iterator, which will need to * allocate an object for each entry, so we check for that. */ @CheckForNull
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
expectedInsertions = 1; } /* * TODO(user): Put a warning in the javadoc about tiny fpp values, since the resulting size * is proportional to -log(p), but there is not much of a point after all, e.g. * optimalM(1000, 0.0000000000000001) = 76680 which is less than 10kb. Who cares! */ long numBits = optimalNumOfBits(expectedInsertions, fpp);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* * <p><b>Warning:</b> by definition, this comparator is not <i>consistent with equals</i> (as * defined {@linkplain Comparator here}). Avoid its use in APIs, such as {@link * TreeSet#TreeSet(Comparator)}, where such consistency is expected. * * <p>The returned comparator is serializable. * * <p><b>Java 8+ users:</b> Use the lambda expression {@code (a, b) -> 0} instead (in certain
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0)