- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 55 for track (0.18 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/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/collect/CompactHashSet.java
@VisibleForTesting @CheckForNull transient @Nullable Object[] elements; /** * Keeps track of metadata like the number of hash table bits and modifications of this data * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note * that we choose not to make this volatile, so we do less of a "best effort" to track such * errors, for better performance. */ private transient int metadata;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
// NOTE: If we ever want to use a custom executor here, have a look at CombinedFuture as we'll // need to handle RejectedExecutionException if (allMustSucceed) { // We need fail fast, so we have to keep track of which future failed so we can propagate // the exception immediately // Register a listener on each Future in the list to update the state of this future.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* * <p>This class is accessible but not supported in GWT as it references {@link * PermittedMetaException}. */ protected final class MultiExceptionListIterator implements ListIterator<E> { // TODO: track seen elements when order isn't guaranteed // TODO: verify contents afterward // TODO: something shiny and new instead of Stack // TODO: test whether null is supported (create a Feature) /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
} /** * A {@code LockGraphNode} associated with each lock instance keeps track of the directed edges in * the lock acquisition graph. */ private static class LockGraphNode { /** * The map tracking the locks that are known to be acquired before this lock, each associated * with an example stack trace. Locks are weakly keyed to allow proper garbage collection when * they are no longer referenced.
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/collect/LinkedHashMultimap.java
Set<V> createCollection() { return Platform.newLinkedHashSetWithExpectedSize(valueSetCapacity); } /** * {@inheritDoc} * * <p>Creates a decorated insertion-ordered set that also keeps track of the order in which * key-value pairs are added to the multimap. * * @param key key to associate with values in the collection * @return a new decorated set containing a collection of values for one key
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
private transient Map<K, KeyList<K, V>> keyToKeyList; private transient int size; /* * Tracks modifications to keyToKeyList so that addition or removal of keys invalidates * preexisting iterators. This does *not* track simple additions and removals of values * that are not the first to be added or last to be removed for their key. */ private transient int modCount;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K 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/Traverser.java
* href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursively</a>. * This is because the {@code forTree()}-based implementations don't keep track of visited nodes, * and therefore don't need to call `equals()` or `hashCode()` on the node objects; this saves * both time and space versus traversing the same graph using {@code forGraph()}. *
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)