it.uniroma3.mat.extendedset

Class AbstractExtendedSet.ExtendedSubSet

java.lang.Object

it.uniroma3.mat.extendedset.AbstractExtendedSet.FilteredSet

it.uniroma3.mat.extendedset.AbstractExtendedSet.ExtendedSubSet

All Implemented Interfaces:

ExtendedSet<T>, Cloneable, Comparable<ExtendedSet<T>>, Iterable<T>, Collection<T>, Set<T>, SortedSet<T>

Enclosing class:

AbstractExtendedSet<T>

protected class AbstractExtendedSet.ExtendedSubSet
extends AbstractExtendedSet.FilteredSet

Used by AbstractExtendedSet#headSet(T) , AbstractExtendedSet#tailSet(T) and AbstractExtendedSet#subSet(T,T) to offer a restricted view of the entire set

Nested Class Summary

Nested classes/interfaces inherited from interface it.uniroma3.mat.extendedset.ExtendedSet

ExtendedSet.ExtendedIterator<X>

Constructor Summary

Constructors

Constructor and Description
AbstractExtendedSet.ExtendedSubSet(T min, T max) Creates the subset

Method Summary

Methods

Modifier and Type	Method and Description
boolean	add(T e)
boolean	addAll(Collection<? extends T> c)
void	clear()
void	clear(T from, T to) Removes from the set all the elements between first and last, both included.
ExtendedSet<T>	clone() See the clone() of Object
void	complement() Complements the current set.
ExtendedSet<T>	complemented() Generates the complement set.
int	complementSize() Computes the complement set size.
boolean	contains(Object o)
boolean	containsAll(Collection<?> c)
boolean	containsAny(Collection<? extends T> other) Returns true if the specified Collection instance contains any elements that are also contained within this ExtendedSet instance
boolean	containsAtLeast(Collection<? extends T> other, int minElements) Returns true if the specified Collection instance contains at least minElements elements that are also contained within this ExtendedSet instance
String	debugInfo() Prints debug info about the given ExtendedSet implementation
Iterable<T>	descending() Allows to use the Java "for-each" statement in descending order
void	fill(T from, T to) Adds to the set all the elements between first and last, both included.
void	flip(T e) Adds the element if it not existing, or removes it if existing
T	get(int i) Gets the ith element of the set
ExtendedSet<T>	headSet(T toElement)
int	indexOf(T e) Provides position of element within the set.
protected ExtendedSet<T>	raw()
boolean	remove(Object o)
boolean	removeAll(Collection<?> c)
boolean	retainAll(Collection<?> c)
int	size()
ExtendedSet<T>	subSet(T fromElement, T toElement)
ExtendedSet<T>	tailSet(T fromElement)

Methods inherited from class it.uniroma3.mat.extendedset.AbstractExtendedSet.FilteredSet

bitmapCompressionRatio, collectionCompressionRatio, comparator, compareTo, convert, convert, descendingIterator, difference, differenceSize, empty, equals, first, hashCode, intersection, intersectionSize, isEmpty, iterator, jaccardDistance, jaccardSimilarity, last, powerSet, powerSet, powerSetSize, powerSetSize, symmetricDifference, symmetricDifferenceSize, toArray, toArray, toString, union, unionSize, unmodifiable, weightedJaccardDistance, weightedJaccardSimilarity

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

AbstractExtendedSet.ExtendedSubSet

public AbstractExtendedSet.ExtendedSubSet(T min,
                                  T max)

Creates the subset

Parameters:

min - minimun allowed element (included)

max - maximum allowed element (excluded)

Method Detail

raw

protected ExtendedSet<T> raw()

Specified by:

raw in class AbstractExtendedSet.FilteredSet

Returns:

the container instance, namely the "internal" representation

headSet

public ExtendedSet<T> headSet(T toElement)

Description copied from interface: ExtendedSet

subSet

public ExtendedSet<T> subSet(T fromElement,
                    T toElement)

Description copied from interface: ExtendedSet

tailSet

public ExtendedSet<T> tailSet(T fromElement)

Description copied from interface: ExtendedSet

addAll

public boolean addAll(Collection<? extends T> c)

removeAll

public boolean removeAll(Collection<?> c)

retainAll

public boolean retainAll(Collection<?> c)

containsAll

public boolean containsAll(Collection<?> c)

Specified by:

containsAll in interface Collection<T>

Specified by:

containsAll in interface Set<T>

Overrides:

containsAll in class AbstractExtendedSet.FilteredSet

add

public boolean add(T e)

clear

public void clear()

contains

public boolean contains(Object o)

Specified by:

contains in interface Collection<T>

Specified by:

contains in interface Set<T>

Overrides:

contains in class AbstractExtendedSet.FilteredSet

remove

public boolean remove(Object o)

size

public int size()

Specified by:

size in interface Collection<T>

Specified by:

size in interface Set<T>

Overrides:

size in class AbstractExtendedSet.FilteredSet

complement

public void complement()

Description copied from interface: ExtendedSet

Complements the current set. The modified set is represented by all the elements strictly less than SortedSet.last() that do not exist in the current set.

See Also:

ExtendedSet.complemented()

complementSize

public int complementSize()

Description copied from interface: ExtendedSet

Computes the complement set size.

This is faster than calling ExtendedSet.complemented() and then Set.size()

Specified by:

complementSize in interface ExtendedSet<T>

Overrides:

complementSize in class AbstractExtendedSet.FilteredSet

Returns:

the size

complemented

public ExtendedSet<T> complemented()

Description copied from interface: ExtendedSet

Generates the complement set. The returned set is represented by all the elements strictly less than SortedSet.last() that do not exist in the current set.

Specified by:

complemented in interface ExtendedSet<T>

Overrides:

complemented in class AbstractExtendedSet.FilteredSet

Returns:

the complement set

See Also:

ExtendedSet.complement()

debugInfo

public String debugInfo()

Description copied from interface: ExtendedSet

Prints debug info about the given ExtendedSet implementation

Specified by:

debugInfo in interface ExtendedSet<T>

Overrides:

debugInfo in class AbstractExtendedSet.FilteredSet

Returns:

a string that describes the internal representation of the instance

clear

public void clear(T from,
         T to)

Description copied from interface: ExtendedSet

Removes from the set all the elements between first and last, both included. It supposes that there is an ordering of the elements of type T and that the universe of all possible elements is known.

Parameters:

from - first element

to - last element

containsAny

public boolean containsAny(Collection<? extends T> other)

Description copied from interface: ExtendedSet

Returns true if the specified Collection instance contains any elements that are also contained within this ExtendedSet instance

Specified by:

containsAny in interface ExtendedSet<T>

Overrides:

containsAny in class AbstractExtendedSet.FilteredSet

Parameters:

other - ExtendedSet to intersect with

Returns:

a boolean indicating whether this ExtendedSet intersects the specified ExtendedSet.

containsAtLeast

public boolean containsAtLeast(Collection<? extends T> other,
                      int minElements)

Description copied from interface: ExtendedSet

Returns true if the specified Collection instance contains at least minElements elements that are also contained within this ExtendedSet instance

Specified by:

containsAtLeast in interface ExtendedSet<T>

Overrides:

containsAtLeast in class AbstractExtendedSet.FilteredSet

Parameters:

other - Collection instance to intersect with

minElements - minimum number of elements to be contained within this ExtendedSet instance

Returns:

a boolean indicating whether this ExtendedSet intersects the specified Collection.

descending

public Iterable<T> descending()

Description copied from interface: ExtendedSet

Allows to use the Java "for-each" statement in descending order

Specified by:

descending in interface ExtendedSet<T>

Overrides:

descending in class AbstractExtendedSet.FilteredSet

Returns:

Iterable instance to iterate items in descending order

fill

public void fill(T from,
        T to)

Description copied from interface: ExtendedSet

Adds to the set all the elements between first and last, both included. It supposes that there is an ordering of the elements of type T and that the universe of all possible elements is known.

Parameters:

from - first element

to - last element

flip

public void flip(T e)

Description copied from interface: ExtendedSet

Adds the element if it not existing, or removes it if existing

Parameters:

e - element to flip

See Also:

ExtendedSet.symmetricDifference(Collection)

get

public T get(int i)

Description copied from interface: ExtendedSet

Gets the i^th element of the set

Specified by:

get in interface ExtendedSet<T>

Overrides:

get in class AbstractExtendedSet.FilteredSet

Parameters:

i - position of the element in the sorted set

Returns:

the i^th element of the set

indexOf

public int indexOf(T e)

Description copied from interface: ExtendedSet

Provides position of element within the set.

It returns -1 if the element does not exist within the set.

Specified by:

indexOf in interface ExtendedSet<T>

Overrides:

indexOf in class AbstractExtendedSet.FilteredSet

Parameters:

e - element of the set

Returns:

the element position

clone

public ExtendedSet<T> clone()

Description copied from interface: ExtendedSet

See the clone() of Object

Specified by:

clone in interface ExtendedSet<T>

Overrides:

clone in class AbstractExtendedSet.FilteredSet

Returns:

cloned object