@Override public void putAll(Map<? extends K,? extends V> map) { for (Entry<? extends K,? extends V> entry : map.entrySet()) { put(entry.getKey(), entry.getValue()); } }
@Override public void putAll(Map<? extends K,? extends V> map) { for (Entry<? extends K,? extends V> entry : map.entrySet()) { put(entry.getKey(), entry.getValue()); } }
@Override public void putAll(Map<? extends K,? extends V> map) { for (Entry<? extends K,? extends V> entry : map.entrySet()) { put(entry.getKey(), entry.getValue()); } }
private V getAndCacheValue(K key) throws TasteException { V value = retriever.get(key); if (value == null) { value = (V) NULL; } synchronized (cache) { cache.put(key, value); } return value; }
private V getAndCacheValue(K key) throws TasteException { V value = retriever.get(key); if (value == null) { value = (V) NULL; } synchronized (cache) { cache.put(key, value); } return value; }
private V getAndCacheValue(K key) throws TasteException { V value = retriever.get(key); if (value == null) { value = (V) NULL; } synchronized (cache) { cache.put(key, value); } return value; }
private void rehash(int newHashSize) { K[] oldKeys = keys; V[] oldValues = values; numEntries = 0; numSlotsUsed = 0; if (countingAccesses) { recentlyAccessed = new BitSet(newHashSize); } keys = (K[]) new Object[newHashSize]; values = (V[]) new Object[newHashSize]; int length = oldKeys.length; for (int i = 0; i < length; i++) { K key = oldKeys[i]; if (key != null && key != REMOVED) { put(key, oldValues[i]); } } }
private void rehash(int newHashSize) { K[] oldKeys = keys; V[] oldValues = values; numEntries = 0; numSlotsUsed = 0; if (countingAccesses) { recentlyAccessed = new BitSet(newHashSize); } keys = (K[]) new Object[newHashSize]; values = (V[]) new Object[newHashSize]; int length = oldKeys.length; for (int i = 0; i < length; i++) { K key = oldKeys[i]; if (key != null && key != REMOVED) { put(key, oldValues[i]); } } }
private void rehash(int newHashSize) { K[] oldKeys = keys; V[] oldValues = values; numEntries = 0; numSlotsUsed = 0; if (countingAccesses) { recentlyAccessed = new BitSet(newHashSize); } keys = (K[]) new Object[newHashSize]; values = (V[]) new Object[newHashSize]; int length = oldKeys.length; for (int i = 0; i < length; i++) { K key = oldKeys[i]; if (key != null && key != REMOVED) { put(key, oldValues[i]); } } }