See: Description
Interface | Description |
---|---|
CollectionMapProvider<K,T> |
Interface for instances that provide collections that are accessed by object keys.
|
CollectionProvider<T> |
Interface for instances that provide collections.
|
DistanceRanked |
Interface for marking objects that can be ranked according to distance.
|
ObjectMatcher<T> |
Interface which provides matching capabilities.
|
SortDimension.Window |
Interface for encapsulating a rectangular 2-D window in a way that it recognizes primary and secondary ordering
instead of rigid references to x and y axes.
|
Class | Description |
---|---|
AbstractObjectIterator<E extends AbstractObject> |
Implementation of an iterator over a collection of
abstract objects . |
AbstractObjectList<E extends AbstractObject> |
Resizable-array for storing AbstractObjects or their descendants.
|
AbstractStreamObjectIterator<E extends LocalAbstractObject> |
This class represents an iterator on
LocalAbstractObject s that are read from a file. |
AggregationFunction |
The predecessor class of the similarity aggregate functions.
|
CollectionProviders |
Provides various utility methods for
CollectionProvider and
CollectionMapProvider interfaces. |
DistanceRankedObject<T> |
Ranked object where the rank is based on distances.
|
DistanceRankedSortedCollection<T extends DistanceRankedObject<?>> |
Specialization of
SortedCollection that is specific for distance-ranked objects. |
GenericMatchingObjectList<E extends AbstractObject> |
List of objects returned by using
ObjectMatcher . |
IteratorToAbstractObjectIterator<E extends AbstractObject> |
This class provides interface between standard Iterator over AbstractObjects and
the MESSIF
AbstractObjectIterator . |
ObjectIteratorsIterator<E extends AbstractObject> |
This class allows iterating over multiple Iterators.
|
ObjectProvidersIterator<E extends AbstractObject> |
This class allows iterating over multiple ObjectProviders.
|
RankedAbstractMetaObject |
Encapsulation of an object-distance pair with the distances to respective
sub-objects of a
MetaObject . |
RankedAbstractObject |
Encapsulation of an object-distance pair.
|
RankedJoinObject |
Ranked object encapsulating a pair of objects as a result of join operation.
|
RankedSortedCollection |
Specialization of
SortedCollection that is specific for distance-ranked objects. |
RankedSortedDistFunctionCollection<T extends AbstractObject> |
Specialization of
RankedSortedCollection that uses a different distance
function to rank the objects. |
RankedSortedDistFunctionMultiCollection<T extends AbstractObject> |
Specialization of
RankedSortedMultiCollection that uses a different distance
function to rank the objects. |
RankedSortedDistFunctionRerankingCollection<T extends AbstractObject> |
Specialization of
RankedSortedDistFunctionCollection that remembers
the original ordering of the objects and allows to re-rank the results
using another distance function. |
RankedSortedMultiCollection |
Implementation of a sorted collection that stores additional collections.
|
RankedSortedMultiCollection.RankedSortedMultiCollectionComparator |
Comparator based on the sub-distances assigned to
RankedAbstractMetaObject . |
RankedSortedNoThresholdCollection |
Extension of
RankedSortedCollection that always returns the threshold
LocalAbstractObject.MAX_DISTANCE . |
RankedSortedParametricFilterCollection |
Specialization of
RankedSortedCollection that filters objects that have
not set a given Parametric parameter to a given value. |
RankedSortedRadiusRestrictCollection |
Specialization of
RankedSortedCollection that maintains an internal radius and
it does not store objects with a larger distance than this radius. |
SequenceMatchingCost |
Class encapsulating costs for matching two
objects . |
SequenceMatchingCostEquality |
Only exact match score is counted, i.e. if the distance between a pair of objects is zero,
SequenceMatchingCost.matchExact
cost is returned, otherwise the zero cost is returned. |
SequenceMatchingCostInverse |
Approximate costs of a pair of objects is measured as an inverse function of their distance (which must be within
the interval (
SequenceMatchingCost.distMatch ;SequenceMatchingCost.distMismatch ]. |
SequenceMatchingCostLinear |
Approximate costs of a pair of objects is measured as a linear function of their distance (which must be within
the interval (
SequenceMatchingCost.distMatch ;SequenceMatchingCost.distMismatch ]. |
SortDimension |
Sorting dimension
|
StreamGenericAbstractObjectIterator<E extends LocalAbstractObject> |
This class represents an iterator on
LocalAbstractObject s that are read from a file. |
StreamsMetaObjectMapIterator |
This class is to contruct MetaObjects from several simultaneously opened files (subObjectIterators).
|
UKSignaturesReader |