Package com.pnfsoftware.jeb.util.collect

package com.pnfsoftware.jeb.util.collect

Collections, such as segments, custom maps/sets/lists, etc.

Related Packages

Package	Description
com.pnfsoftware.jeb.util	Utility library.

Class	Description
AddressHashMap<V>	A concurrent map whose keys are 'addresses' hardcoded as unsigned long.
AddressHashSet	A concurrent set whose values are 'addresses' hardcoded as unsigned long.
AddressSegmentMap<T extends ISegment<Long>>	Segment-map specialized to handle memory addresses, up to 64-bit.
AddressTreeMap<V>	A concurred ordered map whose keys are 'addresses' hardcoded as unsigned long.
AddressTreeSet	A concurrent ordered set whose values are 'addresses' hardcoded as unsigned long.
ArrayList1<E>	A list ideally suited to contain 0 or 1 element.
ArrayUtil	Utility methods for arrays.
AsyncEventQueue<E>	Highly efficient, loosely bounded concurrent pseudo-queue for single-reader/multiple-writers scenarios.
BiMap<K,V>	A bidirectional map of key-values.
Bitmap	A fast, efficient bitmap making optimal use of memory.
BytePipe	A dynamic byte array (pipe).
CacheMap<K,V>	A simple CacheMap, with optional support for cached entries ordering.
CFBytesTrie<T>	A trie map specialized to handle context-free (CF) binary strings.
CFBytesTrie.IKeyExtractor<T>	The key extractor provides the bytes (to be used in the trie) for an element to be stored in the trie.
CFBytesTrie.Node	A node in the trie.
CollectionOrder	List of collection orderings.
CollectionUtil	Convenience methods for Java collections, in particular, lists.
ConcurrentHashSet<E>	The set version of a ConcurrentHashMap.
ConcurrentList<T>	A concurrent version of ArrayList.
DisjointSets<T>	This type represents disjoint sets.
FastLongSet	A (small) set of long values backed by a Bitmap for fast insertion/retrieval and zero allocation at run-time.
HashedList<E>	A List type suitable for long lists of unique items for which presence checks are often required.
IdentityHashSet<E>	The set version of an IdentityHashMap.
IExtractor<T,K>	Generic extractor functional interface.
IMultiSegmentMap<K extends Comparable<K>,V extends ISegment<K>>	Definition of map holding multiple segments.
IntegerSegment	Standard implementation of a segment using an integer treated as a signed value.
IntGauge	An integer gauge is used to define an integer range to be filled.
IntList	A memory-efficient list of int primitives.
IntMap	A memory-efficient map (dictionary) of int primitives to int primitives.
ISegment<K extends Comparable<K>>	The value type used by segment-maps, a segment has a beginning and end.
ISegmentFactory<K,V>	Factory method for gap-map segments.
ISegmentGapVerifier<K>	A verifier for segment bounds to determine what to do when an operation is undertaken.
ISegmentGapVerifier.VerificationCode	List of verification codes.
ISegmentMap<K extends Comparable<K>,V extends ISegment<K>>	Definition of a segment-map, a data structure similar to an interval-map.
ItemHistory<T>	Generic tracker of items, based on a simple history queue (get last, get next) model.
Lists	Collection of utility functions to create of manipulate concrete or abstract lists.
LongSegment	Standard implementation of a segment using an long treated as a signed value.
MapBuilder<K,V>	A builder of maps.
Maps	Utility methods for maps.
MultiList<E>	A list of lists to be used as a fast-access multi-map for cases where the key is an integer index located in a compact [0, N] range.
MultiMap<K,V>	A multi-map of key-values, whose insertion order for the values of a given key is maintained.
MultiSegmentMap<K extends Comparable<K>,V extends ISegment<K>>	Standard implementation of a multi-segments maps.
ReferenceCounter<K>	A simple, thread-safe object reference counter.
SegmentMap<K extends Comparable<K>,V extends ISegment<K>>	Standard implementation of a segment-map using a TreeMap as the underlying data structure.
SetMap<K,V>	A map of keys to sets.
Sets	Utility methods for sets.
SynchronizedIdentityMap<K,V>	A serializable, inefficient, fully synchronized, identity pseudo-map.
SynchronizedLinkedMap<K,V>	A serializable, inefficient, fully synchronized, linked pseudo-map.
SynchronizedLinkedSet<E>	A serializable, inefficient, fully synchronized, linked pseudo-set.
VerifiedDeque<E>	Deque wrapper providing verification facility on push.
VerifiedDeque.FailureHandler<E>	Failure handler for VerifiedDeque.
WeakIdentityHashMap<K,V>	A pseudo map where keys are compared using identity comparison (like IdentityHashMap) but where the presence of an object as a key in the map does not prevent it being garbage collected (like WeakHashMap).
WeakPseudoList<T>	A list of weak references.
WeakValueMap<K,V>	A map whose values (and only the values, not the keys) do not prevent garbage collection of entries.