- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 59 for memory (0.16 sec)
-
guava/src/com/google/common/collect/ImmutableRangeSet.java
* user-created objects that aren't accessible via this range set's methods. This is generally * used to determine whether {@code copyOf} implementations should make an explicit copy to avoid * memory leaks. */ boolean isPartialView() { return ranges.isPartialView(); } /** Returns a new builder for an immutable range set. */ public static <C extends Comparable<?>> Builder<C> builder() {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 26.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
* user-created objects that aren't accessible via this range set's methods. This is generally * used to determine whether {@code copyOf} implementations should make an explicit copy to avoid * memory leaks. */ boolean isPartialView() { return ranges.isPartialView(); } /** Returns a new builder for an immutable range set. */ public static <C extends Comparable<?>> Builder<C> builder() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
} /* * The maximum number of bits in a square root for which we'll precompute an explicit half power * of two. This can be any value, but higher values incur more class load time and linearly * increasing memory consumption. */ @VisibleForTesting static final int SQRT2_PRECOMPUTE_THRESHOLD = 256; @VisibleForTesting static final BigInteger SQRT2_PRECOMPUTED_BITS =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* percentiles together takes about 55% as long as computing them separately. * * <p>When calling {@link ScaleAndIndex#compute} (in {@linkplain ScaleAndIndexes#compute either * form}), the memory requirement is 8*N bytes for the copy of the dataset plus an overhead which is * independent of N (but depends on the quantiles being computed). When calling {@link
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* for {@code minimumBits}, will return identically-behaving {@link HashFunction} instances. * * @param minimumBits a positive integer. This can be arbitrarily large. The returned {@link * HashFunction} instance may use memory proportional to this integer. * @return a hash function, described above, that produces hash codes of length {@code * minimumBits} or greater */ public static HashFunction goodFastHash(int minimumBits) {
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) -
android/guava-tests/test/com/google/common/cache/CacheTesting.java
assertFalse(segment.isLocked()); Map<?, ?> table = segmentTable(segment); // cleanup and then check count after we have a strong reference to all entries segment.cleanUp(); // under high memory pressure keys/values may be nulled out but not yet enqueued assertThat(table.size()).isAtMost(segment.count); for (Entry<?, ?> entry : table.entrySet()) { assertNotNull(entry.getKey());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 16.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/LongsTest.java
assertThat((long) arraysDim1 * arraysDim2).isNotEqualTo((long) (arraysDim1 * arraysDim2)); long[][] arrays = new long[arraysDim1][]; // it's shared to avoid using too much memory in tests long[] sharedArray = new long[arraysDim2]; Arrays.fill(arrays, sharedArray); try { Longs.concat(arrays); fail(); } catch (IllegalArgumentException expected) { }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 30K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/LongsTest.java
assertThat((long) arraysDim1 * arraysDim2).isNotEqualTo((long) (arraysDim1 * arraysDim2)); long[][] arrays = new long[arraysDim1][]; // it's shared to avoid using too much memory in tests long[] sharedArray = new long[arraysDim2]; Arrays.fill(arrays, sharedArray); try { Longs.concat(arrays); fail(); } catch (IllegalArgumentException expected) { }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 30K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
*/ public static void rotate(int[] array, int distance, int fromIndex, int toIndex) { // There are several well-known algorithms for rotating part of an array (or, equivalently, // exchanging two blocks of memory). This classic text by Gries and Mills mentions several: // https://ecommons.cornell.edu/bitstream/handle/1813/6292/81-452.pdf. // (1) "Reversal", the one we have here.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/CacheBuilder.java
* having a hash table of size eight. Providing a large enough estimate at construction time * avoids the need for expensive resizing operations later, but setting this value unnecessarily * high wastes memory. * * @return this {@code CacheBuilder} instance (for chaining) * @throws IllegalArgumentException if {@code initialCapacity} is negative * @throws IllegalStateException if an initial capacity was already set
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 44.8K bytes - Viewed (0)