Uses of Interface
org.knowceans.map.IMultiMap

Packages that use IMultiMap

org.knowceans.map

Uses of IMultiMap in org.knowceans.map

Subinterfaces of IMultiMap in org.knowceans.map

interface

IInvertibleMultiMap<X,Y> IInvertibleMultiMap

Classes in org.knowceans.map that implement IMultiMap

class	HashMultiMap<X,Y> Implementation of the IMultiMap interface backed by a HashMap.
class	IndexRanking IndexSorter is a convenience class that sorts Integer indices (values) by their scores (keys).
class	InvertibleHashMultiMap<X,Y> This object maps each key to a Set of values and holds each member of this Set as a link to a Set of keys, i.e., depicts a IMultiMap (object -> set) with an inverse IMultiMap.
class	InvertibleTreeMultiMap<X,Y> This object maps each key to a Set of values and holds each member of this Set as a link to a Set of keys, i.e., depicts a IMultiMap (object -> set) with an inverse IMultiMap.
class	PatternTreeMultiMap<X,Y> Implementation of the IMultiMap interface backed by a TreeMap.
class	RankingMap<K,V> RankingMap allows sorting of two lists of items simultaneously.
class	TreeMultiMap<X,Y> Implementation of the IMultiMap interface backed by a TreeMap.

Methods in org.knowceans.map that return IMultiMap

IMultiMap<Y,X>	InvertibleTreeMultiMap.getInverse() returns the hash map of the inverse (not that this is not a tree map).
IMultiMap<Y,X>	InvertibleTreeMap.getInverse()
IMultiMap<Y,X>	InvertibleHashMultiMap.getInverse()
IMultiMap<Y,X>	InvertibleHashMap.getInverse() never use for write operations.

Constructors in org.knowceans.map with parameters of type IMultiMap

IndexRanking(IMultiMap<java.lang.Double,java.lang.Integer> map)

IndexRanking(IMultiMap<java.lang.Double,java.lang.Integer> map, java.util.Comparator<? super java.lang.Double> comp)

InvertibleHashMap(IMultiMap<Y,X> inverse)
allows to set an inverse type, for instance to sort by value using a TreeMultiMap.