Example usage for java.util Map interface-usage

List of usage examples for java.util Map interface-usage

Introduction

In this page you can find the example usage for java.util Map interface-usage.

Usage

From source file WeakIdentityHashMap.java

/**
 * A hashtable-based <tt>Map</tt> implementation with <em>weak keys</em> and
 * using reference-equality in place of object-equality when comparing keys (and
 * values). In an <tt>WeakIdentityHashMap</tt>, two keys <tt>k1</tt> and
 * <tt>k2</tt> are considered equal if and only if <tt>(k1==k2)</tt>. An
 * entry in a <tt>WeakIdentityHashMap</tt> will automatically be removed when

From source file com.github.jillesvangurp.persistentcachingmap.PersistentCachingMap.java

/**
 * <p>
 * Persistent caching map for working with large map like data structures that do not fit into memory. Like any map,
 * this map uses buckets to store things. Each bucket is persisted in a file and has an id that is a long. To persist
 * and calculate the bucket ids from the key, a {@link PersistentCachingMapCodec} instance is used. An instance of this
 * codec must be provided at construction time.

From source file com.baobao.utils.cache.SequencedHashMap.java

/**
 * <p>
 * This class has been copied from Commons Collections, version 2.1 in order
 * to eliminate the dependency of dbcp on collections.  It has package scope
 * to prevent its inclusion in the dbcp public API. The class declaration below
 * should *not* be changed to public.

From source file org.apache.hadoop.hbase.regionserver.LruHashMap.java

/**
 * The LruHashMap is a memory-aware HashMap with a configurable maximum
 * memory footprint.
 * <p>
 * It maintains an ordered list of all entries in the map ordered by
 * access time.  When space needs to be freed becase the maximum has been

From source file ConcurrentHashMap.java

/**
 * A version of Hashtable supporting concurrency for both retrievals and
 * updates:
 * 
 * <dl>
 * <dt> Retrievals

From source file org.dishevelled.multimap.impl.AbstractHashedMap.java

/**
 * Abstract hashed map.
 */
abstract class AbstractHashedMap<K, V> implements Map<K, V> {
    protected static final String NO_NEXT_ENTRY = "No next() entry in the iteration";
    protected static final String NO_PREVIOUS_ENTRY = "No previous() entry in the iteration";

From source file com.github.jsonj.JsonObject.java

/**
 * Representation of json objects. This class extends LinkedHashMap and may be used as such. In addition a lot of
 * convenience is provided in the form of methods you are likely to need when working with json objects
 * programmatically.
 */
public class JsonObject implements Map<String, JsonElement>, JsonElement {

From source file com.mgmtp.jfunk.common.util.ExtendedProperties.java

/**
 * <p>
 * Properties implementation that does not have the encoding restrictions of
 * {@link java.util.Properties}.
 * </p>
 * Note that all operations consider potential defaults, e. g. the results returned by methods such

From source file ConcurrentReaderHashMap.java

/**
 * A version of Hashtable that supports mostly-concurrent reading, but exclusive
 * writing. Because reads are not limited to periods without writes, a
 * concurrent reader policy is weaker than a classic reader/writer policy, but
 * is generally faster and allows more concurrency. This class is a good choice
 * especially for tables that are mainly created by one thread during the

From source file WeakIdentityMap.java

/**
 * WeakIdentityMap is like WeakHashMap, except it uses a key's identity
 * hashcode and equals methods. WeakIdentityMap is not thread-safe and must be
 * wrapped with Collections.synchronizedMap to be made thread-safe.
 * <p>
 * The documentation for WeakHashMap states that it is intended primarily for