- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 55 for Memory (0.26 sec)
-
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
* value slightly too high than slightly too low. If the value is not exact, the {@link * ImmutableIntArray} that is built will very likely occupy more memory than strictly necessary; * to trim memory usage, build using {@code builder.build().trimmed()}. */ public static Builder builder(int initialCapacity) { checkArgument(initialCapacity >= 0, "Invalid initialCapacity: %s", initialCapacity);
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
* value slightly too high than slightly too low. If the value is not exact, the {@link * ImmutableDoubleArray} that is built will very likely occupy more memory than strictly * necessary; to trim memory usage, build using {@code builder.build().trimmed()}. */ public static Builder builder(int initialCapacity) { checkArgument(initialCapacity >= 0, "Invalid initialCapacity: %s", initialCapacity);
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/Comparators.java
* Stream.of("foo", "quux", "banana", "elephant") * .collect(least(2, comparingInt(String::length))) * // returns {"foo", "quux"} * }</pre> * * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n * log n) time and O(n) space. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
* value slightly too high than slightly too low. If the value is not exact, the {@link * ImmutableLongArray} that is built will very likely occupy more memory than strictly necessary; * to trim memory usage, build using {@code builder.build().trimmed()}. */ public static Builder builder(int initialCapacity) { checkArgument(initialCapacity >= 0, "Invalid initialCapacity: %s", initialCapacity);
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/collect/CompactHashSet.java
* <p>This class should not be assumed to be universally superior to {@code java.util.HashSet}. * Generally speaking, this class reduces object allocation and memory consumption at the price of * moderately increased constant factors of CPU. Only use this class when there is a specific reason * to prioritize memory over CPU. * * @author Dimitris Andreou * @author Jon Noack */ @GwtIncompatible // not worth using in GWT for now
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
* offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log * k). In benchmarks, this implementation performs at least as well as either implementation, and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/GcFinalization.java
* } * public void testFooLeak() { * GcFinalization.awaitClear(fooWeakRef()); * } * }</pre> * * <p>This class cannot currently be used to test soft references, since this class does not try to * create the memory pressure required to cause soft references to be cleared. * * <p>This class only provides testing utilities. It is not designed for direct use in production or * for benchmarking. * * @author mike nonemacher
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.6K bytes - Viewed (0) -
android/guava/src/com/google/common/io/ByteStreams.java
* and virtual memory, this is not a problem - because it is mapped read-only, the kernel * can always page it to disk "for free". However, on systems where killing processes * happens all the time in normal conditions (i.e., android) the OS must make a tradeoff
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jan 17 18:59:58 GMT 2024 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
* If we make some other optimizations, this one will no longer be necessary. The optimization * could actually hurt in some cases, as it forces us to keep all inputs in memory until the * final input completes. */ ImmutableCollection<? extends Future<? extends InputT>> localFutures = collectsValues ? futures : null;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
* lock, but also maximizes memory footprint. On the other extreme, one could use a single lock for * all tasks, which minimizes memory footprint but also minimizes concurrency. Instead of choosing * either of these extremes, {@code Striped} allows the user to trade between required concurrency * and memory footprint. For example, if a set of tasks are CPU-bound, one could easily create a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1)