程序包 com.firefly.utils.collection

接口概要

接口	说明
ConcurrentAutomaticClearMap<K,V>
ConcurrentLinkedHashMap.MapEventListener<K,V>	The callback interface, when the some events(get, put, remove, eliminate) occur, the map will call it.
ConcurrentReferenceHashMap.Reference<K,V>	A reference to an ConcurrentReferenceHashMap.Entry contained in the map.
ConsistentHash.HashFunction
Trie<V>	A Trie String lookup data structure.

类概要

类	说明
AbstractConcurrentAutomaticClearMap<K,V>
AbstractTrie<V>
ArrayQueue<E>	Queue backed by circular array.
ArrayTernaryTrie<V>	A Ternary Trie String lookup data structure.
ArrayTrie<V>	A Trie String lookup data structure using a fixed size array.
BlockingArrayQueue<E>	A BlockingQueue backed by a circular array capable or growing.
ConcurrentArrayQueue<T>	A concurrent, unbounded implementation of Queue that uses singly-linked array blocks to store elements.
ConcurrentArrayQueue.Block<E>
ConcurrentLinkedHashMap<K,V>	The ConcurrentLinkedHashMap is the reentrant version of LinkedHashMap, which is the thread safe collection.
ConcurrentReferenceHashMap<K,V>	A ConcurrentHashMap that uses soft or weak references for both keys and values.
ConcurrentReferenceHashMap.Entry<K,V>	A single map entry.
ConsistentHash<T>
HashedArrayTree<T>
IdentityHashMap<K,V>
IdentityHashMap.Entry<K,V>
LazyList	Lazy List creation.
MultiMap<V>	A multi valued Map.
SoftReferenceConcurrentHashMap<K,V>
TreeTrie<V>	A Trie String lookup data structure using a tree This implementation is always case insensitive and is optimal for a variable number of fixed strings with few special characters.
WeakReferenceConcurrentHashMap<K,V>

枚举概要

枚举	说明
ConcurrentReferenceHashMap.ReferenceType	Various reference types supported by this map.
ConcurrentReferenceHashMap.Restructure	The types of restructuring that can be performed.