Uses of Class
it.uniroma3.mat.extendedset.wrappers.matrix.Pair

Packages that use Pair

Package	Description
it.uniroma3.mat.extendedset.wrappers.matrix

Uses of Pair in it.uniroma3.mat.extendedset.wrappers.matrix

Methods in it.uniroma3.mat.extendedset.wrappers.matrix that return Pair

Modifier and Type	Method and Description
Pair<T,I>	PairSet.first()
Pair<T,I>	PairSet.get(int index) Gets the ith element of the set
Pair<T,I>	PairSet.last()

Methods in it.uniroma3.mat.extendedset.wrappers.matrix that return types with arguments of type Pair

Modifier and Type	Method and Description
Comparator<? super Pair<T,I>>	PairSet.comparator()
ExtendedSet.ExtendedIterator<Pair<T,I>>	PairSet.descendingIterator() Gets the descending order iterator over the elements of type T
Set<Map.Entry<Pair<T,I>,V>>	PairMap.entrySet()
ExtendedSet.ExtendedIterator<Pair<T,I>>	PairSet.iterator()
Set<Pair<T,I>>	PairMap.keySet()

Methods in it.uniroma3.mat.extendedset.wrappers.matrix with parameters of type Pair

Modifier and Type	Method and Description
boolean	PairSet.add(Pair<T,I> e)
void	PairSet.clear(Pair<T,I> from, Pair<T,I> to) Removes from the set all the elements between first and last, both included.
void	PairSet.clear(Pair<T,I> from, Pair<T,I> to) Removes from the set all the elements between first and last, both included.
void	PairSet.fill(Pair<T,I> from, Pair<T,I> to) Adds to the set all the elements between first and last, both included.
void	PairSet.fill(Pair<T,I> from, Pair<T,I> to) Adds to the set all the elements between first and last, both included.
void	PairSet.flip(Pair<T,I> e) Adds the element if it not existing, or removes it if existing
PairSet<T,I>	PairSet.headSet(Pair<T,I> toElement)
int	PairSet.indexOf(Pair<T,I> element) Provides position of element within the set.
V	PairMap.put(Pair<T,I> key, V value)
PairSet<T,I>	PairSet.subSet(Pair<T,I> fromElement, Pair<T,I> toElement)
PairSet<T,I>	PairSet.subSet(Pair<T,I> fromElement, Pair<T,I> toElement)
PairSet<T,I>	PairSet.tailSet(Pair<T,I> fromElement)

Method parameters in it.uniroma3.mat.extendedset.wrappers.matrix with type arguments of type Pair

Modifier and Type	Method and Description
boolean	PairSet.addAll(Collection<? extends Pair<T,I>> c)
int	PairSet.compareTo(ExtendedSet<Pair<T,I>> o) Compares this object with the specified object for order.
boolean	PairSet.containsAny(Collection<? extends Pair<T,I>> other) Returns true if the specified Collection instance contains any elements that are also contained within this ExtendedSet instance
boolean	PairSet.containsAtLeast(Collection<? extends Pair<T,I>> other, int minElements) Returns true if the specified Collection instance contains at least minElements elements that are also contained within this ExtendedSet instance
PairSet<T,I>	PairSet.difference(Collection<? extends Pair<T,I>> other) Generates the difference set
int	PairSet.differenceSize(Collection<? extends Pair<T,I>> other) Computes the difference set size.
PairSet<T,I>	PairSet.intersection(Collection<? extends Pair<T,I>> c) Generates the intersection set
PairSet<T,I>	PairSet.symmetricDifference(Collection<? extends Pair<T,I>> other) Generates the symmetric difference set
int	PairSet.symmetricDifferenceSize(Collection<? extends Pair<T,I>> other) Computes the symmetric difference set size.
PairSet<T,I>	PairSet.union(Collection<? extends Pair<T,I>> other) Generates the union set
int	PairSet.unionSize(Collection<? extends Pair<T,I>> other) Computes the union set size.

Constructor parameters in it.uniroma3.mat.extendedset.wrappers.matrix with type arguments of type Pair

Constructor and Description
PairSet(BinaryMatrix matrix, Collection<? extends Pair<T,I>> pairs) Converts a generic collection of transaction-item pairs to a PairSet instance.