All Classes and Interfaces
Class
Description
Function interface for for requesting accessor instances that enable
accessing the attribute 'name' of type 'clazz' on objects of type 'S'.
An iterable that caches (possibly computed) items returned from an underlying iterator, such that
subsequent iterations run from the cache.
T is the Timestamp object (e.g.
An iterable over an iterator that caches the iterator's results.
In iterator that adds items to a cache as it proceeds.
Created by IntelliJ IDEA.
FIXME Make use of PrefetchIteratorScala
Created by Claus Stadler
Date: Oct 7, 2010
Time: 5:00:39 PM
Not sure if this this should really inherit from single valued accessor
-> Maybe rename to BasicAccessor or SimpleAccessor
An accessor that refers to an immutable collection.
Collection view of an underlying iterable.
User: raven
Date: 4/17/11
Time: 12:36 AM
A delta collection unifies the modification methods add/addAll/remove/removeAll/clear
into a single
DeltaCollection.delta(Collection, Collection) method.Abstract base implementation of
DeltaCollection that delegates all mutation
methods to DeltaCollection.delta(Collection, Collection).Derived from
StackCartesianProductIterator it = new StackCartesianProductIterator(a, b,c);
An extension of
Converter specifically for converting Map.Entry objects.A feature map associates a set of features with
items.
Map a set of features to a single value.
Created by Claus Stadler
Date: Oct 9, 2010
Time: 5:41:56 PM
The set of beans that yet need population
Generator which allows giving ids back for re-use.
Generator which allows giving ids back for re-use.
A map-like key-value data structure where keys can be stated as equivalent, and thus become aliases
of each other.
Created by Claus Stadler
Date: Nov 1, 2010
Time: 10:23:02 PM
Created by Claus Stadler
Date: Nov 1, 2010
Time: 10:22:25 PM
A node view on a tree - all functions delegate to the underlying tree object
Not sure if a node should inherit from Entry or if there should be a 'asEntry' method.
Collection that forwards method calls to another one that is
only instantiated on addition of items if it did not yet exist
Delegates removals to it
A linked list node used in the combinatoric stream
Created by IntelliJ IDEA.
Created by Claus Stadler
Date: Oct 9, 2010
Time: 5:42:34 PM
A set of static methods for treating a Mapinvalid input: '<'K, Set> as a multimap
(or rather graphs, as keys may be mapped to an empty set of values)
Created by IntelliJ IDEA.
Created by Claus Stadler
Date: Oct 9, 2010
Time: 5:47:19 PM
Interface based on
Map with extensions for observing changes.A map the fires events on changes.
Getter/setter view over an observable collection.
Decorates a
SingleValuedAccessor (a getter+setter interface) with property change support.A pair (two-tuple) of objects who can differ in type.
A set of values with positive or negative polarity
This set can thus act as a white or blacklist.
A predicate backed by a multiset of items that are considered as discarded.
Created by Claus Stadler
Date: Oct 9, 2010
Time: 5:39:36 PM
This class is similar to the spring PropertySource - except that it allows setting properties as well.
Created by Claus Stadler
Date: Oct 9, 2010
Time: 5:43:50 PM
Updated by Konrad Höffner 12.8.2011
Operators that return actual RangeSet instances.
A listener registration
ListIterator wrapper that delegates next() calls to the delegate.previous() and vice versa.
Multimap in which a key can only map to a unique value.
This implementation acts as a slave to the ReversibleMap:
Insert methods are delegated to ReversibleMap.
Created by Claus Stadler
Date: Oct 12, 2010
Time: 5:51:59 PM
A pair of sets of positives and negative examples.
all.negatives may be null, however all other fields must be given!
In contrast to
SetFromCollection, the unsafe version
does not handle duplicates in the backend collection.An abstract base class for iterating over containers of unknown size.
This accessor treats the collection as the source for a single item that can be get or set.
This accessor treats the collection as the source for a single item that can be get or set.
Interface where a whole is created from parts, whereas these parts
are requested from different contributors.
Set which tracks insertions and removals to another set
Can be used with maps by applying it to their .entrySet()
Maybe a tree is an IndirectTreeinvalid input: '<'K, K>, so that each node represents itself?
Base implementation that lazily caches the node count
Data structure that pairs a tree with one of its nodes.
Class that groups several functions for tree traversal and modification.
Tree wrapper with bidirectional replacement of certain nodes with leaf nodes.
Compares elements based on the order of their values in a given map.
Immutable selector over an immutable collection of (item, weight) pairs.
Weighted selector with draw with replacement semantics.
This class is intended for cases where the primary selector draws with replacement.