All Downloads are FREE. Search and download functionalities are using the official Maven repository.
Please wait. This can take some minutes ...
Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
org.geneweaver.io.connector.CloseableCache Maven / Gradle / Ivy
package org.geneweaver.io.connector;
import java.util.Collection;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;
import java.util.function.BiConsumer;
import java.util.function.BiFunction;
import java.util.function.Function;
public class CloseableCache implements Map{
private int max;
private Map map;
public CloseableCache(int max) {
this.max = max;
this.map = new LinkedHashMap<>(max);
}
/**
* @param key
* @param value
* @return
* @throws Exception
* @see java.util.Map#put(java.lang.Object, java.lang.Object)
*/
public V put(K key, V value) {
V v = map.put(key, value);
if (map.size()>max) {
K oldestKey = map.keySet().iterator().next();
V old = map.remove(oldestKey);
try {
old.close();
} catch (Exception ne) {
throw new RuntimeException(ne);
}
}
return v;
}
/**
* @return
* @see java.util.Map#size()
*/
public int size() {
return map.size();
}
/**
* @return
* @see java.util.Map#isEmpty()
*/
public boolean isEmpty() {
return map.isEmpty();
}
/**
* @param key
* @return
* @see java.util.Map#containsKey(java.lang.Object)
*/
public boolean containsKey(Object key) {
return map.containsKey(key);
}
/**
* @param value
* @return
* @see java.util.Map#containsValue(java.lang.Object)
*/
public boolean containsValue(Object value) {
return map.containsValue(value);
}
/**
* @param key
* @return
* @see java.util.Map#get(java.lang.Object)
*/
public V get(Object key) {
return map.get(key);
}
/**
* @param key
* @return
* @see java.util.Map#remove(java.lang.Object)
*/
public V remove(Object key) {
return map.remove(key);
}
/**
* @param m
* @see java.util.Map#putAll(java.util.Map)
*/
public void putAll(Map extends K, ? extends V> m) {
map.putAll(m);
}
/**
*
* @see java.util.Map#clear()
*/
public void clear() {
map.clear();
}
/**
* @return
* @see java.util.Map#keySet()
*/
public Set keySet() {
return map.keySet();
}
/**
* @return
* @see java.util.Map#values()
*/
public Collection values() {
return map.values();
}
/**
* @return
* @see java.util.Map#entrySet()
*/
public Set> entrySet() {
return map.entrySet();
}
/**
* @param o
* @return
* @see java.util.Map#equals(java.lang.Object)
*/
public boolean equals(Object o) {
return map.equals(o);
}
/**
* @return
* @see java.util.Map#hashCode()
*/
public int hashCode() {
return map.hashCode();
}
/**
* @param key
* @param defaultValue
* @return
* @see java.util.Map#getOrDefault(java.lang.Object, java.lang.Object)
*/
public V getOrDefault(Object key, V defaultValue) {
return map.getOrDefault(key, defaultValue);
}
/**
* @param action
* @see java.util.Map#forEach(java.util.function.BiConsumer)
*/
public void forEach(BiConsumer super K, ? super V> action) {
map.forEach(action);
}
/**
* @param function
* @see java.util.Map#replaceAll(java.util.function.BiFunction)
*/
public void replaceAll(BiFunction super K, ? super V, ? extends V> function) {
map.replaceAll(function);
}
/**
* @param key
* @param value
* @return
* @see java.util.Map#putIfAbsent(java.lang.Object, java.lang.Object)
*/
public V putIfAbsent(K key, V value) {
return map.putIfAbsent(key, value);
}
/**
* @param key
* @param value
* @return
* @see java.util.Map#remove(java.lang.Object, java.lang.Object)
*/
public boolean remove(Object key, Object value) {
return map.remove(key, value);
}
/**
* @param key
* @param oldValue
* @param newValue
* @return
* @see java.util.Map#replace(java.lang.Object, java.lang.Object, java.lang.Object)
*/
public boolean replace(K key, V oldValue, V newValue) {
return map.replace(key, oldValue, newValue);
}
/**
* @param key
* @param value
* @return
* @see java.util.Map#replace(java.lang.Object, java.lang.Object)
*/
public V replace(K key, V value) {
return map.replace(key, value);
}
/**
* @param key
* @param mappingFunction
* @return
* @see java.util.Map#computeIfAbsent(java.lang.Object, java.util.function.Function)
*/
public V computeIfAbsent(K key, Function super K, ? extends V> mappingFunction) {
return map.computeIfAbsent(key, mappingFunction);
}
/**
* @param key
* @param remappingFunction
* @return
* @see java.util.Map#computeIfPresent(java.lang.Object, java.util.function.BiFunction)
*/
public V computeIfPresent(K key, BiFunction super K, ? super V, ? extends V> remappingFunction) {
return map.computeIfPresent(key, remappingFunction);
}
/**
* @param key
* @param remappingFunction
* @return
* @see java.util.Map#compute(java.lang.Object, java.util.function.BiFunction)
*/
public V compute(K key, BiFunction super K, ? super V, ? extends V> remappingFunction) {
return map.compute(key, remappingFunction);
}
/**
* @param key
* @param value
* @param remappingFunction
* @return
* @see java.util.Map#merge(java.lang.Object, java.lang.Object, java.util.function.BiFunction)
*/
public V merge(K key, V value, BiFunction super V, ? super V, ? extends V> remappingFunction) {
return map.merge(key, value, remappingFunction);
}
}