Examples of LruCache

com.mysql.jdbc.util.LRUCache
@author Mark Matthews @version $Id$
com.opensymphony.oscache.base.algorithm.LRUCache

LRU (Least Recently Used) algorithm for the cache.

Since release 2.3 this class requires Java 1.4 to use the LinkedHashSet. Use prior OSCache release which require the Jakarta commons-collections SequencedHashMap class or the LinkedList class if neither of the above classes are available.

No synchronization is required in this class since the AbstractConcurrentReadCache already takes care of any synchronization requirements.
@version $Revision: 427 $ @author Victor Salaman @author Francois Beauregard @author Alain Bergevin @author Chris Miller
com.sun.appserv.util.cache.LruCache
LRUCache in-memory bounded cache with an LRU list
net.sf.saxon.sort.LRUCache
An LRU cache, based on LinkedHashMap. Synthesized and simplified from various published examples of the genre. The methods are not synchronized.
net.sf.swarmcache.LRUCache
org.activemq.util.LRUCache
Represnts an LRUCache of a fixed maximum size which by default will remove items based on access order but can be used to use insertion order @version $Revision: 1.1.1.1 $
org.apache.abdera.protocol.client.cache.LRUCache
org.apache.abdera.protocol.client.cache.lru.LRUCache
org.apache.activemq.util.LRUCache
A Simple LRU Cache @param < K> @param < V>
org.apache.camel.util.LRUCache
A Least Recently Used Cache @version $Revision: 1.1 $
org.apache.ibatis.cache.decorators.LruCache
Lru (first in, first out) cache decorator
org.apache.solr.search.LRUCache
@version $Id: LRUCache.java 1065312 2011-01-30 16:08:25Z rmuir $
org.apache.ws.util.LRUCache
Least-Recently-Used Cache. This is a synchronized cache which provides the ability to set the maxCapacity of objects maintained for controlling memory usage. The cache will automatically purge the LRU entry from the cache in an overflow situation..... @author Sal Campana
org.aspectj.org.eclipse.jdt.internal.core.util.LRUCache
The LRUCache is a hashtable that stores a finite number of elements. When an attempt is made to add values to a full cache, the least recently used values in the cache are discarded to make room for the new values as necessary.
The data structure is based on the LRU virtual memory paging scheme.
Objects can take up a variable amount of cache space by implementing the ILRUCacheable interface.
This implementation is NOT thread-safe. Synchronization wrappers would have to be added to ensure atomic insertions and deletions from the cache. @see org.aspectj.org.eclipse.jdt.internal.core.util.ILRUCacheable
org.broad.igv.util.collections.LRUCache
A least-recently-used cache with a maximum size that can be altered. @author jrobinso
org.codehaus.activemq.util.LRUCache
Represnts an LRUCache of a fixed maximum size which by default will remove items based on access order but can be used to use insertion order @version $Revision: 1.2 $
org.codehaus.groovy.runtime.memoize.LRUCache
A cache backed by a Collections.SynchronizedMap @author Vaclav Pech
org.eclipse.core.internal.expressions.util.LRUCache
Copied from JDT/Core to get a cache which is independent from JDK 1.4.
org.eclipse.dltk.internal.core.util.LRUCache
org.eclipse.jdt.internal.core.util.LRUCache
The LRUCache is a hashtable that stores a finite number of elements. When an attempt is made to add values to a full cache, the least recently used values in the cache are discarded to make room for the new values as necessary.
The data structure is based on the LRU virtual memory paging scheme.
Objects can take up a variable amount of cache space by implementing the ILRUCacheable interface.
This implementation is NOT thread-safe. Synchronization wrappers would have to be added to ensure atomic insertions and deletions from the cache. @see org.eclipse.jdt.internal.core.util.ILRUCacheable
org.enhydra.jdbc.util.LRUCache
Simple implementation of a cache, using Least Recently Used algorithm for discarding members when the cache fills up
org.exist.storage.cache.LRUCache
A simple cache implementing a Last Recently Used policy. This cache implementation is based on a {@link org.exist.util.hashtable.SequencedLongHashMap}. Contrary to the other {@link org.exist.storage.cache.Cache} implementations,LRUCache ignores reference counts or timestamps. @author wolf
org.logicblaze.lingo.util.LRUCache
A simple least-recently-used cache of a fixed size. @version $Revision$
org.pdf4j.saxon.sort.LRUCache
An LRU cache, based on LinkedHashMap. Synthesized and simplified from various published examples of the genre. The methods are not synchronized.
org.teiid.core.util.LRUCache
This class replaces a verbose legacy implementation of LRUCaching.
xbird.util.cache.algorithm.LRUCache
A volatile Cache implementation which provides LRU feature.
The entries might automatically be removed when its key is no longer in ordinary use.

@author Makoto YUI @see LRUMap @see WeakHashMap

Examples of com.sun.appserv.util.cache.LruCache

                                    new Integer(maxEntries),
                                    new Long(timeout),
                                    new Float(loadFactor)}));
            }


            LruCache c = new LruCache();
            c.init(maxEntries, timeout, loadFactor, (Properties) null);
            c.addCacheListener(
                    new CacheListener() {
                        public void trimEvent(Object key, Object value) {
                            cache.remove(key);
                            if (logger.isLoggable(Logger.FINER)) {
                                logger.finer(

View Full Code Here

Examples of com.sun.appserv.util.cache.LruCache

            readyStore = new BaseCache();
            cacheSize = DEFAULT_CACHE_SIZE;
            readyStore.init(cacheSize, loadFactor, null);
        } else {
            cacheSize = (cacheSize <= 0) ? DEFAULT_CACHE_SIZE : cacheSize;
            LruCache lru = new LruCache(DEFAULT_CACHE_SIZE);
            if (numberOfVictimsToSelect >= 0) {
                loadFactor = (float) (1.0 - (1.0 *
                                             numberOfVictimsToSelect/cacheSize));
            }
            lru.init(cacheSize, idleTimeout, loadFactor, null);
            readyStore = lru;
            readyStore.addCacheListener(this);
        }
        
        if (idleTimeout > 0) {

View Full Code Here

Examples of net.sf.saxon.sort.LRUCache


    public static boolean isValidURI(CharSequence value) {


        // TODO: XSD 1.1 allows any string to be used as an instance of xs:anyURI


        LRUCache cache = caches.get();
        if (cache == null) {
            cache = new LRUCache(10);
            caches.set(cache);
        }


        if (cache.get(value) != null) {
            return true;
        }


        String sv = Whitespace.trim(value);


        // Allow zero-length strings (RFC2396 is ambivalent on this point)
        if (sv.length() == 0) {
            return true;
        }


        // Allow a string if the java.net.URI class accepts it
        try {
            new URI(sv);
            cache.put(value, value);
            return true;
        } catch (URISyntaxException e) {
            // keep trying
            // Note: it's expensive to throw exceptions on a success path, so we keep a cache.
        }


        // Allow a string if it can be escaped into a form that java.net.URI accepts
        sv = EscapeURI.iriToUri(sv).toString();
        try {
            new URI(sv);
            cache.put(value, value);
            return true;
        } catch (URISyntaxException e) {
            return false;
        }
    }

View Full Code Here

Examples of net.sf.swarmcache.LRUCache

    private final ObjectCache cache;


    public SwarmCache(int size)
    {


        LRUCache lruCache = new LRUCache();


        lruCache.setSize(size);


        this.cache = lruCache;
    }

View Full Code Here

Examples of org.activemq.util.LRUCache

     * @param maximumNumberOfProducersToTrack
     *                   number of producers expected in the system
     */
    public ActiveMQMessageAudit(int windowSize, final int maximumNumberOfProducersToTrack) {
        this.windowSize = windowSize;
        map = new LRUCache(maximumNumberOfProducersToTrack);
    }

View Full Code Here

Examples of org.apache.abdera.protocol.client.cache.LRUCache

  
  /**
   * Initializes the client HTTP cache
   */
  public static Cache initCache(Abdera abdera) {
    return new LRUCache(abdera);
  }

View Full Code Here

Examples of org.apache.abdera.protocol.client.cache.LRUCache

   * Initializes the client HTTP cache
   */
  public Cache initCache(CacheFactory factory) {
    Cache cache = null;
    if (factory != null) cache = factory.getCache(abdera);
    return (cache != null) ? cache : new LRUCache(abdera);
  }

View Full Code Here

Examples of org.apache.abdera.protocol.client.cache.LRUCache


    /**
     * Initializes the client HTTP cache
     */
    public static Cache initCache(Abdera abdera) {
        return new LRUCache(abdera);
    }

View Full Code Here

Examples of org.apache.abdera.protocol.client.cache.lru.LRUCache

  }
  
  public Cache initCache(CacheFactory factory) {
    Cache cache = null;
    if (factory != null) cache = factory.getCache(abdera);
    return (cache != null) ? cache : new LRUCache(abdera);
  }

View Full Code Here

Examples of org.apache.abdera.protocol.client.cache.lru.LRUCache

  }
  
  public Cache initCache(CacheFactory factory) {
    Cache cache = null;
    if (factory != null) cache = factory.getCache(abdera);
    return (cache != null) ? cache : new LRUCache(abdera);
  }

View Full Code Here

0 1 2 3 4 5

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.