org.castor.cache.hashbelt.container
Class MapContainer
- Cloneable, Container, Map, Serializable
public final class MapContainer
A very basic, HashMap-based implementation of the hashmap container strategy,
using nothing more than a basic hashmap to store key/value pairs. This works
well for lots of gets and a reasonably high volume of removes; if few removes
are required, and iterators are important to your particluar use-case of the
cache, it's better to use the FastIteratingContainer, which can handle
iterating at a higher speed, still has a map for accessing hash values, but has
a higher removal cost.
$Revision: 5951 $ $Date: 2006-04-25 16:09:10 -0600 (Tue, 25 Apr 2006) $
CONCURRENCY_LEVEL , DEFAULT_INITIAL_CAPACITY , DEFAULT_LOAD_FACTOR , SEGMENT_MASK , entrySet , keySet , loadFactor , segments , table , threshold , values , votesForResize |
bitcount , clear , clone , contains , containsKey , containsValue , elements , entrySet , eq , get , hash , isEmpty , keySet , keys , newTable , put , putAll , rehash , remove , remove , resize , size , values |
Intalio Inc. (C) 1999-2006. All rights reserved http://www.intalio.com