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

org.apache.camel.util.LRUCache Maven / Gradle / Ivy

There is a newer version: 4.6.0
Show newest version
/**
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You 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 org.apache.camel.util;

import java.io.Serializable;
import java.util.Collection;
import java.util.Map;
import java.util.Set;
import java.util.concurrent.atomic.LongAdder;

import com.github.benmanes.caffeine.cache.Cache;
import com.github.benmanes.caffeine.cache.Caffeine;
import com.github.benmanes.caffeine.cache.RemovalCause;
import com.github.benmanes.caffeine.cache.RemovalListener;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

/**
 * A cache that uses a near optional LRU Cache.
 * 

* The Cache is implemented by Caffeine which provides an efficient cache. *

* If this cache stores {@link org.apache.camel.Service} then this implementation will on eviction * invoke the {@link org.apache.camel.Service#stop()} method, to auto-stop the service. *

* Use {@link LRUCacheFactory} to create a new instance (do not use the constructor). * * @see LRUCacheFactory * @see LRUSoftCache * @see LRUWeakCache */ public class LRUCache implements Map, RemovalListener, Serializable { private static final Logger LOG = LoggerFactory.getLogger(LRUCache.class); protected final LongAdder hits = new LongAdder(); protected final LongAdder misses = new LongAdder(); protected final LongAdder evicted = new LongAdder(); private int maxCacheSize = 10000; private boolean stopOnEviction; private final Cache cache; private final Map map; /** * Constructs an empty LRUCache instance with the * specified maximumCacheSize, and will stop on eviction. * * @param maximumCacheSize the max capacity. * @throws IllegalArgumentException if the initial capacity is negative */ public LRUCache(int maximumCacheSize) { this(16, maximumCacheSize); // 16 is the default initial capacity in ConcurrentLinkedHashMap } /** * Constructs an empty LRUCache instance with the * specified initial capacity, maximumCacheSize, and will stop on eviction. * * @param initialCapacity the initial capacity. * @param maximumCacheSize the max capacity. * @throws IllegalArgumentException if the initial capacity is negative */ public LRUCache(int initialCapacity, int maximumCacheSize) { //Do not stop service if ConcurrentLinkedHashMap try to evict entry when its max capacity is zero. this(initialCapacity, maximumCacheSize, maximumCacheSize > 0); } /** * Constructs an empty LRUCache instance with the * specified initial capacity, maximumCacheSize,load factor and ordering mode. * * @param initialCapacity the initial capacity. * @param maximumCacheSize the max capacity. * @param stopOnEviction whether to stop service on eviction. * @throws IllegalArgumentException if the initial capacity is negative */ public LRUCache(int initialCapacity, int maximumCacheSize, boolean stopOnEviction) { this(initialCapacity, maximumCacheSize, stopOnEviction, false, false, false); } /** * Constructs an empty LRUCache instance with the * specified initial capacity, maximumCacheSize,load factor and ordering mode. * * @param initialCapacity the initial capacity. * @param maximumCacheSize the max capacity. * @param stopOnEviction whether to stop service on eviction. * @param soft whether to use soft values a soft cache (default is false) * @param weak whether to use weak keys/values as a weak cache (default is false) * @param syncListener whether to use synchronous call for the eviction listener (default is false) * @throws IllegalArgumentException if the initial capacity is negative */ public LRUCache(int initialCapacity, int maximumCacheSize, boolean stopOnEviction, boolean soft, boolean weak, boolean syncListener) { Caffeine caffeine = Caffeine.newBuilder() .initialCapacity(initialCapacity) .maximumSize(maximumCacheSize) .removalListener(this); if (soft) { caffeine.softValues(); } if (weak) { caffeine.weakKeys(); caffeine.weakValues(); } if (syncListener) { caffeine.executor(Runnable::run); } this.cache = caffeine.build(); this.map = cache.asMap(); this.maxCacheSize = maximumCacheSize; this.stopOnEviction = stopOnEviction; } @Override public V get(Object o) { V answer = map.get(o); if (answer != null) { hits.increment(); } else { misses.increment(); } return answer; } @Override public int size() { return map.size(); } @Override public boolean isEmpty() { return map.isEmpty(); } @Override public boolean containsKey(Object o) { return map.containsKey(o); } @Override public boolean containsValue(Object o) { return map.containsValue(0); } @Override public V put(K k, V v) { return map.put(k, v); } @Override public V remove(Object o) { return map.remove(o); } public void putAll(Map map) { this.cache.putAll(map); } @Override public void clear() { map.clear(); resetStatistics(); } @Override public Set keySet() { return map.keySet(); } @Override public Collection values() { return map.values(); } @Override public Set> entrySet() { return map.entrySet(); } @Override public void onRemoval(K key, V value, RemovalCause cause) { if (cause.wasEvicted()) { evicted.increment(); LOG.trace("onRemoval {} -> {}", key, value); if (stopOnEviction) { try { // stop service as its evicted from cache ServiceHelper.stopService(value); } catch (Exception e) { LOG.warn("Error stopping service: " + value + ". This exception will be ignored.", e); } } } } /** * Gets the number of cache hits */ public long getHits() { return hits.longValue(); } /** * Gets the number of cache misses. */ public long getMisses() { return misses.longValue(); } /** * Gets the number of evicted entries. */ public long getEvicted() { return evicted.longValue(); } /** * Returns the maxCacheSize. */ public int getMaxCacheSize() { return maxCacheSize; } /** * Rest the cache statistics such as hits and misses. */ public void resetStatistics() { hits.reset(); misses.reset(); evicted.reset(); } public void cleanUp() { cache.cleanUp(); } @Override public String toString() { return "LRUCache@" + ObjectHelper.getIdentityHashCode(this); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy