org.jgroups.blocks.LazyRemovalCache Maven / Gradle / Ivy
Go to download
This artifact provides a single jar that contains all classes required to use remote EJB and JMS, including
all dependencies. It is intended for use by those not using maven, maven users should just import the EJB and
JMS BOM's instead (shaded JAR's cause lots of problems with maven, as it is very easy to inadvertently end up
with different versions on classes on the class path).
The newest version!
package org.jgroups.blocks;
import org.jgroups.util.Util;
import java.util.*;
import java.util.concurrent.ConcurrentMap;
import java.util.concurrent.TimeUnit;
import java.util.function.Function;
import java.util.stream.Collectors;
/**
* Cache which doesn't remove elements on remove(), removeAll() or retainAll(), but only removes elements when a
* configurable size limit has been exceeded. In that case, all elements marked as removable and older than a
* configurable time are evicted. Elements are marked as removable by remove(), removeAll() and retainAll(). When
* an elements is marked as removable, but later reinserted, the mark is removed.
* @author Bela Ban
*/
public class LazyRemovalCache {
private final ConcurrentMap> map=Util.createConcurrentMap();
/** Max number of elements, if exceeded, we remove all elements marked as removable and older than max_age ms */
private final int max_elements;
private final long max_age; // ns
public interface Printable {
String print(K key, V entry);
}
public LazyRemovalCache() {
this(200, 5000L);
}
/**
* Creates a new instance
* @param max_elements The max number of elements in the cache
* @param max_age The max age (in ms) an entry can have before it is considered expired (and can be removed on
* the next sweep)
*/
public LazyRemovalCache(int max_elements, long max_age) {
this.max_elements=max_elements;
this.max_age=TimeUnit.NANOSECONDS.convert(max_age, TimeUnit.MILLISECONDS);
}
public boolean add(K key, V val) {
return add(key, val, false);
}
public boolean addIfAbsent(K key, V val) {
return add(key, val, true);
}
public void addAll(Map m) {
addAll(m, false);
}
public void addAllIfAbsent(Map m) {
addAll(m , true);
}
public Set>> entrySet() {
return map.entrySet();
}
public boolean containsKey(K key) {
return map.containsKey(key);
}
/** Returns true if all of the keys in keys are present. Returns false if one or more of the keys are absent */
public boolean containsKeys(Collection keys) {
for(K key: keys)
if(!map.containsKey(key))
return false;
return true;
}
public V get(K key) {
if(key == null)
return null;
Entry entry=map.get(key);
return entry != null? entry.val : null;
}
public K getByValue(V val) {
if(val == null) return null;
for(Map.Entry> entry: map.entrySet()) {
Entry v=entry.getValue();
if(Objects.equals(v.val, val))
return entry.getKey();
}
return null;
}
public void remove(K key) {
remove(key, false);
}
public void remove(K key, boolean force) {
if(key == null)
return;
if(force)
map.remove(key);
else {
Entry entry=map.get(key);
if(entry != null)
entry.setRemovable(true);
}
checkMaxSizeExceeded();
}
public void removeAll(Collection keys) {
removeAll(keys, false);
}
public void removeAll(Collection keys, boolean force) {
if(keys == null || keys.isEmpty())
return;
if(force)
map.keySet().removeAll(keys);
else {
for(K key: keys) {
Entry entry=map.get(key);
if(entry != null)
entry.setRemovable(true);
}
}
checkMaxSizeExceeded();
}
public void clear(boolean force) {
if(force)
map.clear();
else {
for(Map.Entry> entry: map.entrySet()) {
Entry val=entry.getValue();
if(val != null) {
Entry tmp=entry.getValue();
if(tmp != null)
tmp.setRemovable(true);
}
}
}
}
public void retainAll(Collection keys) {
retainAll(keys, false);
}
public void retainAll(Collection keys, boolean force) {
if(keys == null || keys.isEmpty())
return;
if(force)
map.keySet().retainAll(keys);
else {
map.entrySet().stream().filter(entry -> !keys.contains(entry.getKey())).forEach(entry -> {
Entry val=entry.getValue();
if(val != null)
val.setRemovable(true);
});
}
// now make sure that all elements in keys have removable=false
for(K key: keys) {
Entry val=map.get(key);
if(val != null && val.removable)
val.setRemovable(false);
}
checkMaxSizeExceeded();
}
public Set keySet() {
return map.keySet();
}
public Set values() {
return map.values().stream().map(entry -> entry.val).collect(Collectors.toSet());
}
public Iterable> valuesIterator() {
return () -> map.values().iterator();
}
/**
* Adds all value which have not been marked as removable to the returned set
* @return
*/
public Set nonRemovedValues() {
return map.values().stream().filter(entry -> !entry.removable).map(entry -> entry.val).collect(Collectors.toSet());
}
public Map contents() {
return contents(false);
}
public Map contents(boolean skip_removed_values) {
Map retval=new HashMap<>();
for(Map.Entry> entry: map.entrySet()) {
Entry val=entry.getValue();
if(val.isRemovable() && skip_removed_values)
continue;
retval.put(entry.getKey(), entry.getValue().val);
}
return retval;
}
public int size() {
return map.size();
}
public String printCache() {
StringBuilder sb=new StringBuilder();
for(Map.Entry> entry: map.entrySet()) {
sb.append(entry.getKey()).append(": ").append(entry.getValue()).append("\n");
}
return sb.toString();
}
public String printCache(Printable print_function) {
StringBuilder sb=new StringBuilder();
for(Map.Entry> entry: map.entrySet()) {
K key=entry.getKey();
sb.append(print_function.print(key, entry.getValue()));
}
return sb.toString();
}
public String toString() {
return printCache();
}
private void checkMaxSizeExceeded() {
if(map.size() > max_elements)
removeMarkedElements(false);
}
/**
* Removes elements marked as removable
* @param force If set to true, all elements marked as 'removable' will get removed, regardless of expiration
*/
public void removeMarkedElements(boolean force) {
long curr_time=System.nanoTime();
for(Iterator>> it=map.entrySet().iterator(); it.hasNext();) {
Map.Entry> entry=it.next();
Entry tmp=entry.getValue();
if(tmp == null)
continue;
if(tmp.removable && (force || (curr_time - tmp.timestamp) >= max_age)) {
it.remove();
}
}
}
/**
* Removes elements marked as removable
*/
public void removeMarkedElements() {
removeMarkedElements(false);
}
protected boolean add(K key, V val, boolean if_absent) {
boolean added=false;
if(key != null && val != null) {
Entry entry=new Entry<>(val);
added=if_absent? map.putIfAbsent(key, entry) == null : map.put(key, entry) == null;
if(added)
checkMaxSizeExceeded();
}
return added;
}
protected void addAll(Map m, boolean if_absent) {
if(m == null)
return;
for(Map.Entry entry: m.entrySet()) {
K key=entry.getKey();
V val=entry.getValue();
Entry e=new Entry<>(val);
if(if_absent)
map.putIfAbsent(key, e);
else
map.put(key, e);
}
checkMaxSizeExceeded();
}
public static class Entry {
protected final V val;
protected long timestamp=System.nanoTime();
protected boolean removable=false;
public Entry(V val) {
this.val=val;
}
public boolean isRemovable() {
return removable;
}
public void setRemovable(boolean flag) {
if(this.removable != flag) {
this.removable=flag;
timestamp=System.nanoTime();
}
}
public V getVal() {
return val;
}
public String toString() {
return toString(null);
}
public String toString(Function print_val) {
StringBuilder sb=new StringBuilder(print_val != null? print_val.apply(val) : val.toString()).append(" (");
long age=TimeUnit.MILLISECONDS.convert(System.nanoTime() - timestamp, TimeUnit.NANOSECONDS);
if(age < 1000)
sb.append(age).append(" ms");
else
sb.append(TimeUnit.SECONDS.convert(age, TimeUnit.MILLISECONDS)).append(" secs");
sb.append(" old").append((removable? ", removable" : "")).append(")");
return sb.toString();
}
}
}