程序包 com.jn.langx.util.collection

接口概要

接口	说明
BoundedConcurrentHashMap.EvictionListener<K,V>
BoundedConcurrentHashMap.EvictionPolicy<K,V>
Differ<V,R extends DiffResult>
DiffResult

类概要

类	说明
Arrs	Array tools
BoundedConcurrentHashMap<K,V>	A hash table supporting full concurrency of retrievals and adjustable expected concurrency for updates.
Collects	Collection utilities
ConcurrentReferenceHashMap<K,V>	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.
CopyOnWriteHashMap<K,V>	An immutable map whose writes result in a new copy of the map to be created.
IdentityHashSet<E>	An IdentityHashMap-backed Set.
IdentityMap<K,V>	A Map where keys are compared by object identity, rather than equals().
IdentityMap.IdentityKey<K>	We need to base the identity on System.identityHashCode(Object) but attempt to lazily initialize and cache this value: being a native invocation it is an expensive value to retrieve.
IdentityMap.IdentityMapEntry<K,V>
IdentitySet	Set implementation that use == instead of equals() as its comparison mechanism.
IncludeExclude<ITEM>	Utility class to maintain a set of inclusions and exclusions.
IncludeExcludeSet<T,P>	Utility class to maintain a set of inclusions and exclusions.
LinkedCaseInsensitiveMap<V>
LinkedTreeMap<K,V>
MapAccessor
MultiKeyMap<V>
NonAbsentHashMap<K,V>	Avoid the follower code: Map> map = new HashMap>(); List list = map.get(key); if(list==null){ list = new ArrayList(); map.put(key, list); } list.add(e); using this class, your code will be: Supplier> supplier = new Supplier>(){ public List get(K key){ return new ArrayList(); } }; Map> map = new NonAbsentHashMap>(); map.get(key).add(e);
NonDistinctTreeMap<K,V>
NonDistinctTreeSet<E>
Pipeline<E>
PrefixHashMap<V>
PrimitiveArrays	Primitive array wrapper
PropertiesAccessor
StringMap	A map with key, value are String.
StringMapAccessor	A accessor for a StringMap
Tuple
WeakIdentityHashMap<K,V>	Implements a combination of WeakHashMap and IdentityHashMap.
WheelQueue<E>
WrappedNonAbsentMap<K,V>	Avoid the follower code: Map> map = new HashMap>(); List list = map.get(key); if(list==null){ list = new ArrayList(); map.put(key, list); } list.add(e); using this class, your code will be: Supplier> supplier = new Supplier>(){ public List get(K key){ return new ArrayList(); } }; Map> map0 = new HashMap>(); Map> map = WrapedNonAbsentMap.wrap(map0, supplier); map.get(key).add(e);

枚举概要

枚举	说明
BoundedConcurrentHashMap.Eviction
Collects.ListType
Collects.MapType
Collects.SetType
ConcurrentReferenceHashMap.Option
ConcurrentReferenceHashMap.ReferenceType	An option specifying which Java reference type should be used to refer to a key and/or value.