- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 159 for performance (0.27 sec)
-
android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java
// getDeclaredField to throw a NoSuchFieldException when the field is definitely there. // For these users fallback to a suboptimal implementation, based on synchronized. This will // be a definite performance hit to those users. thrownReflectionFailure = reflectionFailure; helper = new SynchronizedAtomicHelper(); } ATOMIC_HELPER = helper;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 8.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/AbstractSortedMultiset.java
* {@link Multiset#entrySet()}, as do many methods acting on the set returned by {@link * #elementSet()}. Override those methods for better performance. * * @author Louis Wasserman */ @GwtCompatible(emulated = true) @ElementTypesAreNonnullByDefault abstract class AbstractSortedMultiset<E extends @Nullable Object> extends AbstractMultiset<E>
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 4.6K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/hash/HashCodeBenchmark.java
* <li>equalsImpl: which implementation of array equality to use * </ul> * * <p><b>Important note:</b> the primary goal of this benchmark is to ensure that varying {@code * whereToDiffer} produces no observable change in performance. We want to make sure that the array * equals implementation is *not* short-circuiting to prevent timing-based attacks. Being fast is * only a secondary goal. * * @author Kurt Alfred Kluever */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/HashCodeBenchmark.java
* <li>equalsImpl: which implementation of array equality to use * </ul> * * <p><b>Important note:</b> the primary goal of this benchmark is to ensure that varying {@code * whereToDiffer} produces no observable change in performance. We want to make sure that the array * equals implementation is *not* short-circuiting to prevent timing-based attacks. Being fast is * only a secondary goal. * * @author Kurt Alfred Kluever */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ComparisonChain.java
* * <p><b>Note:</b> {@code ComparisonChain} instances are <b>immutable</b>. For this utility to work * correctly, calls must be chained as illustrated above. * * <p>Performance note: Even though the {@code ComparisonChain} caller always invokes its {@code * compare} methods unconditionally, the {@code ComparisonChain} implementation stops calling its
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Sep 21 17:28:11 GMT 2022 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
long result = 0; // Due to the way we shift, we can stop iterating once we've run out of data, the rest // of the result already being filled with zeros. // This loop is critical to performance, so please check HashBenchmark if altering it. int limit = Math.min(length, 8); for (int i = 0; i < limit; i++) { // Shift value left while iterating logically through the array.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* * <p>In order to allow proper garbage collection of unused locks, the edges of the lock graph are * weak references. * * <p><strong>Performance</strong> * * <p>The extra bookkeeping done by cycle detecting locks comes at some cost to performance. * Benchmarks (as of December 2011) show that: * * <ul> * <li>for an unnested {@code lock()} and {@code unlock()}, a cycle detecting lock takes 38ns as
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
guava/src/com/google/common/annotations/Beta.java
* or even removal, in a future release. An API bearing this annotation is exempt from any * compatibility guarantees made by its containing library. Note that the presence of this * annotation implies nothing about the quality or performance of the API in question, only the fact * that it is not "API-frozen." * * <p>It is generally safe for <i>applications</i> to depend on beta APIs, at the cost of some extra
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Dec 16 19:54:45 GMT 2020 - 1.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/AbstractMapBasedMultiset.java
} else { numberRemoved = oldCount; backingMap.remove(element); } frequency.add(-numberRemoved); size -= numberRemoved; return oldCount; } // Roughly a 33% performance improvement over AbstractMultiset.setCount(). @CanIgnoreReturnValue @Override public int setCount(@ParametricNullness E element, int count) { checkNonnegative(count, "count"); Count existingCounter;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 10.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* * <p>If you know that no node in {@code graph} is reachable by more than one path from the start * node(s), consider using {@link #forTree(SuccessorsFunction)} instead. * * <p><b>Performance notes</b> * * <ul> * <li>Traversals require <i>O(n)</i> time (where <i>n</i> is the number of nodes reachable from * the start node), assuming that the node objects have <i>O(1)</i> {@code equals()} and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0)