All Classes and Interfaces
Class
Description
The extended reference queue allows for adding (weak)
object with an associated action.
Blocking queue implemented as array.
A bidirectional hash map.
A blocking queue allows to enqueue or dequeue
elements.
A bloom filter is a probabilistic data structure for
checking if a value is contained in a set.
Cache that provide expiration in case of
a) timetolive is exceeded
b) the max number of data has been reached (lru behaviour)
A cache for an object that was loaded from a file or url.
Entry for cache.
A checked collection can be used for concurrent modification bug tracking.
Throws exception on change.
Wrapper for collections.
A wrapper for a list to detect undesired
concurrent access.
A queue that blocks until an element is available.
Closed exception.
Interface for scheduling a command.
A set based on identity comparison.
Special methods for a lease time collection.
The entry cleaner (for performing cleanup code on removed entries in a LRU).
This class combines the list and map interface.
Provide access to the index map via list interface.
Provide access to the index map via map interface.
Interface for thread-safe data structures using a read-write lock.
Lease time map with supervised write/update access.
Collection that remove elements after a lease time automatically.
Synchronized lease time collection.
A least recently used map.
Replacement for Map.Entry which cannot be instantiated :-(
Wrap a map and call template methods on modification.
An MultiCollection is a map with the ability
to store more than one element per key (an collection).
Iterator that operates over multiple collections.
A nested map refers to parent maps for entries
not found in this map.
A cache for CachedObjects that reflect files.
Class extending java.util.Properties to preserve order
by redirecting calls to an internal linked hash map.
Collection that remove elements after a lease time on trigger.
Thread-safe wrapper for maps that uses a read/write lock.
A file-based map that can be shared across the operating system
using file locks.
Lambda interface throwing IOExceptions.
Lambda interface throwing IOExceptions without any input or output.
Lambda interface throwing IOExceptions without map being passed.
A sorted list allowing duplicates of elements
(unlike java.util.TreeSet).
Timer based on Java java timer.
Tree data structure.
Represents a node of a tree.
The two-way multi-collection allows fast reverse lookup,
by containing a second multi-collection,
which reversely maps values to keys.
A weak entry is a reference with an additional argument
that can be inspected the referent is garbage collected.
HashMap with weak reference on both sides.
A list with weak entries.
Weakreference has the disadvantage that it does not support
transparent equals() and hashcode() methods.
A weak set for entries that will be automatically removed when
no references to them are existing any more.
A map with weak values.