IntSetStatistics (com.metamx:extendedset 1.5.0-mmx API)

java.lang.Object
- it.uniroma3.mat.extendedset.utilities.IntSetStatistics

All Implemented Interfaces:

IntSet, Cloneable, Comparable<IntSet>
```
public class IntSetStatistics
extends Object
implements IntSet
```
A wrapper class for classes that implement the IntSet interface to count method calls

Version:

$Id: IntSetStatistics.java 153 2011-05-30 16:39:57Z cocciasik $

Author:

Alessandro Colantonio

Nested Class Summary
- Nested classes/interfaces inherited from interface it.uniroma3.mat.extendedset.intset.IntSet
  IntSet.IntIterator

Constructor Summary

Constructors
Constructor and Description

IntSetStatistics(IntSet container)
Wraps an IntSet instance with an IntSetStatistics instance

Constructors
Constructor and Description
`IntSetStatistics(IntSet container)` Wraps an `IntSet` instance with an `IntSetStatistics` instance

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`boolean`	`add(int i)` Adds the specified element to this set if it is not already present.
`boolean`	`addAll(IntSet c)` Adds all of the elements in the specified collection to this set if they're not already present.
`double`	`bitmapCompressionRatio()` Computes the compression factor of the equivalent bitmap representation (1 means not compressed, namely a memory footprint similar to `BitSet`, 2 means twice the size of `BitSet`, etc.)
`void`	`clear()` Removes all of the elements from this set.
`void`	`clear(int from, int to)` Removes from the set all the elements between `first` and `last`, both included.
`IntSet`	`clone()` See the `clone()` of `Object`
`double`	`collectionCompressionRatio()` Computes the compression factor of the equivalent integer collection (1 means not compressed, namely a memory footprint similar to `ArrayList`, 2 means twice the size of `ArrayList`, etc.)
`int`	`compareTo(IntSet o)`
`void`	`complement()` Complements the current set.
`IntSet`	`complemented()` Generates the complement set.
`int`	`complementSize()` Computes the complement set size.
`boolean`	`contains(int i)` Returns `true` if this set contains the specified element.
`boolean`	`containsAll(IntSet c)` Returns `true` if this set contains all of the elements of the specified collection.
`boolean`	`containsAny(IntSet other)` Returns `true` if the specified `IntSet` instance contains any elements that are also contained within this `IntSet` instance
`boolean`	`containsAtLeast(IntSet other, int minElements)` Returns `true` if the specified `IntSet` instance contains at least `minElements` elements that are also contained within this `IntSet` instance
`IntSet`	`convert(Collection<Integer> c)` Converts a given collection into an instance of the current class.
`IntSet`	`convert(int... a)` Converts a given array into an instance of the current class.
`String`	`debugInfo()` Prints debug info about the given `IntSet` implementation
`IntSet.IntIterator`	`descendingIterator()`
`IntSet`	`difference(IntSet other)` Generates the difference set
`int`	`differenceSize(IntSet other)` Computes the difference set size.
`IntSet`	`empty()` Generates an empty set
`boolean`	`equals(Object obj)`
`static IntSet`	`extractContainer(IntSet c)` Removes the `IntSetStatistics` wrapper
`void`	`fill(int from, int to)` Adds to the set all the elements between `first` and `last`, both included.
`int`	`first()` Returns the first (lowest) element currently in this set.
`void`	`flip(int e)` Adds the element if it not existing, or removes it if existing
`int`	`get(int i)` Gets the `i`^th element of the set
`static long`	`getComplementCount()`
`static long`	`getComplementSizeCount()`
`static long`	`getContainsAllCount()`
`static long`	`getContainsAnyCount()`
`static long`	`getContainsAtLeastCount()`
`static long`	`getDifferenceCount()`
`static long`	`getDifferenceSizeCount()`
`static long`	`getEqualsCount()`
`static long`	`getHashCodeCount()`
`static long`	`getIntersectionCount()`
`static long`	`getIntersectionSizeCount()`
`static long`	`getSizeCheckCount()`
`static long`	`getSymmetricDifferenceCount()`
`static long`	`getSymmetricDifferenceSizeCount()`
`static long`	`getUnionCount()`
`static long`	`getUnionSizeCount()`
`int`	`hashCode()`
`int`	`indexOf(int e)` Provides position of element within the set.
`IntSet`	`intersection(IntSet other)` Generates the intersection set
`int`	`intersectionSize(IntSet other)` Computes the intersection set size.
`boolean`	`isEmpty()`
`IntSet.IntIterator`	`iterator()`
`double`	`jaccardDistance(IntSet other)` Computes the Jaccard distance between this set and the given set.
`double`	`jaccardSimilarity(IntSet other)` Computes the Jaccard similarity coefficient between this set and the given set.
`int`	`last()` Returns the last (highest) element currently in this set.
`List<? extends IntSet>`	`powerSet()` Computes the power-set of the current set.
`List<? extends IntSet>`	`powerSet(int min, int max)` Computes a subset of the power-set of the current set, composed by those subsets that have cardinality between `min` and `max`.
`int`	`powerSetSize()` Computes the power-set size of the current set.
`int`	`powerSetSize(int min, int max)` Computes the power-set size of the current set, composed by those subsets that have cardinality between `min` and `max`.
`boolean`	`remove(int i)` Removes the specified element from this set if it is present.
`boolean`	`removeAll(IntSet c)` Removes from this set all of its elements that are contained in the specified collection.
`static void`	`resetCounters()` Resets all counters
`boolean`	`retainAll(IntSet c)` Retains only the elements in this set that are contained in the specified collection.
`int`	`size()`
`static String`	`summary()`
`IntSet`	`symmetricDifference(IntSet other)` Generates the symmetric difference set
`int`	`symmetricDifferenceSize(IntSet other)` Computes the symmetric difference set size.
`int[]`	`toArray()`
`int[]`	`toArray(int[] a)` Returns an array containing all of the elements in this set.
`String`	`toString()`
`IntSet`	`union(IntSet other)` Generates the union set
`int`	`unionSize(IntSet other)` Computes the union set size.
`double`	`weightedJaccardDistance(IntSet other)` Computes the weighted version of the Jaccard distance between this set and the given set.
`double`	`weightedJaccardSimilarity(IntSet other)` Computes the weighted version of the Jaccard similarity coefficient between this set and the given set.

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

- Constructor Detail
  - IntSetStatistics
```
public IntSetStatistics(IntSet container)
```
    Wraps an IntSet instance with an IntSetStatistics instance
    
    Parameters:
    
    container - IntSet to wrap
- Method Detail
  - getUnionCount
```
public static long getUnionCount()
```
    Returns:
    
    number of union operations (i.e., addAll(IntSet) , union(IntSet) )
  - getIntersectionCount
```
public static long getIntersectionCount()
```
    Returns:
    
    number of intersection operations (i.e., retainAll(IntSet) , intersection(IntSet) )
  - getDifferenceCount
```
public static long getDifferenceCount()
```
    Returns:
    
    number of difference operations (i.e., removeAll(IntSet) , difference(IntSet) )
  - getSymmetricDifferenceCount
```
public static long getSymmetricDifferenceCount()
```
    Returns:
    
    number of symmetric difference operations (i.e., symmetricDifference(IntSet) )
  - getComplementCount
```
public static long getComplementCount()
```
    Returns:
    
    number of complement operations (i.e., complement() , complemented() )
  - getUnionSizeCount
```
public static long getUnionSizeCount()
```
    Returns:
    
    cardinality of union operations (i.e., addAll(IntSet) , union(IntSet) )
  - getIntersectionSizeCount
```
public static long getIntersectionSizeCount()
```
    Returns:
    
    cardinality of intersection operations (i.e., retainAll(IntSet) , intersection(IntSet) )
  - getDifferenceSizeCount
```
public static long getDifferenceSizeCount()
```
    Returns:
    
    cardinality of difference operations (i.e., removeAll(IntSet) , difference(IntSet) )
  - getSymmetricDifferenceSizeCount
```
public static long getSymmetricDifferenceSizeCount()
```
    Returns:
    
    cardinality of symmetric difference operations (i.e., symmetricDifference(IntSet) )
  - getComplementSizeCount
```
public static long getComplementSizeCount()
```
    Returns:
    
    cardinality of complement operations (i.e., complement() , complemented() )
  - getEqualsCount
```
public static long getEqualsCount()
```
    Returns:
    
    number of equality check operations (i.e., equals(Object) )
  - getHashCodeCount
```
public static long getHashCodeCount()
```
    Returns:
    
    number of hash code computations (i.e., hashCode() )
  - getContainsAllCount
```
public static long getContainsAllCount()
```
    Returns:
    
    number of containsAll(IntSet) calls
  - getContainsAnyCount
```
public static long getContainsAnyCount()
```
    Returns:
    
    number of containsAny(IntSet) calls
  - getContainsAtLeastCount
```
public static long getContainsAtLeastCount()
```
    Returns:
    
    number of containsAtLeast(IntSet,int) calls
  - getSizeCheckCount
```
public static long getSizeCheckCount()
```
    Returns:
    
    the sum of the cardinality of set operations
  - resetCounters
```
public static void resetCounters()
```
    Resets all counters
  - summary
```
public static String summary()
```
    Returns:
    
    the summary information string
  - extractContainer
```
public static IntSet extractContainer(IntSet c)
```
    Removes the IntSetStatistics wrapper
    
    Parameters:
    
    c -
    
    Returns:
    
    the contained IntSet instance
  - addAll
```
public boolean addAll(IntSet c)
```
    Adds all of the elements in the specified collection to this set if they're not already present.
    
    Specified by:
    
    addAll in interface IntSet
    
    Parameters:
    
    c - collection containing elements to be added to this set
    
    Returns:
    
    true if this set changed as a result of the call
    
    See Also:
    
    IntSet.add(int)
  - union
```
public IntSet union(IntSet other)
```
    Generates the union set
    
    Specified by:
    
    union in interface IntSet
    
    Parameters:
    
    other - IntSet instance that represents the right operand
    
    Returns:
    
    the result of the operation
    
    See Also:
    
    IntSet.addAll(IntSet)
  - retainAll
```
public boolean retainAll(IntSet c)
```
    Retains only the elements in this set that are contained in the specified collection. In other words, removes from this set all of its elements that are not contained in the specified collection.
    
    Specified by:
    
    retainAll in interface IntSet
    
    Parameters:
    
    c - collection containing elements to be retained in this set
    
    Returns:
    
    true if this set changed as a result of the call
    
    See Also:
    
    IntSet.remove(int)
  - intersection
```
public IntSet intersection(IntSet other)
```
    Generates the intersection set
    
    Specified by:
    
    intersection in interface IntSet
    
    Parameters:
    
    other - IntSet instance that represents the right operand
    
    Returns:
    
    the result of the operation
    
    See Also:
    
    IntSet.retainAll(IntSet)
  - removeAll
```
public boolean removeAll(IntSet c)
```
    Removes from this set all of its elements that are contained in the specified collection.
    
    Specified by:
    
    removeAll in interface IntSet
    
    Parameters:
    
    c - collection containing elements to be removed from this set
    
    Returns:
    
    true if this set changed as a result of the call
    
    See Also:
    
    IntSet.remove(int), IntSet.contains(int)
  - difference
```
public IntSet difference(IntSet other)
```
    Generates the difference set
    
    Specified by:
    
    difference in interface IntSet
    
    Parameters:
    
    other - IntSet instance that represents the right operand
    
    Returns:
    
    the result of the operation
    
    See Also:
    
    IntSet.removeAll(IntSet)
  - symmetricDifference
```
public IntSet symmetricDifference(IntSet other)
```
    Generates the symmetric difference set
    
    Specified by:
    
    symmetricDifference in interface IntSet
    
    Parameters:
    
    other - IntSet instance that represents the right operand
    
    Returns:
    
    the result of the operation
    
    See Also:
    
    IntSet.flip(int)
  - complement
```
public void complement()
```
    Complements the current set. The modified set is represented by all the elements strictly less than IntSet.last() that do not exist in the current set.
    
    Specified by:
    
    complement in interface IntSet
    
    See Also:
    
    IntSet.complemented()
  - complemented
```
public IntSet complemented()
```
    Generates the complement set. The returned set is represented by all the elements strictly less than IntSet.last() that do not exist in the current set.
    
    Specified by:
    
    complemented in interface IntSet
    
    Returns:
    
    the complement set
    
    See Also:
    
    IntSet.complement()
  - unionSize
```
public int unionSize(IntSet other)
```
    Computes the union set size.
    This is faster than calling IntSet.union(IntSet) and then IntSet.size()
    
    Specified by:
    
    unionSize in interface IntSet
    
    Parameters:
    
    other - IntSet instance that represents the right operand
    
    Returns:
    
    the size
  - intersectionSize
```
public int intersectionSize(IntSet other)
```
    Computes the intersection set size.
    This is faster than calling IntSet.intersection(IntSet) and then IntSet.size()
    
    Specified by:
    
    intersectionSize in interface IntSet
    
    Parameters:
    
    other - IntSet instance that represents the right operand
    
    Returns:
    
    the size
  - differenceSize
```
public int differenceSize(IntSet other)
```
    Computes the difference set size.
    This is faster than calling IntSet.difference(IntSet) and then IntSet.size()
    
    Specified by:
    
    differenceSize in interface IntSet
    
    Parameters:
    
    other - IntSet instance that represents the right operand
    
    Returns:
    
    the size
  - symmetricDifferenceSize
```
public int symmetricDifferenceSize(IntSet other)
```
    Computes the symmetric difference set size.
    This is faster than calling IntSet.symmetricDifference(IntSet) and then IntSet.size()
    
    Specified by:
    
    symmetricDifferenceSize in interface IntSet
    
    Parameters:
    
    other - IntSet instance that represents the right operand
    
    Returns:
    
    the size
  - complementSize
```
public int complementSize()
```
    Computes the complement set size.
    This is faster than calling IntSet.complemented() and then IntSet.size()
    
    Specified by:
    
    complementSize in interface IntSet
    
    Returns:
    
    the size
  - containsAll
```
public boolean containsAll(IntSet c)
```
    Returns true if this set contains all of the elements of the specified collection.
    
    Specified by:
    
    containsAll in interface IntSet
    
    Parameters:
    
    c - collection to be checked for containment in this set
    
    Returns:
    
    true if this set contains all of the elements of the specified collection
    
    See Also:
    
    IntSet.contains(int)
  - containsAny
```
public boolean containsAny(IntSet other)
```
    Returns true if the specified IntSet instance contains any elements that are also contained within this IntSet instance
    
    Specified by:
    
    containsAny in interface IntSet
    
    Parameters:
    
    other - IntSet to intersect with
    
    Returns:
    
    a boolean indicating whether this IntSet intersects the specified IntSet.
  - containsAtLeast
```
public boolean containsAtLeast(IntSet other,
                               int minElements)
```
    Returns true if the specified IntSet instance contains at least minElements elements that are also contained within this IntSet instance
    
    Specified by:
    
    containsAtLeast in interface IntSet
    
    Parameters:
    
    other - IntSet instance to intersect with
    
    minElements - minimum number of elements to be contained within this IntSet instance
    
    Returns:
    
    a boolean indicating whether this IntSet intersects the specified IntSet.
  - hashCode
```
public int hashCode()
```
    Overrides:
    
    hashCode in class Object
  - equals
```
public boolean equals(Object obj)
```
    Overrides:
    
    equals in class Object
  - bitmapCompressionRatio
```
public double bitmapCompressionRatio()
```
    Computes the compression factor of the equivalent bitmap representation (1 means not compressed, namely a memory footprint similar to BitSet, 2 means twice the size of BitSet, etc.)
    
    Specified by:
    
    bitmapCompressionRatio in interface IntSet
    
    Returns:
    
    the compression factor
  - collectionCompressionRatio
```
public double collectionCompressionRatio()
```
    Computes the compression factor of the equivalent integer collection (1 means not compressed, namely a memory footprint similar to ArrayList, 2 means twice the size of ArrayList, etc.)
    
    Specified by:
    
    collectionCompressionRatio in interface IntSet
    
    Returns:
    
    the compression factor
  - clear
```
public void clear(int from,
                  int to)
```
    Removes from the set all the elements between first and last, both included.
    
    Specified by:
    
    clear in interface IntSet
    
    Parameters:
    
    from - first element
    
    to - last element
  - fill
```
public void fill(int from,
                 int to)
```
    Adds to the set all the elements between first and last, both included.
    
    Specified by:
    
    fill in interface IntSet
    
    Parameters:
    
    from - first element
    
    to - last element
  - clear
```
public void clear()
```
    Removes all of the elements from this set. The set will be empty after this call returns.
    
    Specified by:
    
    clear in interface IntSet
  - add
```
public boolean add(int i)
```
    Adds the specified element to this set if it is not already present. It ensures that sets never contain duplicate elements.
    
    Specified by:
    
    add in interface IntSet
    
    Parameters:
    
    i - element to be added to this set
    
    Returns:
    
    true if this set did not already contain the specified element
  - remove
```
public boolean remove(int i)
```
    Removes the specified element from this set if it is present.
    
    Specified by:
    
    remove in interface IntSet
    
    Parameters:
    
    i - object to be removed from this set, if present
    
    Returns:
    
    true if this set contained the specified element
  - flip
```
public void flip(int e)
```
    Adds the element if it not existing, or removes it if existing
    
    Specified by:
    
    flip in interface IntSet
    
    Parameters:
    
    e - element to flip
    
    See Also:
    
    IntSet.symmetricDifference(IntSet)
  - get
```
public int get(int i)
```
    Gets the i^th element of the set
    
    Specified by:
    
    get in interface IntSet
    
    Parameters:
    
    i - position of the element in the sorted set
    
    Returns:
    
    the i^th element of the set
  - indexOf
```
public int indexOf(int e)
```
    Provides position of element within the set.
    It returns -1 if the element does not exist within the set.
    
    Specified by:
    
    indexOf in interface IntSet
    
    Parameters:
    
    e - element of the set
    
    Returns:
    
    the element position
  - contains
```
public boolean contains(int i)
```
    Returns true if this set contains the specified element.
    
    Specified by:
    
    contains in interface IntSet
    
    Parameters:
    
    i - element whose presence in this set is to be tested
    
    Returns:
    
    true if this set contains the specified element
  - first
```
public int first()
```
    Returns the first (lowest) element currently in this set.
    
    Specified by:
    
    first in interface IntSet
    
    Returns:
    
    the first (lowest) element currently in this set
  - last
```
public int last()
```
    Returns the last (highest) element currently in this set.
    
    Specified by:
    
    last in interface IntSet
    
    Returns:
    
    the last (highest) element currently in this set
  - isEmpty
```
public boolean isEmpty()
```
    Specified by:
    
    isEmpty in interface IntSet
    
    Returns:
    
    true if this set contains no elements
  - size
```
public int size()
```
    Specified by:
    
    size in interface IntSet
    
    Returns:
    
    the number of elements in this set (its cardinality)
  - iterator
```
public IntSet.IntIterator iterator()
```
    Specified by:
    
    iterator in interface IntSet
    
    Returns:
    
    a IntSet.IntIterator instance to iterate over the set
  - descendingIterator
```
public IntSet.IntIterator descendingIterator()
```
    Specified by:
    
    descendingIterator in interface IntSet
    
    Returns:
    
    a IntSet.IntIterator instance to iterate over the set in descending order
  - toArray
```
public int[] toArray()
```
    Specified by:
    
    toArray in interface IntSet
    
    Returns:
    
    an array containing all the elements in this set, in the same order.
  - toArray
```
public int[] toArray(int[] a)
```
    Returns an array containing all of the elements in this set.
    If this set fits in the specified array with room to spare (i.e., the array has more elements than this set), the element in the array immediately following the end of the set are left unchanged.
    
    Specified by:
    
    toArray in interface IntSet
    
    Parameters:
    
    a - the array into which the elements of this set are to be stored.
    
    Returns:
    
    the array containing all the elements in this set
  - compareTo
```
public int compareTo(IntSet o)
```
    Specified by:
    
    compareTo in interface Comparable<IntSet>
  - toString
```
public String toString()
```
    Overrides:
    
    toString in class Object
  - powerSet
```
public List<? extends IntSet> powerSet()
```
    Computes the power-set of the current set.
    It is a particular implementation of the algorithm Apriori (see: Rakesh Agrawal, Ramakrishnan Srikant, Fast Algorithms for Mining Association Rules in Large Databases, in Proceedings of the 20^th International Conference on Very Large Data Bases, p.487-499, 1994). The returned power-set does not contain the empty set.
    The subsets composing the powerset are returned in a list that is sorted according to the lexicographical order provided by the integer set.
    
    Specified by:
    
    powerSet in interface IntSet
    
    Returns:
    
    the power-set
    
    See Also:
    
    IntSet.powerSet(int, int), IntSet.powerSetSize()
  - powerSet
```
public List<? extends IntSet> powerSet(int min,
                                       int max)
```
    Computes a subset of the power-set of the current set, composed by those subsets that have cardinality between min and max.
    It is a particular implementation of the algorithm Apriori (see: Rakesh Agrawal, Ramakrishnan Srikant, Fast Algorithms for Mining Association Rules in Large Databases, in Proceedings of the 20^th International Conference on Very Large Data Bases, p.487-499, 1994). The power-set does not contains the empty set.
    The subsets composing the powerset are returned in a list that is sorted according to the lexicographical order provided by the integer set.
    
    Specified by:
    
    powerSet in interface IntSet
    
    Parameters:
    
    min - minimum subset size (greater than zero)
    
    max - maximum subset size
    
    Returns:
    
    the power-set
    
    See Also:
    
    IntSet.powerSet(), IntSet.powerSetSize(int, int)
  - powerSetSize
```
public int powerSetSize()
```
    Computes the power-set size of the current set.
    The power-set does not contains the empty set.
    
    Specified by:
    
    powerSetSize in interface IntSet
    
    Returns:
    
    the power-set size
    
    See Also:
    
    IntSet.powerSet()
  - powerSetSize
```
public int powerSetSize(int min,
                        int max)
```
    Computes the power-set size of the current set, composed by those subsets that have cardinality between min and max.
    The returned power-set does not contain the empty set.
    
    Specified by:
    
    powerSetSize in interface IntSet
    
    Parameters:
    
    min - minimum subset size (greater than zero)
    
    max - maximum subset size
    
    Returns:
    
    the power-set size
    
    See Also:
    
    IntSet.powerSet(int, int)
  - jaccardSimilarity
```
public double jaccardSimilarity(IntSet other)
```
    Computes the Jaccard similarity coefficient between this set and the given set.
    The coefficient is defined as |A intersection B| / |A union B|.
    
    Specified by:
    
    jaccardSimilarity in interface IntSet
    
    Parameters:
    
    other - the other set
    
    Returns:
    
    the Jaccard similarity coefficient
    
    See Also:
    
    IntSet.jaccardDistance(IntSet)
  - jaccardDistance
```
public double jaccardDistance(IntSet other)
```
    Computes the Jaccard distance between this set and the given set.
    The coefficient is defined as 1 - IntSet.jaccardSimilarity(IntSet).
    
    Specified by:
    
    jaccardDistance in interface IntSet
    
    Parameters:
    
    other - the other set
    
    Returns:
    
    the Jaccard distance
    
    See Also:
    
    IntSet.jaccardSimilarity(IntSet)
  - weightedJaccardSimilarity
```
public double weightedJaccardSimilarity(IntSet other)
```
    Computes the weighted version of the Jaccard similarity coefficient between this set and the given set.
    The coefficient is defined as sum of min(A_i, B_i) / sum of max(A_i, B_i).
    
    Specified by:
    
    weightedJaccardSimilarity in interface IntSet
    
    Parameters:
    
    other - the other set
    
    Returns:
    
    the weighted Jaccard similarity coefficient
    
    See Also:
    
    IntSet.weightedJaccardDistance(IntSet)
  - weightedJaccardDistance
```
public double weightedJaccardDistance(IntSet other)
```
    Computes the weighted version of the Jaccard distance between this set and the given set.
    The coefficient is defined as 1 - IntSet.weightedJaccardSimilarity(IntSet).
    
    Specified by:
    
    weightedJaccardDistance in interface IntSet
    
    Parameters:
    
    other - the other set
    
    Returns:
    
    the weighted Jaccard distance
    
    See Also:
    
    IntSet.weightedJaccardSimilarity(IntSet)
  - empty
```
public IntSet empty()
```
    Generates an empty set
    
    Specified by:
    
    empty in interface IntSet
    
    Returns:
    
    the empty set
  - clone
```
public IntSet clone()
```
    See the clone() of Object
    
    Specified by:
    
    clone in interface IntSet
    
    Overrides:
    
    clone in class Object
    
    Returns:
    
    cloned object
  - convert
```
public IntSet convert(int... a)
```
    Converts a given array into an instance of the current class.
    
    Specified by:
    
    convert in interface IntSet
    
    Parameters:
    
    a - array to use to generate the new instance
    
    Returns:
    
    the converted collection
  - convert
```
public IntSet convert(Collection<Integer> c)
```
    Converts a given collection into an instance of the current class.
    
    Specified by:
    
    convert in interface IntSet
    
    Parameters:
    
    c - array to use to generate the new instance
    
    Returns:
    
    the converted collection
  - debugInfo
```
public String debugInfo()
```
    Prints debug info about the given IntSet implementation
    
    Specified by:
    
    debugInfo in interface IntSet
    
    Returns:
    
    a string that describes the internal representation of the instance

Class IntSetStatistics

Nested Class Summary

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

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Detail

IntSetStatistics

Method Detail

getUnionCount

getIntersectionCount

getDifferenceCount

getSymmetricDifferenceCount

getComplementCount

getUnionSizeCount

getIntersectionSizeCount

getDifferenceSizeCount

getSymmetricDifferenceSizeCount

getComplementSizeCount

getEqualsCount

getHashCodeCount

getContainsAllCount

getContainsAnyCount

getContainsAtLeastCount

getSizeCheckCount

resetCounters

summary

extractContainer

addAll

union

retainAll

intersection

removeAll

difference

symmetricDifference

complement

complemented

unionSize

intersectionSize

differenceSize

symmetricDifferenceSize

complementSize

containsAll

containsAny

containsAtLeast

hashCode

equals

bitmapCompressionRatio

collectionCompressionRatio

clear

fill

clear

add

remove

flip

get

indexOf

contains

first

last

isEmpty

size

iterator

descendingIterator

toArray

toArray

compareTo

toString

powerSet

powerSet

powerSetSize

powerSetSize

jaccardSimilarity

jaccardDistance

weightedJaccardSimilarity

weightedJaccardDistance

empty

clone

convert

convert