|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.ints.AbstractIntCollection
it.unimi.dsi.fastutil.ints.AbstractIntSet
it.unimi.dsi.fastutil.ints.AbstractIntSortedSet
it.unimi.dsi.fastutil.ints.IntAVLTreeSet
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.
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
IntAVLTreeSet()
Creates a new empty tree set. |
|
IntAVLTreeSet(Collection c)
Creates a new tree set copying a given set. |
|
IntAVLTreeSet(Comparator c)
Creates a new empty tree set with the given comparator. |
|
IntAVLTreeSet(int[] a)
Creates a new tree set copying the elements of an array. |
|
IntAVLTreeSet(int[] a,
Comparator c)
Creates a new tree set copying the elements of an array using a given Comparator . |
|
IntAVLTreeSet(int[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array. |
|
IntAVLTreeSet(int[] a,
int offset,
int length,
Comparator c)
Creates a new tree set and fills it with the elements of a given array using a given Comparator . |
|
IntAVLTreeSet(IntCollection c)
Creates a new tree set copying a given type-specific collection. |
|
IntAVLTreeSet(IntIterator i)
Creates a new tree set using elements provided by a type-specific iterator. |
|
IntAVLTreeSet(IntSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its Comparator ). |
|
IntAVLTreeSet(Iterator i)
Creates a new tree set using elements provided by an iterator. |
|
IntAVLTreeSet(SortedSet s)
Creates a new tree set copying a given sorted set (and its Comparator ). |
Method Summary | |
boolean |
add(int k)
|
void |
clear()
|
Object |
clone()
Returns a deep copy of this tree set. |
Comparator |
comparator()
|
boolean |
contains(int k)
|
int |
firstInt()
|
IntSortedSet |
headSet(int to)
|
IntIterator |
intIterator()
Returns a type-specific iterator on the collection. |
boolean |
isEmpty()
|
IntBidirectionalIterator |
iterator(int from)
Returns a type-specific BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation).
|
int |
lastInt()
|
boolean |
remove(int k)
Note that the corresponding method of the type-specific collection is rem() .
|
int |
size()
|
IntSortedSet |
subSet(int from,
int to)
|
IntSortedSet |
tailSet(int from)
|
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractIntSortedSet |
first, headSet, last, subSet, tailSet |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractIntSet |
equals, hashCode, rem, remove |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractIntCollection |
add, addAll, addAll, contains, containsAll, containsAll, iterator, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toIntArray, toIntArray, toString |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.Set |
add, addAll, contains, containsAll, equals, hashCode, iterator, remove, removeAll, retainAll, toArray, toArray |
Methods inherited from interface it.unimi.dsi.fastutil.ints.IntCollection |
addAll, containsAll, rem, removeAll, retainAll, toArray, toIntArray, toIntArray |
Methods inherited from interface java.util.SortedSet |
first, headSet, last, subSet, tailSet |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public IntAVLTreeSet()
public IntAVLTreeSet(Comparator c)
c
- a Comparator
(even better, a type-specific comparator).public IntAVLTreeSet(Collection c)
c
- a collection to be copied into the new tree set.public IntAVLTreeSet(SortedSet s)
Comparator
).
s
- a SortedSet
to be copied into the new tree set.public IntAVLTreeSet(IntCollection c)
c
- a type-specific collection to be copied into the new tree set.public IntAVLTreeSet(IntSortedSet s)
Comparator
).
s
- a type-specific sorted set to be copied into the new tree set.public IntAVLTreeSet(IntIterator i)
i
- a type-specific iterator whose elements will fill the set.public IntAVLTreeSet(Iterator i)
i
- an iterator whose elements will fill the set.public IntAVLTreeSet(int[] a, int offset, int length, Comparator c)
Comparator
.
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).public IntAVLTreeSet(int[] a, int offset, int length)
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.public IntAVLTreeSet(int[] a)
a
- an array to be copied into the new tree set.public IntAVLTreeSet(int[] a, Comparator c)
Comparator
.
a
- an array to be copied into the new tree set.c
- a Comparator
(even better, a type-specific comparator).Method Detail |
public final boolean add(int k)
add
in interface IntCollection
add
in class AbstractIntCollection
public final boolean remove(int k)
IntSet
rem()
.
This unfortunate situation is caused by the clash
with the similarly named index-based method in the List
interface.
remove
in interface IntSet
remove
in class AbstractIntSet
public boolean contains(int k)
contains
in interface IntCollection
Collection.contains(Object)
public void clear()
clear
in interface Set
clear
in class AbstractIntCollection
public int size()
size
in interface Set
public boolean isEmpty()
isEmpty
in interface Set
isEmpty
in class AbstractIntCollection
public int firstInt()
firstInt
in interface IntSortedSet
SortedSet.first()
public int lastInt()
lastInt
in interface IntSortedSet
SortedSet.last()
public IntIterator intIterator()
IntCollection
The iterator returned by the Collection.iterator()
method and by this
method are identical; however, using this method you can save a type casting.
intIterator
in interface IntCollection
Collection.iterator()
public IntBidirectionalIterator iterator(int from)
IntSortedSet
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.
iterator
in interface IntSortedSet
iterator
in class AbstractIntSet
public Comparator comparator()
comparator
in interface SortedSet
public IntSortedSet headSet(int to)
headSet
in interface IntSortedSet
SortedSet.headSet(Object)
public IntSortedSet tailSet(int from)
tailSet
in interface IntSortedSet
SortedSet.tailSet(Object)
public IntSortedSet subSet(int from, int to)
subSet
in interface IntSortedSet
SortedSet.subSet(Object,Object)
public Object clone()
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.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |