Example usage for java.util AbstractMap subclass-usage

Introduction

In this page you can find the example usage for java.util AbstractMap subclass-usage.

Usage

From source file ConcurrentReferenceHashMap.java

/**
 * An advanced hash table supporting configurable garbage collection semantics
 * of keys and values, optional referential-equality, full concurrency of
 * retrievals, and adjustable expected concurrency for updates.
 *
 * This table is designed around specific advanced use-cases. If there is any

From source file IdentityHashMap.java

public class IdentityHashMap extends AbstractMap implements Map, Cloneable, java.io.Serializable {
    /**
     * The hash table data.
     */
    private transient Entry table[];

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/output policy, but is generally faster and allows more
 * concurrency. This class is a good choice especially for tables that

From source file okuyama.imdst.util.FileBaseDataMap.java

/**
 * To manage files using a key-value.<br>
 * A small amount of memory usage, so File.<br>
 * Memory capacity can be managed independently of the number of data.<br>
 *
 * Inside, you are using a CoreFileBaseDataMap.<br>

From source file phex.common.collections.PatriciaTrie.java

/**
 * A PATRICIA Trie.
 * <p>
 * PATRICIA = Practical Algorithm to Retrieve Information Coded in Alphanumeric
 * <p>
 * A PATRICIA Trie is a compressed Trie. Instead of storing all data at the

From source file com.opensymphony.oscache.base.algorithm.AbstractConcurrentReadCache.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

From source file eu.aniketos.spdm.ds.impl.BidiMultiHashMap.java

/**
 * This data structure allow to store pair of data.
 * 
 * @author Patrik Dufresne
 * 
 * @param <K>

From source file ArraySet.java

class ArrayMap<K, V> extends AbstractMap<K, V> implements Map<K, V>, Cloneable, Externalizable {

    private static final long serialVersionUID = 1L;

    /**
     * The default initial capacity.

From source file WeakValuedHashMap.java

/**
 * A Map that references its values and can be used as a simple cache.
 * Instances are not thread-safe and must be wrapped with
 * Collections.synchronizedMap to be made thread-safe.
 * <p>
 * Note: Referenced entries may be automatically removed during

From source file com.workplacesystems.utilsj.collections.TransactionalBidiTreeMap.java

/**
 * Red-Black tree-based implementation of Map. This class guarantees
 * that the map will be in both ascending key order and ascending
 * value order, sorted according to the natural order for the key's
 * and value's classes.<p>
 *