- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 20 for CPU (0.12 sec)
-
android/guava/src/com/google/common/base/internal/Finalizer.java
return false; } if (!finalizeReference(firstReference, finalizeReferentMethod)) { return false; } /* * Loop as long as we have references available so as not to waste CPU looking up the Method * over and over again. */ while (true) { Reference<?> furtherReference = queue.poll(); if (furtherReference == null) { return true; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Aug 23 12:54:09 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
* 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 * very compact {@code Striped<Lock>} of {@code availableProcessors() * 4} stripes, instead of * possibly thousands of locks which could be created in a {@code Map<K, Lock>} structure. *
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/hash/Striped64.java
* using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
} }; public abstract Queue<Integer> create(Comparator<Integer> comparator); } /** * Does a CPU intensive operation on Integer and returns a BigInteger Used to implement an * ordering that spends a lot of cpu. */ static class ExpensiveComputation implements Function<Integer, BigInteger> { @Override public BigInteger apply(Integer from) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
* 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 Louis Wasserman * @author Jon Noack */ @GwtIncompatible // not worth using in GWT for now @ElementTypesAreNonnullByDefault
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the // timeout is small we shouldn't park(). This needs to be traded off with the cpu overhead of // spinning, so we use SPIN_THRESHOLD_NANOS which is what AbstractQueuedSynchronizer uses for // similar purposes. // * We want to behave reasonably for timeouts of 0
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* java.util.LinkedHashMap}. 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 Louis Wasserman */ @J2ktIncompatible // no support for access-order mode in LinkedHashMap delegate @GwtIncompatible // not worth using in GWT for now
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/src/com/google/common/base/internal/Finalizer.java
return false; } if (!finalizeReference(firstReference, finalizeReferentMethod)) { return false; } /* * Loop as long as we have references available so as not to waste CPU looking up the Method * over and over again. */ while (true) { Reference<?> furtherReference = queue.poll(); if (furtherReference == null) { return true; }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Aug 23 12:54:09 GMT 2023 - 9.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* 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 @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
* 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 Louis Wasserman * @author Jon Noack */ @GwtIncompatible // not worth using in GWT for now @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0)