- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 106 for significantly (0.23 sec)
-
android/guava-tests/test/com/google/common/util/concurrent/AggregateFutureStateFallbackAtomicHelperTest.java
* prevent us from selecting our {@code SafeAtomicHelper} strategy. * * <p>Stashing this in a static field avoids loading it over and over again and speeds up test * execution significantly. */ private static final ClassLoader NO_ATOMIC_FIELD_UPDATER = getClassLoader( ImmutableSet.of( AtomicIntegerFieldUpdater.class.getName(),
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* from uniform), and amortized since some operations can trigger a hash table resize. * * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AggregateFutureStateFallbackAtomicHelperTest.java
* prevent us from selecting our {@code SafeAtomicHelper} strategy. * * <p>Stashing this in a static field avoids loading it over and over again and speeds up test * execution significantly. */ private static final ClassLoader NO_ATOMIC_FIELD_UPDATER = getClassLoader( ImmutableSet.of( AtomicIntegerFieldUpdater.class.getName(),
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* * <ul> * <li>If you only access one end of the queue, and do use a maximum size, this class will perform * significantly worse than a {@code PriorityQueue} with manual eviction above the maximum * size. In many cases {@link Ordering#leastOf} may work for your use case with significantly * improved (and asymptotically superior) performance.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
guava/src/com/google/common/cache/CacheLoader.java
* only the entries for {@code keys} will be returned from {@code getAll}. * * <p>This method should be overridden when bulk retrieval is significantly more efficient than * many individual lookups. Note that {@link LoadingCache#getAll} will defer to individual calls * to {@link LoadingCache#get} if this method is not overridden. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Dec 19 20:20:14 GMT 2022 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* from uniform), and amortized since some operations can trigger a hash table resize. * * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. * * <p>This class should not be assumed to be universally superior to {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
enum BloomFilterStrategies implements BloomFilter.Strategy { /** * See "Less Hashing, Same Performance: Building a Better Bloom Filter" by Adam Kirsch and Michael * Mitzenmacher. The paper argues that this trick doesn't significantly deteriorate the * performance of a Bloom filter (yet only needs two 32bit hash functions). */ MURMUR128_MITZ_32() { @Override public <T extends @Nullable Object> boolean put(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 10.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/CacheLoader.java
* only the entries for {@code keys} will be returned from {@code getAll}. * * <p>This method should be overridden when bulk retrieval is significantly more efficient than * many individual lookups. Note that {@link LoadingCache#getAll} will defer to individual calls * to {@link LoadingCache#get} if this method is not overridden. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 19 20:20:14 GMT 2022 - 9.6K bytes - Viewed (0)