All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.nostra13.universalimageloader.cache.memory.impl.FuzzyKeyMemoryCache Maven / Gradle / Ivy

/*******************************************************************************
 * Copyright 2011-2013 Sergey Tarasevich
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *******************************************************************************/
package com.nostra13.universalimageloader.cache.memory.impl;

import com.nostra13.universalimageloader.cache.memory.MemoryCacheAware;

import java.util.Collection;
import java.util.Comparator;

/**
 * Decorator for {@link MemoryCacheAware}. Provides special feature for cache: some different keys are considered as
 * equals (using {@link Comparator comparator}). And when you try to put some value into cache by key so entries with
 * "equals" keys will be removed from cache before.
* NOTE: Used for internal needs. Normally you don't need to use this class. * * @author Sergey Tarasevich (nostra13[at]gmail[dot]com) * @since 1.0.0 */ public class FuzzyKeyMemoryCache implements MemoryCacheAware { private final MemoryCacheAware cache; private final Comparator keyComparator; public FuzzyKeyMemoryCache(MemoryCacheAware cache, Comparator keyComparator) { this.cache = cache; this.keyComparator = keyComparator; } @Override public boolean put(K key, V value) { // Search equal key and remove this entry synchronized (cache) { K keyToRemove = null; for (K cacheKey : cache.keys()) { if (keyComparator.compare(key, cacheKey) == 0) { keyToRemove = cacheKey; break; } } if (keyToRemove != null) { cache.remove(keyToRemove); } } return cache.put(key, value); } @Override public V get(K key) { return cache.get(key); } @Override public void remove(K key) { cache.remove(key); } @Override public void clear() { cache.clear(); } @Override public Collection keys() { return cache.keys(); } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy