[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Classes
Class | Description | |
---|---|---|
![]() | EventBuffer |
Buffer for events - accumulates events until flushed.
|
![]() | IndexedDataCollection | Collection to hold indexed data. Each key maps to multiple values.
Objects can be added to keys. The key class should override the equals and hashCode methods.
Same value objects can be added twice to the collection - the collection does not enforce set behavior.
|
![]() | InterchangeablePair<(Of FirstT, SecondT>) | General-purpose pair of values of any type. The pair equals another pair if
the objects that form the pair equal in any order, ie. first pair first object equals (.equals)
the second pair first object or second object, and the first pair second object equals the second pair first object
or second object.
|
![]() | IterablesListIterator |
An iterator over a list of iterables.
The IterablesListIterator iterator takes a list of Iterable instances as a parameter. The iterator will
Start at the very first Iterable and obtain it's iterator. It then allows iteration over this first iterator
until that iterator returns no next value. Then the IterablesListIterator iterator will obtain the next iterable and iterate
over this next iterable's iterator until no more values can be obtained. This continues until the last Iterable
in the order of the list of Iterables.
|
![]() | MultiKey<(Of T>) | Functions as a key value for Maps where keys need to be composite values.
The class allows a Map that uses MultiKeyUntyped entries for key values to use multiple objects as keys.
It calculates the hashCode from the key objects on construction and caches the hashCode.
|
![]() | MultiKeyUntyped | Functions as a key value for Maps where keys need to be composite values.
The class allows a Map that uses MultiKeyUntyped entries for key values to use multiple objects as keys.
It calculates the hashCode from the key objects on construction and caches the hashCode.
|
![]() | NumberSetPermutationEnumeration | Based on the net.esper.collection.PermutationEnumeration this enumeration provides, among a set of supplied integer
values, all permutations of order these values can come in, ie.
Example: {0, 2, 3} results in 6 enumeration values ending in {3, 2, 0}.
|
![]() | Pair<(Of FirstT, SecondT>) | General-purpose pair of values of any type. The pair only equals another pair if
the objects that form the pair equal, ie. first pair first object equals (.equals) the second pair first object,
and the first pair second object equals the second pair second object.
|
![]() | PermutationEnumeration | Provides a N! (n-faculty) number of permutations for N elements.
Example: for 3 elements provides 6 permutations exactly as follows:
{0, 1, 2}
{0, 2, 1}
{1, 0, 2}
{1, 2, 0}
{2, 0, 1}
{2, 1, 0}
|
![]() | RefCountedMap<(Of K, V>) |
Reference-counting map based on a HashMap implementation that stores as a value a pair of value and reference counter.
The class provides a reference method that takes a key
and increments the reference count for the key. It also provides a de-reference method that takes a key and
decrements the reference count for the key, and removes the key if the reference count reached zero.
Null values are not allowed as keys.
|
![]() | RefCountedSet<(Of K>) | reference-counting set based on a HashMap implementation that stores keys and a reference counter for
each unique key value. Each time the same key is added, the reference counter increases.
Each time a key is removed, the reference counter decreases.
|
![]() | SingleEventIterator |
A utility class for an iterator that has one element.
|
![]() | SortedDoubleVector |
Sorted, reference-counting set based on a SortedDictionary implementation that stores keys and a
reference counter for each unique key value. Each time the same key is added, the reference
counter increases. Each time a key is removed, the reference counter decreases.
|
![]() | SortedRefCountedSet<(Of K>) |
Sorted, reference-counting set based on a SortedDictionary implementation that stores keys and a reference counter for
each unique key value. Each time the same key is added, the reference counter increases.
Each time a key is removed, the reference counter decreases.
|
![]() | ThreadWorkQueue |
Simple queue implementation based on a Linked List per thread.
Objects can be added to the queue tail or queue head.
|
![]() | TimeWindow | Container for events per time slot. The time is provided as long milliseconds by client classes.
Events are for a specified timestamp and the implementation creates and adds the event to a slot for that timestamp.
Events can be expired from the window via the expireEvents method when their timestamp is before
(or less then) an expiry timestamp passed in. Expiry removes the event from the window.
The window allows iteration through its contents.
It is assumed that the timestamp passed to the add method is ascending. The window is backed by a
List reflecting the timestamp order rather then any sorted map or linked hash map for performance reasons.
|
![]() | TimeWindowIterator |
Iterator for net.esper.collection.TimeWindow to iterate over a timestamp slots that hold events.
|
![]() | UniformPair<(Of T>) | General-purpose pair of values of any type. The pair only equals another pair if
the objects that form the pair equal, ie. first pair first object equals (.equals) the second pair first object,
and the first pair second object equals the second pair second object.
|