|
|||||||||
| 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.IntArraySet
public class IntArraySet
A simple, brute-force implementation of a set based on a backing array.
The main purpose of this implementation is that of wrapping cleanly the brute-force approach to the storage of a very small number of items: just put them into an array and scan linearly to find an item.
| Constructor Summary | |
|---|---|
IntArraySet()
Creates a new empty array set. |
|
IntArraySet(int capacity)
Creates a new empty array set of given initial capacity. |
|
IntArraySet(int[] a)
Creates a new array set using the given backing array. |
|
IntArraySet(int[] a,
int size)
Creates a new array set using the given backing array and the given number of elements of the array. |
|
IntArraySet(IntSet s)
Creates a new array set copying the contents of a given set. |
|
| Method Summary | |
|---|---|
boolean |
add(int k)
|
void |
clear()
|
Object |
clone()
Returns a deep copy of this set. |
boolean |
contains(int k)
|
boolean |
isEmpty()
|
IntIterator |
iterator()
Returns a type-specific iterator on the elements of this collection. |
boolean |
remove(int k)
Removes an element from this set. |
int |
size()
|
| 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, intIterator, 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 it.unimi.dsi.fastutil.ints.IntCollection |
|---|
addAll, containsAll, intIterator, removeAll, retainAll, toArray, toArray, toIntArray, toIntArray |
| Methods inherited from interface java.util.Set |
|---|
add, addAll, contains, containsAll, removeAll, retainAll, toArray, toArray |
| Constructor Detail |
|---|
public IntArraySet(int[] a)
a - the backing array.public IntArraySet()
public IntArraySet(int capacity)
capacity - the initial capacity.public IntArraySet(IntSet s)
public IntArraySet(int[] a,
int size)
It is responsibility of the caller that the first size elements of a are distinct
(of course, distinct by identity, not by Object.equals(Object)).
a - the backing array.size - the number of valid elements in a.| Method Detail |
|---|
public IntIterator iterator()
IntCollectionNote 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.
iterator in interface IntCollectioniterator in interface IntIterableiterator in interface IntSetiterator in interface Iterable<Integer>iterator in interface Collection<Integer>iterator in interface Set<Integer>iterator in class AbstractIntSetpublic boolean contains(int k)
contains in interface IntCollectionCollection.contains(Object)public int size()
size in interface Collection<Integer>size in interface Set<Integer>public boolean remove(int k)
IntSetNote 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.
remove in interface IntSetremove in class AbstractIntSetCollection.remove(Object)public boolean add(int k)
add in interface IntCollectionadd in class AbstractIntCollectionCollection.add(Object)public void clear()
clear in interface Collection<Integer>clear in interface Set<Integer>clear in class AbstractIntCollectionpublic boolean isEmpty()
isEmpty in interface Collection<Integer>isEmpty in interface Set<Integer>isEmpty in class AbstractIntCollectionpublic Object clone()
This method performs a deep copy of this hash set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.
clone in class Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||