it.unimi.dsi.fastutil.longs
Class LongAVLTreeSet

java.lang.Object
  java.util.AbstractCollection<Long>
      it.unimi.dsi.fastutil.longs.AbstractLongCollection
          it.unimi.dsi.fastutil.longs.AbstractLongSet
              it.unimi.dsi.fastutil.longs.AbstractLongSortedSet
                  it.unimi.dsi.fastutil.longs.LongAVLTreeSet

All Implemented Interfaces:

LongCollection, LongIterable, LongSet, LongSortedSet, Serializable, Cloneable, Iterable<Long>, Collection<Long>, Set<Long>, SortedSet<Long>

public class LongAVLTreeSet
extends AbstractLongSortedSet
implements Serializable, Cloneable, LongSortedSet

A type-specific AVL 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

Field Summary

static long

serialVersionUID

Constructor Summary

LongAVLTreeSet()
Creates a new empty tree set.

LongAVLTreeSet(Collection<? extends Long> c)
Creates a new tree set copying a given set.

LongAVLTreeSet(Comparator<? super Long> c)
Creates a new empty tree set with the given comparator.

LongAVLTreeSet(Iterator<? extends Long> i)
Creates a new tree set using elements provided by an iterator.

LongAVLTreeSet(long[] a)
Creates a new tree set copying the elements of an array.

LongAVLTreeSet(long[] a, Comparator<? super Long> c)
Creates a new tree set copying the elements of an array using a given Comparator.

LongAVLTreeSet(long[] a, int offset, int length)
Creates a new tree set and fills it with the elements of a given array.

LongAVLTreeSet(long[] a, int offset, int length, Comparator<? super Long> c)
Creates a new tree set and fills it with the elements of a given array using a given Comparator.

LongAVLTreeSet(LongCollection c)
Creates a new tree set copying a given type-specific collection.

LongAVLTreeSet(LongIterator i)
Creates a new tree set using elements provided by a type-specific iterator.

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

LongAVLTreeSet(SortedSet<Long> s)
Creates a new tree set copying a given sorted set (and its Comparator).

Method Summary

boolean	add(long k)
void	clear()
Object	clone() Returns a deep copy of this tree set.
LongComparator	comparator() Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
boolean	contains(long k)
long	firstLong()
LongSortedSet	headSet(long to)
boolean	isEmpty()
LongBidirectionalIterator	iterator() Returns a type-specific iterator on the elements of this collection.
LongBidirectionalIterator	iterator(long from) Returns a type-specific BidirectionalIterator on the elements in this set, starting from a given element of the domain (optional operation).
long	lastLong()
boolean	remove(long k) Removes an element from this set.
int	size()
LongSortedSet	subSet(long from, long to)
LongSortedSet	tailSet(long from)

Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLongSortedSet

first, headSet, last, longIterator, subSet, tailSet

Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLongSet

equals, hashCode, rem, remove

Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLongCollection

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

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.longs.LongSortedSet

headSet, longIterator, subSet, tailSet

Methods inherited from interface it.unimi.dsi.fastutil.longs.LongCollection

addAll, containsAll, rem, removeAll, retainAll, toArray, toArray, toLongArray, toLongArray

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

Field Detail

serialVersionUID

public static final long serialVersionUID

See Also:

Constant Field Values

Constructor Detail

LongAVLTreeSet

public LongAVLTreeSet()

Creates a new empty tree set.

LongAVLTreeSet

public LongAVLTreeSet(Comparator<? super Long> c)

Creates a new empty tree set with the given comparator.

Parameters:

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

LongAVLTreeSet

public LongAVLTreeSet(Collection<? extends Long> c)

Creates a new tree set copying a given set.

Parameters:

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

LongAVLTreeSet

public LongAVLTreeSet(SortedSet<Long> 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.

LongAVLTreeSet

public LongAVLTreeSet(LongCollection 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.

LongAVLTreeSet

public LongAVLTreeSet(LongSortedSet 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.

LongAVLTreeSet

public LongAVLTreeSet(LongIterator 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.

LongAVLTreeSet

public LongAVLTreeSet(Iterator<? extends Long> i)

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

Parameters:

i - an iterator whose elements will fill the set.

LongAVLTreeSet

public LongAVLTreeSet(long[] a,
                      int offset,
                      int length,
                      Comparator<? super Long> 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).

LongAVLTreeSet

public LongAVLTreeSet(long[] 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.

LongAVLTreeSet

public LongAVLTreeSet(long[] a)

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

Parameters:

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

LongAVLTreeSet

public LongAVLTreeSet(long[] a,
                      Comparator<? super Long> 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(long k)

Specified by:

add in interface LongCollection

Overrides:

add in class AbstractLongCollection

See Also:

Collection.add(Object)

remove

public boolean remove(long k)

Description copied from interface: LongSet

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 LongSet

Overrides:

remove in class AbstractLongSet

See Also:

Collection.remove(Object)

contains

public boolean contains(long k)

Specified by:

contains in interface LongCollection

Overrides:

contains in class AbstractLongCollection

See Also:

Collection.contains(Object)

clear

public void clear()

Specified by:

clear in interface Collection<Long>

Specified by:

clear in interface Set<Long>

Overrides:

clear in class AbstractCollection<Long>

size

public int size()

Specified by:

size in interface Collection<Long>

Specified by:

size in interface Set<Long>

Specified by:

size in class AbstractCollection<Long>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Collection<Long>

Specified by:

isEmpty in interface Set<Long>

Overrides:

isEmpty in class AbstractLongCollection

firstLong

public long firstLong()

Specified by:

firstLong in interface LongSortedSet

See Also:

SortedSet.first()

lastLong

public long lastLong()

Specified by:

lastLong in interface LongSortedSet

See Also:

SortedSet.last()

iterator

public LongBidirectionalIterator iterator()

Description copied from interface: LongCollection

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 LongCollection

Specified by:

iterator in interface LongIterable

Specified by:

iterator in interface LongSet

Specified by:

iterator in interface LongSortedSet

Specified by:

iterator in interface Iterable<Long>

Specified by:

iterator in interface Collection<Long>

Specified by:

iterator in interface Set<Long>

Specified by:

iterator in class AbstractLongSortedSet

Returns:

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

iterator

public LongBidirectionalIterator iterator(long from)

Description copied from interface: LongSortedSet

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 LongSortedSet

Parameters:

from - an element to start from.

Returns:

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

comparator

public LongComparator comparator()

Description copied from interface: LongSortedSet

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 LongSortedSet

Specified by:

comparator in interface SortedSet<Long>

See Also:

SortedSet.comparator()

headSet

public LongSortedSet headSet(long to)

Specified by:

headSet in interface LongSortedSet

See Also:

SortedSet.headSet(Object)

tailSet

public LongSortedSet tailSet(long from)

Specified by:

tailSet in interface LongSortedSet

See Also:

SortedSet.tailSet(Object)

subSet

public LongSortedSet subSet(long from,
                            long to)

Specified by:

subSet in interface LongSortedSet

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.