Package com.espertech.esper.common.internal.collection
package com.espertech.esper.common.internal.collection
Internal collection classes
-
ClassDescriptionA fast collection backed by an array with severe limitations.Iterator for an array of events.Iterator for iterating over an array of events up to a given max number of events.Iterator for iterating over an array of events up to a given max number of events.ArrayWrap<T>Provided a 2-dimensional array of values, provide all possible combinations:Iterator for an iterator of events returning the underlying itself.Iterator for an iterator of events returning the underlying itself.InterchangeablePair<F,
S> General-purpose pair of values of any type.An iterator over an array of iterables.An iterator over a list of iterables.LRUCache<K,V> Functions as a key value for Maps where keys need to be composite values.A hash key that include a name and a count, wherein the combination of name and count defines the uniqueness.NullIterator<T>Iterator that never returns an elements.Provides an enumeration of each combination of numbers between zero and N-1 with N must be at least 1, with each combination cannot have duplicates, with each combination at least one element, with the longest combination gets returned first and the least long combination of the highest N-1 value last.Based on thePermutationEnumerationthis enumeration provides, among a set of supplied integer values, all permutations of order these values can come in, ie.Enumeration that first returns a round-shift-left of all numbers and when that is exhausted it returns number sets using grouped algo until exhausted.Simple collection that exposes a limited add-and-get interface and that is optimized towards holding a single event, but can hold multiple events.Pair<F,S> General-purpose pair of values of any type.PathRegistry<K,E> Provides a N! (n-faculty) number of permutations for N elements.RefCountedMap<K,V> Reference-counting map based on a HashMap implementation that stores as a value a pair of value and reference counter.reference-counting set based on a HashMap implementation that stores keys and a reference counter for each unique key value.Reversed iterator for an array of events.Event buffer of a given size provides a random access API into the most current event to prior events up to the given size.A utility class for an iterator that has one element.A utility class for an iterator that has zero or one element and can be reset with a new value.Sorted, reference-counting set based on an ArrayList implementation that it being kept sorted.Sorted, reference-counting set based on a TreeMap implementation that stores keys and a reference counter for each unique key value.Container for events per time slot.Iterator for reading and transforming a source event iterator.Interface that transforms one event into another event, for use withTransformEventIterator.UniformPair<T>General-purpose pair of values of any type.Iterator that does not allow remove.A general-purpose collection interface for collections updated by view data.