- Sort Score
- Result 10 results
- Languages All
Results 331 - 338 of 338 for EntrySet (0.03 sec)
-
docs/recipes.md
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Sat Aug 30 17:01:12 UTC 2025 - 47.8K bytes - Viewed (0) -
guava/src/com/google/common/cache/CacheBuilder.java
* containsKey(Object)}, nor by operations on the collection-views of {@link Cache#asMap}}. So, * for example, iterating through {@code Cache.asMap().entrySet()} does not reset access time for * the entries you retrieve. * * <p>When {@code duration} is zero, this method hands off to {@link #maximumSize(long)
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Oct 08 18:55:33 UTC 2025 - 51.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeMultiset.java
private static <T extends @Nullable Object> void successor( AvlNode<T> a, AvlNode<T> b, AvlNode<T> c) { successor(a, b); successor(b, c); } /* * TODO(jlevy): Decide whether entrySet() should return entries with an equals() method that * calls the comparator to compare the two keys. If that change is made, * AbstractMultiset.equals() can simply check whether two multisets have equal entry sets. */
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:58:48 UTC 2025 - 34.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/CacheLoadingTest.java
Map<Object, Object> result = cache.getAll(asList(lookupKeys)); assertThat(result.keySet()).containsExactlyElementsIn(asList(lookupKeys)); for (Entry<Object, Object> entry : result.entrySet()) { Object key = entry.getKey(); Object value = entry.getValue(); assertThat(result.get(key)).isSameInstanceAs(value); assertThat(result.get(value)).isNull();
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Sep 30 22:03:28 UTC 2025 - 91.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
if (found != null) { return found; // Found a path ending at the node! } // Recurse the edges. for (Entry<LockGraphNode, ExampleStackTrace> entry : allowedPriorLocks.entrySet()) { LockGraphNode preAcquiredLock = entry.getKey(); found = preAcquiredLock.findPathTo(node, seen); if (found != null) { // One of this node's allowedPriorLocks found a path. Prepend an
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Sep 11 17:06:34 UTC 2025 - 35.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/opensearch/client/SearchEngineClient.java
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Fri Nov 28 16:29:12 UTC 2025 - 122.4K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/cache/LocalCacheTest.java
map.put(two, three); map.remove(two, three); assertNotified(listener, two, three, RemovalCause.EXPLICIT); map.put(three, four); Iterator<?> i = map.entrySet().iterator(); i.next(); i.remove(); assertNotified(listener, three, four, RemovalCause.EXPLICIT); map.put(four, five); i = map.keySet().iterator(); i.next(); i.remove();Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Fri Dec 12 00:25:21 UTC 2025 - 115.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ClosingFuture.java
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Sep 11 13:51:27 UTC 2025 - 96.9K bytes - Viewed (0)