- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 162 for much (0.21 sec)
-
android/guava/src/com/google/common/collect/Multimap.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 15.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
* ImmutableList.copyOf} and use that list instead. */ public List<Integer> asList() { /* * Typically we cache this kind of thing, but much repeated use of this view is a performance * anti-pattern anyway. If we cache, then everyone pays a price in memory footprint even if * they never use this method. */ return new AsList(this); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java
* ImmutableList.copyOf} and use that list instead. */ public List<Double> asList() { /* * Typically we cache this kind of thing, but much repeated use of this view is a performance * anti-pattern anyway. If we cache, then everyone pays a price in memory footprint even if * they never use this method. */ return new AsList(this); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 19.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code * add(x)} operations <i>do not</i> create objects for the garbage collector to deal with, and for
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
guava/src/com/google/common/collect/FluentIterable.java
*/ @SuppressWarnings("nullness") // Unsafe, but we can't do much about it now. public final Optional<@NonNull E> firstMatch(Predicate<? super E> predicate) { return Iterables.<E>tryFind((Iterable<@NonNull E>) getDelegate(), predicate); } /** * Returns a fluent iterable that applies {@code function} to each element of this fluent * iterable.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 35.3K bytes - Viewed (0) -
android/guava/src/com/google/common/io/TempFileCreator.java
* We don't *need* to use reflection to access Optional: It's available on all JDKs we * support, and Android code won't get this far, anyway, because ProcessHandle is * unavailable. But given how much other reflection we're using, we might as well use it * here, too, so that we don't need to also suppress an AndroidApiChecker error. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 06 17:11:11 GMT 2023 - 12.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java
fail(); } catch (IndexOutOfBoundsException expected) { } } /* * Whenever an implementation uses `instanceof` on a parameter instance, the test has to know that * (so much for "black box") and try instances that both do and don't pass the check. The "don't" * half of that is more awkward to arrange... */ private static <T> Iterable<T> iterable(final Collection<T> collection) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 06 15:23:21 GMT 2023 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* remaining 7.0 permits, and the remaining 3.0, we serve them by fresh permits produced by the * rate limiter. * * We already know how much time it takes to serve 3 fresh permits: if the rate is * "1 token per second", then this will take 3 seconds. But what does it mean to serve 7 stored
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* to reduce cache contention on most processors. Padding is * overkill for most Atomics because they are usually irregularly * scattered in memory and thus don't interfere much with each * other. But Atomic objects residing in arrays will tend to be * placed adjacent to each other, and so will most often share * cache lines (with a huge negative performance impact) without * this precaution.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/ImmutableLongArrayTest.java
fail(); } catch (IndexOutOfBoundsException expected) { } } /* * Whenever an implementation uses `instanceof` on a parameter instance, the test has to know that * (so much for "black box") and try instances that both do and don't pass the check. The "don't" * half of that is more awkward to arrange... */ private static <T> Iterable<T> iterable(final Collection<T> collection) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 20.2K bytes - Viewed (0)