private V safeValue(CacheEntry<V> entry) { return (entry != null) ? entry.getValue() : null; }
public synchronized Set<V> removeMatchingKeys(com.google.common.base.Predicate<K> predicate) { Set<V> removedValues = Sets.newHashSet(); Iterator<Entry<K, CacheEntry<V>>> entryIterator = cacheEntries.entrySet().iterator(); while (entryIterator.hasNext()) { Entry<K, CacheEntry<V>> entry = entryIterator.next(); if (predicate.apply(entry.getKey())) { entryIterator.remove(); removedValues.add(entry.getValue().getValue()); } } return removedValues; }
public synchronized boolean containsValue(V val) { for (CacheEntry<V> entry : cacheEntries.values()) { V myValue = entry.getValue(); if (myValue != null && myValue.equals(val)) { return true; } } return false; }
private V safeValue(CacheEntry<V> entry) { return (entry != null) ? entry.getValue() : null; }
public synchronized boolean containsValue(V val) { for (CacheEntry<V> entry : cacheEntries.values()) { V myValue = entry.getValue(); if (myValue != null && myValue.equals(val)) { return true; } } return false; }
public synchronized Set<V> removeMatchingKeys(com.google.common.base.Predicate<K> predicate) { Set<V> removedValues = Sets.newHashSet(); Iterator<Entry<K, CacheEntry<V>>> entryIterator = cacheEntries.entrySet().iterator(); while (entryIterator.hasNext()) { Entry<K, CacheEntry<V>> entry = entryIterator.next(); if (predicate.apply(entry.getKey())) { entryIterator.remove(); removedValues.add(entry.getValue().getValue()); } } return removedValues; }