|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectjava.util.AbstractCollection<K>
it.unimi.dsi.fastutil.objects.AbstractReferenceCollection<K>
it.unimi.dsi.fastutil.objects.AbstractReferenceSet<K>
it.unimi.dsi.fastutil.objects.ReferenceArraySet<K>
public class ReferenceArraySet<K>
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 | |
---|---|
ReferenceArraySet()
Creates a new empty array set. |
|
ReferenceArraySet(java.util.Collection<? extends K> c)
Creates a new array set copying the contents of a given set. |
|
ReferenceArraySet(int capacity)
Creates a new empty array set of given initial capacity. |
|
ReferenceArraySet(java.lang.Object[] a)
Creates a new array set using the given backing array. |
|
ReferenceArraySet(java.lang.Object[] a,
int size)
Creates a new array set using the given backing array and the given number of elements of the array. |
|
ReferenceArraySet(ReferenceCollection<K> c)
Creates a new array set copying the contents of a given collection. |
Method Summary | |
---|---|
boolean |
add(K k)
|
void |
clear()
|
ReferenceArraySet<K> |
clone()
Returns a deep copy of this set. |
boolean |
contains(java.lang.Object k)
|
boolean |
isEmpty()
|
ObjectIterator<K> |
iterator()
Returns a type-specific iterator on the elements of this collection. |
boolean |
remove(java.lang.Object k)
Removes an element from this set. |
int |
size()
|
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReferenceSet |
---|
equals, hashCode |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReferenceCollection |
---|
addAll, containsAll, objectIterator, removeAll, retainAll, toArray, toArray, toString |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.objects.ReferenceCollection |
---|
objectIterator, toArray |
Methods inherited from interface java.util.Set |
---|
addAll, containsAll, removeAll, retainAll, toArray, toArray |
Constructor Detail |
---|
public ReferenceArraySet(java.lang.Object[] a)
It is responsibility of the caller that the elements of a
are distinct.
a
- the backing array.public ReferenceArraySet()
public ReferenceArraySet(int capacity)
capacity
- the initial capacity.public ReferenceArraySet(ReferenceCollection<K> c)
c
- a collection.public ReferenceArraySet(java.util.Collection<? extends K> c)
c
- a collection.public ReferenceArraySet(java.lang.Object[] a, int size)
It is responsibility of the caller that the first size
elements of a
are distinct.
a
- the backing array.size
- the number of valid elements in a
.Method Detail |
---|
public ObjectIterator<K> iterator()
ReferenceCollection
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
.
iterator
in interface ObjectIterable<K>
iterator
in interface ReferenceCollection<K>
iterator
in interface ReferenceSet<K>
iterator
in interface java.lang.Iterable<K>
iterator
in interface java.util.Collection<K>
iterator
in interface java.util.Set<K>
iterator
in class AbstractReferenceSet<K>
public boolean contains(java.lang.Object k)
contains
in interface java.util.Collection<K>
contains
in interface java.util.Set<K>
contains
in class java.util.AbstractCollection<K>
public int size()
size
in interface java.util.Collection<K>
size
in interface java.util.Set<K>
size
in class java.util.AbstractCollection<K>
public boolean remove(java.lang.Object k)
ReferenceSet
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.
remove
in interface ReferenceSet<K>
remove
in interface java.util.Collection<K>
remove
in interface java.util.Set<K>
remove
in class AbstractReferenceSet<K>
Collection.remove(Object)
public boolean add(K k)
add
in interface java.util.Collection<K>
add
in interface java.util.Set<K>
add
in class AbstractReferenceCollection<K>
public void clear()
clear
in interface java.util.Collection<K>
clear
in interface java.util.Set<K>
clear
in class java.util.AbstractCollection<K>
public boolean isEmpty()
isEmpty
in interface java.util.Collection<K>
isEmpty
in interface java.util.Set<K>
isEmpty
in class AbstractReferenceCollection<K>
public ReferenceArraySet<K> 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 java.lang.Object
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |