- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for trac (0.16 sec)
-
guava/src/com/google/common/collect/JdkBackedImmutableMap.java
int n, @Nullable Entry<K, V>[] entryArray, boolean throwIfDuplicateKeys) { Map<K, V> delegateMap = Maps.newHashMapWithExpectedSize(n); // If duplicates are allowed, this map will track the last value for each duplicated key. // A second pass will retain only the first entry for that key, but with this last value. The // value will then be replaced by null, signaling that later entries with the same key should
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 4.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/LazyStackTraceBenchmark.java
int recursionCount; private static final Object duh = new Object(); @Param Mode mode; enum Mode { LAZY_STACK_TRACE { @Override List<StackTraceElement> getStackTrace(Throwable t) { return lazyStackTrace(t); } }, GET_STACK_TRACE { @Override List<StackTraceElement> getStackTrace(Throwable t) { return asList(t.getStackTrace()); } };
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ConcurrentHashMultisetBasherTest.java
import java.util.concurrent.atomic.AtomicInteger; import junit.framework.TestCase; /** * Basher test for {@link ConcurrentHashMultiset}: start a bunch of threads, have each of them do * operations at random. Each thread keeps track of the per-key deltas that it's directly * responsible for; after all threads have completed, we sum the per-key deltas and compare to the * existing multiset values. * * @author mike nonemacher */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/TimeoutFuture.java
super(message); } @Override public synchronized Throwable fillInStackTrace() { setStackTrace(new StackTraceElement[0]); return this; // no stack trace, wouldn't be useful anyway } } @Override @CheckForNull protected String pendingToString() { ListenableFuture<? extends V> localInputFuture = delegateRef;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPairIterator.java
/** * If the graph is undirected, each unordered [node, otherNode] pair (except self-loops) will be * visited twice if there is an edge connecting them. To avoid returning duplicate {@link * EndpointPair}s, we keep track of the nodes that we have visited. When processing endpoint * pairs, we skip if the "other node" is in the visited set, as shown below: * * <pre> * Nodes = {N1, N2, N3, N4} * N2 __
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jul 09 17:31:04 GMT 2021 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
/** * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}. * This implementation requires O(|N|) time. Classes extending this one may manually keep track of * the number of edges as the graph is updated, and override this method for better performance. */ protected long edgeCount() { long degreeSum = 0L; for (N node : nodes()) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/base/internal/Finalizer.java
ReferenceQueue<Object> queue, PhantomReference<Object> frqReference) { this.queue = queue; this.finalizableReferenceClassReference = new WeakReference<>(finalizableReferenceClass); // Keep track of the FRQ that started us so we know when to stop. this.frqReference = frqReference; } /** Loops continuously, pulling references off the queue and cleaning them up. */
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) -
guava-tests/benchmark/com/google/common/base/LazyStackTraceBenchmark.java
int recursionCount; private static final Object duh = new Object(); @Param Mode mode; enum Mode { LAZY_STACK_TRACE { @Override List<StackTraceElement> getStackTrace(Throwable t) { return lazyStackTrace(t); } }, GET_STACK_TRACE { @Override List<StackTraceElement> getStackTrace(Throwable t) { return asList(t.getStackTrace()); } };
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ConcurrentHashMultisetBasherTest.java
import java.util.concurrent.atomic.AtomicInteger; import junit.framework.TestCase; /** * Basher test for {@link ConcurrentHashMultiset}: start a bunch of threads, have each of them do * operations at random. Each thread keeps track of the per-key deltas that it's directly * responsible for; after all threads have completed, we sum the per-key deltas and compare to the * existing multiset values. * * @author mike nonemacher */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.8K bytes - Viewed (0) -
guava/src/com/google/common/base/internal/Finalizer.java
ReferenceQueue<Object> queue, PhantomReference<Object> frqReference) { this.queue = queue; this.finalizableReferenceClassReference = new WeakReference<>(finalizableReferenceClass); // Keep track of the FRQ that started us so we know when to stop. this.frqReference = frqReference; } /** Loops continuously, pulling references off the queue and cleaning them up. */
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)