Examples of CacheMap

com.sun.jmx.remote.opt.util.CacheMap

Like WeakHashMap, except that the keys of the n most recently-accessed entries are kept as {@link SoftReference softreferences}. Accessing an element means creating it, or retrieving it with {@link #get(Object) get}. Because these entries are kept with soft references, they will tend to remain even if their keys are not referenced elsewhere. But if memory is short, they will be removed.
com.sun.jmx.remote.util.CacheMap

Like WeakHashMap, except that the keys of the n most recently-accessed entries are kept as {@link SoftReference softreferences}. Accessing an element means creating it, or retrieving it with {@link #get(Object) get}. Because these entries are kept with soft references, they will tend to remain even if their keys are not referenced elsewhere. But if memory is short, they will be removed.
org.apache.lenya.util.CacheMap
A map with a maximum capacity. When the map is full, the oldest entry is removed. @deprecated Use org.apache.commons.collections.map.LRUMap
org.apache.marmotta.kiwi.ehcache.util.CacheMap
A map API wrapper around EHCache caches so it is compatible with the KiWi caching API. @author Sebastian Schaffert (sschaffert@apache.org)
org.apache.openjpa.util.CacheMap
Fixed-size map that has ability to pin/unpin entries and move overflow to a backing soft map. @author Patrick Linskey @author Abe White
org.knopflerfish.util.CacheMap
Timeout version of a HashMap.
Entries in the map have a limited lifelength, and the get method will only return the stored object during a limited time period.

After the timeout period, thr object will be removed.
@see CachedObject
org.zkoss.util.CacheMap
The cache map. The key-to-value mappings hold in this map is temporary. They are removed when GC demanding memory and a criteria is met. The criteria is whether the mapping is old enough (called lifetime), or the upper bound is hit (called max-size).
The criteria can be changed by overriding {@link #canExpunge}. When to check the criteria can be changed by overriding {@link #shallExpunge}.
If the criteria is totally independent of GC, you could override {@link #newQueue} to return null. Then, {@link #shallExpunge}always returns true (rather than when GC is activated) -- of course, you could override {@link #shallExpunge}, too.
It is different from WeakHashMap:
- The mapping might be removed even if the key is hold somewhere (i.e., strong reachable).
- The mapping might not be removed when GC demanding memory if the criteria doesn't meet.
- It is not serializable.
Like other maps, it is not thread-safe. To get one, use java.util.Collections.synchronizedMap.
Implementation Note: there is another version of CacheMap that uses WeakReference for each value (refer to obsolete). The drawback is that all mapping will be queued and need to be examined, because GC tends to release all reference at once.
We don't use PhantomReference because it is still required to re-create the reference after enqueued. @author tomyeh

Examples of com.sun.jmx.remote.opt.util.CacheMap

  delegatedContext(AccessControlContext authenticatedACC,
       Subject delegatedSubject)
      throws SecurityException {


  if (principalsCache == null || accCache == null) {
      principalsCache = new CacheMap(PRINCIPALS_CACHE_SIZE);
      accCache = new CacheMap(ACC_CACHE_SIZE);
  }


  // Retrieve the principals for the given
  // delegated subject from the cache
  //

View Full Code Here

Examples of com.sun.jmx.remote.util.CacheMap

       Subject delegatedSubject,
       boolean removeCallerContext)
      throws SecurityException {


  if (principalsCache == null || accCache == null) {
      principalsCache = new CacheMap(PRINCIPALS_CACHE_SIZE);
      accCache = new CacheMap(ACC_CACHE_SIZE);
  }


  // Retrieve the principals for the given
  // delegated subject from the cache
  //

View Full Code Here

Examples of com.sun.jmx.remote.util.CacheMap

        }
    }


    private static boolean test(int cacheSize) throws Exception {
        System.out.println("CacheMap test with cache size " + cacheSize);
        CacheMap map = new CacheMap(cacheSize);
        int size = 0;
        int maxIterations = cacheSize * 10;
        while (map.size() == size && size < maxIterations) {
            Integer key = new Integer(size);
            Object x = map.put(key, "x");
            if (x != null) {
                System.out.println("Map already had entry " + key + "!");
                return false;
            }
            x = map.get(key);
            if (!"x".equals(x)) {
                System.out.println("Got back surprising value: " + x);
                return false;
            }
            size++;
        }
        System.out.println("Map size is " + map.size() + " after inserting " +
                           size + " elements");
        do {
            System.gc();
            Thread.sleep(1);
            System.out.println("Map size is " + map.size() + " after GC");
        } while (map.size() > cacheSize);
        if (map.size() < cacheSize) {
            System.out.println("Map shrank to less than cache size: " +
                               map.size() + " (surprising but not wrong)");
        } else
            System.out.println("Map shrank to cache size as expected");
        int lowest = size - cacheSize;
        // lowest value that can still be in cache if LRU is respected
        for (Iterator it = map.entrySet().iterator(); it.hasNext(); ) {
            Map.Entry entry = (Map.Entry) it.next();
            Integer x = (Integer) entry.getKey();
            int xx = x.intValue();
            if (xx < lowest || xx >= size) {
                System.out.println("Old value remained (" + x + "), " +
                                   "expected none earlier than " + lowest);
                return false;
            }
            Object xxx = entry.getValue();
            if (!"x".equals(xxx)) {
                System.out.println("Got back surprising value: " + xxx);
                return false;
            }
        }
        if (map.size() > 0)
            System.out.println("Remaining elements are the most recent ones");
        System.out.println("Test passed");
        return true;
    }

View Full Code Here

Examples of org.apache.lenya.util.CacheMap


    /**
     * Ctor.
     */
    public SourceCacheImpl() {
        this.cache = new CacheMap(CAPACITY);
    }

View Full Code Here

Examples of org.apache.lenya.util.CacheMap

    protected static final int CAPACITY = 1000;
    private CacheMap cache;
    
    protected CacheMap getCache() {
        if (this.cache == null) {
            this.cache = new CacheMap(CAPACITY, getLogger());
        }
        return this.cache;
    }

View Full Code Here

Examples of org.apache.lenya.util.CacheMap

            if (resolver != null) {
                getManager().release(resolver);
            }
        }
        
        CacheMap cache = getCache();


        synchronized (cache) {
            controller = (AccessController) cache.get(key);
            if (controller == null) {
                getLogger().debug("No access controller in cache.");
                controller = doResolveAccessController(webappUrl);
                cache.put(key, controller);
            } else {
                getLogger().debug("Getting access controller from cache.");
            }
        }

View Full Code Here

Examples of org.apache.lenya.util.CacheMap

     * Returns the cache.
     * @return A cache object.
     */
    protected CacheMap getCache() {
        if (this.cache == null) {
            this.cache = new CacheMap(CAPACITY, getLogger());
        }
        return this.cache;
    }

View Full Code Here

Examples of org.apache.lenya.util.CacheMap


    /**
     * Ctor.
     */
    public SourceCacheImpl() {
        cache = new CacheMap(CAPACITY);
    }

View Full Code Here

Examples of org.apache.lenya.util.CacheMap


    /**
     * Ctor.
     */
    public SourceCacheImpl() {
        cache = new CacheMap(CAPACITY);
    }

View Full Code Here

Examples of org.apache.lenya.util.CacheMap


    /**
     * Ctor.
     */
    public SourceCacheImpl() {
        cache = new CacheMap(CAPACITY);
    }

View Full Code Here

0 1 2 3

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.