- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 23 for minimize (0.26 sec)
-
guava/src/com/google/common/cache/AbstractLoadingCache.java
import java.util.Map; import java.util.concurrent.Callable; import java.util.concurrent.ExecutionException; /** * This class provides a skeletal implementation of the {@code Cache} interface to minimize the * effort required to implement this interface. * * <p>To implement a cache, the programmer needs only to extend this class and provide an
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Sat Aug 06 17:12:03 GMT 2022 - 2.7K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/AbstractLoadingCache.java
import java.util.Map; import java.util.concurrent.Callable; import java.util.concurrent.ExecutionException; /** * This class provides a skeletal implementation of the {@code Cache} interface to minimize the * effort required to implement this interface. * * <p>To implement a cache, the programmer needs only to extend this class and provide an
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Aug 06 17:12:03 GMT 2022 - 2.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSet.java
} @Override public int size() { return size; } // We're careful to put only E instances into the array in the mainline. // (In the backport, we don't need this suppression, but we keep it to minimize diffs.) @SuppressWarnings("unchecked") @Override public UnmodifiableIterator<E> iterator() { return asList().iterator(); } @Override @Nullable Object[] internalArray() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 3.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/AbstractCache.java
import java.util.concurrent.Callable; import java.util.concurrent.ConcurrentMap; import java.util.concurrent.ExecutionException; /** * This class provides a skeletal implementation of the {@code Cache} interface to minimize the * effort required to implement this interface. * * <p>To implement a cache, the programmer needs only to extend this class and provide an
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 9.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/PairedStats.java
* * <p>The corresponding root-mean-square error in {@code x} as a function of {@code y} is a * fraction {@code sqrt(1/(R*R) - 1)} of the population standard deviation of {@code x}. This fit * does not normally minimize that error: to do that, you should swap the roles of {@code x} and * {@code y}. * * <h3>Non-finite values</h3> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 12.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
* represents the task. This maximizes concurrency by having each unique key mapped to a unique * 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
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) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* #aboutToAcquire(CycleDetectingLock)} and {@link #lockStateChanged(CycleDetectingLock)}. */ // This is logically a Set, but an ArrayList is used to minimize the amount // of allocation done on lock()/unlock(). private static final ThreadLocal<ArrayList<LockGraphNode>> acquiredLocks = new ThreadLocal<ArrayList<LockGraphNode>>() { @Override
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) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
// since, after all, this class is also a reentrant mutual exclusion lock!? /* * One of the key challenges of this class is to prevent lost signals, while trying hard to * minimize unnecessary signals. One simple and correct algorithm is to signal some other waiter * with a satisfied guard (if one exists) whenever any thread occupying the monitor exits the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
* ImmutableSortedSet#orderedBy}. */ /* * TODO(cpovirk): use Object[] instead of E[] in the mainline? (The backport is different and * doesn't need this suppression, but we keep it to minimize diffs.) Generally be more clear * about when we have an Object[] vs. a Comparable[] or other array type in internalArray? If we * used Object[], we might be able to optimize toArray() to use clone() sometimes. (See
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
// * The element with (index == from) should be kept. // * Everything with (index > from) has not been checked yet. // Check from the end of the list backwards (minimize expected cost of // moving elements when remove() is called). Stop before 'from' because // we already know that should be kept. for (int n = list.size() - 1; n > from; n--) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0)