it.unimi.dsi.fastutil.shorts

Class ShortRBTreeSet

java.lang.Object

java.util.AbstractCollection<Short>

it.unimi.dsi.fastutil.shorts.AbstractShortCollection

it.unimi.dsi.fastutil.shorts.AbstractShortSet

it.unimi.dsi.fastutil.shorts.AbstractShortSortedSet

it.unimi.dsi.fastutil.shorts.ShortRBTreeSet

All Implemented Interfaces:

ShortCollection, ShortIterable, ShortSet, ShortSortedSet, Serializable, Cloneable, Iterable<Short>, Collection<Short>, Set<Short>, SortedSet<Short>

public class ShortRBTreeSet
extends AbstractShortSortedSet
implements Serializable, Cloneable, ShortSortedSet

A type-specific red-black tree set with a fast, small-footprint implementation.

The iterators provided by this class are type-specific bidirectional iterators. Moreover, the iterator returned by iterator() can be safely cast to a type-specific list iterator.

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
ShortRBTreeSet() Creates a new empty tree set.
ShortRBTreeSet(Collection<? extends Short> c) Creates a new tree set copying a given collection.
ShortRBTreeSet(Comparator<? super Short> c) Creates a new empty tree set with the given comparator.
ShortRBTreeSet(Iterator<? extends Short> i) Creates a new tree set using elements provided by an iterator.
ShortRBTreeSet(short[] a) Creates a new tree set copying the elements of an array.
ShortRBTreeSet(short[] a, Comparator<? super Short> c) Creates a new tree set copying the elements of an array using a given Comparator.
ShortRBTreeSet(short[] a, int offset, int length) Creates a new tree set and fills it with the elements of a given array.
ShortRBTreeSet(short[] a, int offset, int length, Comparator<? super Short> c) Creates a new tree set and fills it with the elements of a given array using a given Comparator.
ShortRBTreeSet(ShortCollection c) Creates a new tree set copying a given type-specific collection.
ShortRBTreeSet(ShortIterator i) Creates a new tree set using elements provided by a type-specific iterator.
ShortRBTreeSet(ShortSortedSet s) Creates a new tree set copying a given type-specific sorted set (and its Comparator).
ShortRBTreeSet(SortedSet<Short> s) Creates a new tree set copying a given sorted set (and its Comparator).

Method Summary

Methods

Modifier and Type	Method and Description
boolean	add(short k)
void	clear()
Object	clone() Returns a deep copy of this tree set.
ShortComparator	comparator() Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
boolean	contains(short k)
short	firstShort()
ShortSortedSet	headSet(short to)
boolean	isEmpty()
ShortBidirectionalIterator	iterator() Returns a type-specific iterator on the elements of this collection.
ShortBidirectionalIterator	iterator(short from) Returns a type-specific BidirectionalIterator on the elements in this set, starting from a given element of the domain (optional operation).
short	lastShort()
boolean	remove(short k) Removes an element from this set.
int	size()
ShortSortedSet	subSet(short from, short to)
ShortSortedSet	tailSet(short from)

Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortSortedSet

first, headSet, last, shortIterator, subSet, tailSet

Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortSet

equals, hashCode, rem, remove

Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortCollection

add, addAll, addAll, contains, containsAll, containsAll, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toShortArray, toShortArray, toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortSortedSet

headSet, shortIterator, subSet, tailSet

Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortCollection

addAll, containsAll, rem, removeAll, retainAll, toArray, toArray, toShortArray, toShortArray

Methods inherited from interface java.util.SortedSet

first, last

Methods inherited from interface java.util.Set

add, addAll, contains, containsAll, equals, hashCode, remove, removeAll, retainAll, toArray, toArray

Constructor Detail

ShortRBTreeSet

public ShortRBTreeSet()

Creates a new empty tree set.

ShortRBTreeSet

public ShortRBTreeSet(Comparator<? super Short> c)

Creates a new empty tree set with the given comparator.

Parameters:

c - a Comparator (even better, a type-specific comparator).

ShortRBTreeSet

public ShortRBTreeSet(Collection<? extends Short> c)

Creates a new tree set copying a given collection.

Parameters:

c - a collection to be copied into the new tree set.

ShortRBTreeSet

public ShortRBTreeSet(SortedSet<Short> s)

Creates a new tree set copying a given sorted set (and its Comparator).

Parameters:

s - a SortedSet to be copied into the new tree set.

ShortRBTreeSet

public ShortRBTreeSet(ShortCollection c)

Creates a new tree set copying a given type-specific collection.

Parameters:

c - a type-specific collection to be copied into the new tree set.

ShortRBTreeSet

public ShortRBTreeSet(ShortSortedSet s)

Creates a new tree set copying a given type-specific sorted set (and its Comparator).

Parameters:

s - a type-specific sorted set to be copied into the new tree set.

ShortRBTreeSet

public ShortRBTreeSet(ShortIterator i)

Creates a new tree set using elements provided by a type-specific iterator.

Parameters:

i - a type-specific iterator whose elements will fill the set.

ShortRBTreeSet

public ShortRBTreeSet(Iterator<? extends Short> i)

Creates a new tree set using elements provided by an iterator.

Parameters:

i - an iterator whose elements will fill the set.

ShortRBTreeSet

public ShortRBTreeSet(short[] a,
              int offset,
              int length,
              Comparator<? super Short> c)

Creates a new tree set and fills it with the elements of a given array using a given Comparator.

Parameters:

a - an array whose elements will be used to fill the set.

offset - the first element to use.

length - the number of elements to use.

c - a Comparator (even better, a type-specific comparator).

ShortRBTreeSet

public ShortRBTreeSet(short[] a,
              int offset,
              int length)

Creates a new tree set and fills it with the elements of a given array.

Parameters:

a - an array whose elements will be used to fill the set.

offset - the first element to use.

length - the number of elements to use.

ShortRBTreeSet

public ShortRBTreeSet(short[] a)

Creates a new tree set copying the elements of an array.

Parameters:

a - an array to be copied into the new tree set.

ShortRBTreeSet

public ShortRBTreeSet(short[] a,
              Comparator<? super Short> c)

Creates a new tree set copying the elements of an array using a given Comparator.

Parameters:

a - an array to be copied into the new tree set.

c - a Comparator (even better, a type-specific comparator).

Method Detail

add

public boolean add(short k)

Specified by:

add in interface ShortCollection

Overrides:

add in class AbstractShortCollection

See Also:

Collection.add(Object)

remove

public boolean remove(short k)

Description copied from interface: ShortSet

Removes an element from this set.

Note that the corresponding method of the type-specific collection is rem(). This unfortunate situation is caused by the clash with the similarly named index-based method in the List interface.

Specified by:

remove in interface ShortSet

Overrides:

remove in class AbstractShortSet

See Also:

Collection.remove(Object)

contains

public boolean contains(short k)

Specified by:

contains in interface ShortCollection

Overrides:

contains in class AbstractShortCollection

See Also:

Collection.contains(Object)

clear

public void clear()

Specified by:

clear in interface Collection<Short>

Specified by:

clear in interface Set<Short>

Overrides:

clear in class AbstractCollection<Short>

size

public int size()

Specified by:

size in interface Collection<Short>

Specified by:

size in interface Set<Short>

Specified by:

size in class AbstractCollection<Short>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Collection<Short>

Specified by:

isEmpty in interface Set<Short>

Overrides:

isEmpty in class AbstractShortCollection

firstShort

public short firstShort()

Specified by:

firstShort in interface ShortSortedSet

See Also:

SortedSet.first()

lastShort

public short lastShort()

Specified by:

lastShort in interface ShortSortedSet

See Also:

SortedSet.last()

iterator

public ShortBidirectionalIterator iterator()

Description copied from interface: ShortCollection

Returns a type-specific iterator on the elements of this collection.

Note that this specification strengthens the one given in Iterable.iterator(), which was already strengthened in the corresponding type-specific class, but was weakened by the fact that this interface extends Collection.

Specified by:

iterator in interface ShortCollection

Specified by:

iterator in interface ShortIterable

Specified by:

iterator in interface ShortSet

Specified by:

iterator in interface ShortSortedSet

Specified by:

iterator in interface Iterable<Short>

Specified by:

iterator in interface Collection<Short>

Specified by:

iterator in interface Set<Short>

Specified by:

iterator in class AbstractShortSortedSet

Returns:

a type-specific iterator on the elements of this collection.

iterator

public ShortBidirectionalIterator iterator(short from)

Description copied from interface: ShortSortedSet

Returns a type-specific BidirectionalIterator on the elements in this set, starting from a given element of the domain (optional operation).

This method returns a type-specific bidirectional iterator with given starting point. The starting point is any element comparable to the elements of this set (even if it does not actually belong to the set). The next element of the returned iterator is the least element of the set that is greater than the starting point (if there are no elements greater than the starting point, hasNext() will return false). The previous element of the returned iterator is the greatest element of the set that is smaller than or equal to the starting point (if there are no elements smaller than or equal to the starting point, hasPrevious() will return false).

Note that passing the last element of the set as starting point and calling previous() you can traverse the entire set in reverse order.

Specified by:

iterator in interface ShortSortedSet

Parameters:

from - an element to start from.

Returns:

a bidirectional iterator on the element in this set, starting at the given element.

comparator

public ShortComparator comparator()

Description copied from interface: ShortSortedSet

Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.

Note that this specification strengthens the one given in SortedSet.comparator().

Specified by:

comparator in interface ShortSortedSet

Specified by:

comparator in interface SortedSet<Short>

See Also:

SortedSet.comparator()

headSet

public ShortSortedSet headSet(short to)

Specified by:

headSet in interface ShortSortedSet

See Also:

SortedSet.headSet(Object)

tailSet

public ShortSortedSet tailSet(short from)

Specified by:

tailSet in interface ShortSortedSet

See Also:

SortedSet.tailSet(Object)

subSet

public ShortSortedSet subSet(short from,
                    short to)

Specified by:

subSet in interface ShortSortedSet

See Also:

SortedSet.subSet(Object,Object)

clone

public Object clone()

Returns a deep copy of this tree set.

This method performs a deep copy of this tree set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.

Overrides:

clone in class Object

Returns:

a deep copy of this tree set.