Class ObjectAVLTreeSet<K>
- java.lang.Object
-
- java.util.AbstractCollection<K>
-
- it.unimi.dsi.fastutil.objects.AbstractObjectCollection<K>
-
- it.unimi.dsi.fastutil.objects.AbstractObjectSet<K>
-
- it.unimi.dsi.fastutil.objects.AbstractObjectSortedSet<K>
-
- it.unimi.dsi.fastutil.objects.ObjectAVLTreeSet<K>
-
- All Implemented Interfaces:
ObjectBidirectionalIterable<K>
,ObjectCollection<K>
,ObjectIterable<K>
,ObjectSet<K>
,ObjectSortedSet<K>
,java.io.Serializable
,java.lang.Cloneable
,java.lang.Iterable<K>
,java.util.Collection<K>
,java.util.Set<K>
,java.util.SortedSet<K>
public class ObjectAVLTreeSet<K> extends AbstractObjectSortedSet<K> implements java.io.Serializable, java.lang.Cloneable, ObjectSortedSet<K>
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 byiterator()
can be safely cast to a type-specific list iterator.- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description ObjectAVLTreeSet()
Creates a new empty tree set.ObjectAVLTreeSet(ObjectCollection<? extends K> c)
Creates a new tree set copying a given type-specific collection.ObjectAVLTreeSet(ObjectSortedSet<K> s)
Creates a new tree set copying a given type-specific sorted set (and itsComparator
).ObjectAVLTreeSet(java.util.Collection<? extends K> c)
Creates a new tree set copying a given set.ObjectAVLTreeSet(java.util.Comparator<? super K> c)
Creates a new empty tree set with the given comparator.ObjectAVLTreeSet(java.util.Iterator<? extends K> i)
Creates a new tree set using elements provided by a type-specific iterator.ObjectAVLTreeSet(java.util.SortedSet<K> s)
Creates a new tree set copying a given sorted set (and itsComparator
).ObjectAVLTreeSet(K[] a)
Creates a new tree set copying the elements of an array.ObjectAVLTreeSet(K[] a, int offset, int length)
Creates a new tree set and fills it with the elements of a given array.ObjectAVLTreeSet(K[] a, int offset, int length, java.util.Comparator<? super K> c)
Creates a new tree set and fills it with the elements of a given array using a givenComparator
.ObjectAVLTreeSet(K[] a, java.util.Comparator<? super K> c)
Creates a new tree set copying the elements of an array using a givenComparator
.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
add(K k)
void
clear()
java.lang.Object
clone()
Returns a deep copy of this tree set.java.util.Comparator<? super K>
comparator()
boolean
contains(java.lang.Object k)
K
first()
K
get(java.lang.Object k)
ObjectSortedSet<K>
headSet(K to)
Returns a view of the portion of this sorted set whose elements are strictly less thantoElement
.boolean
isEmpty()
ObjectBidirectionalIterator<K>
iterator()
Returns a type-specific iterator on the elements of this collection.ObjectBidirectionalIterator<K>
iterator(K from)
Returns a type-specificBidirectionalIterator
on the elements in this set, starting from a given element of the domain (optional operation).K
last()
boolean
remove(java.lang.Object k)
int
size()
ObjectSortedSet<K>
subSet(K from, K to)
Returns a view of the portion of this sorted set whose elements range fromfromElement
, inclusive, totoElement
, exclusive.ObjectSortedSet<K>
tailSet(K from)
Returns a view of the portion of this sorted set whose elements are greater than or equal tofromElement
.-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectSet
equals, hashCode
-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectCollection
toString
-
Methods inherited from class java.util.AbstractCollection
addAll, containsAll, removeAll, retainAll, toArray, toArray
-
-
-
-
Constructor Detail
-
ObjectAVLTreeSet
public ObjectAVLTreeSet()
Creates a new empty tree set.
-
ObjectAVLTreeSet
public ObjectAVLTreeSet(java.util.Comparator<? super K> c)
Creates a new empty tree set with the given comparator.- Parameters:
c
- aComparator
(even better, a type-specific comparator).
-
ObjectAVLTreeSet
public ObjectAVLTreeSet(java.util.Collection<? extends K> c)
Creates a new tree set copying a given set.- Parameters:
c
- a collection to be copied into the new tree set.
-
ObjectAVLTreeSet
public ObjectAVLTreeSet(java.util.SortedSet<K> s)
Creates a new tree set copying a given sorted set (and itsComparator
).- Parameters:
s
- aSortedSet
to be copied into the new tree set.
-
ObjectAVLTreeSet
public ObjectAVLTreeSet(ObjectCollection<? extends K> 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.
-
ObjectAVLTreeSet
public ObjectAVLTreeSet(ObjectSortedSet<K> s)
Creates a new tree set copying a given type-specific sorted set (and itsComparator
).- Parameters:
s
- a type-specific sorted set to be copied into the new tree set.
-
ObjectAVLTreeSet
public ObjectAVLTreeSet(java.util.Iterator<? extends K> 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.
-
ObjectAVLTreeSet
public ObjectAVLTreeSet(K[] a, int offset, int length, java.util.Comparator<? super K> c)
Creates a new tree set and fills it with the elements of a given array using a givenComparator
.- 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
- aComparator
(even better, a type-specific comparator).
-
ObjectAVLTreeSet
public ObjectAVLTreeSet(K[] 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.
-
ObjectAVLTreeSet
public ObjectAVLTreeSet(K[] a)
Creates a new tree set copying the elements of an array.- Parameters:
a
- an array to be copied into the new tree set.
-
-
Method Detail
-
add
public boolean add(K k)
-
remove
public boolean remove(java.lang.Object k)
-
contains
public boolean contains(java.lang.Object k)
-
get
public K get(java.lang.Object k)
-
clear
public void clear()
-
size
public int size()
-
isEmpty
public boolean isEmpty()
-
iterator
public ObjectBidirectionalIterator<K> iterator()
Description copied from interface:ObjectCollection
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 extendsCollection
.- Specified by:
iterator
in interfacejava.util.Collection<K>
- Specified by:
iterator
in interfacejava.lang.Iterable<K>
- Specified by:
iterator
in interfaceObjectBidirectionalIterable<K>
- Specified by:
iterator
in interfaceObjectCollection<K>
- Specified by:
iterator
in interfaceObjectIterable<K>
- Specified by:
iterator
in interfaceObjectSet<K>
- Specified by:
iterator
in interfaceObjectSortedSet<K>
- Specified by:
iterator
in interfacejava.util.Set<K>
- Specified by:
iterator
in classAbstractObjectSortedSet<K>
- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
Iterable.iterator()
-
iterator
public ObjectBidirectionalIterator<K> iterator(K from)
Description copied from interface:ObjectSortedSet
Returns a type-specificBidirectionalIterator
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 returnfalse
). 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 returnfalse
).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 interfaceObjectSortedSet<K>
- Parameters:
from
- an element to start from.- Returns:
- a bidirectional iterator on the element in this set, starting at the given element.
-
comparator
public java.util.Comparator<? super K> comparator()
- Specified by:
comparator
in interfacejava.util.SortedSet<K>
-
headSet
public ObjectSortedSet<K> headSet(K to)
Description copied from interface:ObjectSortedSet
Returns a view of the portion of this sorted set whose elements are strictly less thantoElement
.Note that this specification strengthens the one given in
SortedSet.headSet(Object)
.- Specified by:
headSet
in interfaceObjectSortedSet<K>
- Specified by:
headSet
in interfacejava.util.SortedSet<K>
- See Also:
SortedSet.headSet(Object)
-
tailSet
public ObjectSortedSet<K> tailSet(K from)
Description copied from interface:ObjectSortedSet
Returns a view of the portion of this sorted set whose elements are greater than or equal tofromElement
.Note that this specification strengthens the one given in
SortedSet.headSet(Object)
.- Specified by:
tailSet
in interfaceObjectSortedSet<K>
- Specified by:
tailSet
in interfacejava.util.SortedSet<K>
- See Also:
SortedSet.tailSet(Object)
-
subSet
public ObjectSortedSet<K> subSet(K from, K to)
Description copied from interface:ObjectSortedSet
Returns a view of the portion of this sorted set whose elements range fromfromElement
, inclusive, totoElement
, exclusive.Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object)
.- Specified by:
subSet
in interfaceObjectSortedSet<K>
- Specified by:
subSet
in interfacejava.util.SortedSet<K>
- See Also:
SortedSet.subSet(Object,Object)
-
clone
public java.lang.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.
- Returns:
- a deep copy of this tree set.
-
-