|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObjectCollection<K>
it.unimi.dsi.fastutil.objects.AbstractObjectSet<K>
it.unimi.dsi.fastutil.objects.ObjectArraySet<K>
public class ObjectArraySet<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 | |
---|---|
ObjectArraySet()
Creates a new empty array set. |
|
ObjectArraySet(int capacity)
Creates a new empty array set of given initial capacity. |
|
ObjectArraySet(Object[] a)
Creates a new array set using the given backing array. |
|
ObjectArraySet(Object[] a,
int size)
Creates a new array set using the given backing array and the given number of elements of the array. |
|
ObjectArraySet(ObjectSet<K> s)
Creates a new array set copying the contents of a given set. |
Method Summary | |
---|---|
boolean |
add(K k)
|
void |
clear()
|
Object |
clone()
Returns a deep copy of this set. |
boolean |
contains(Object k)
|
boolean |
isEmpty()
|
ObjectIterator<K> |
iterator()
Returns a type-specific iterator on the elements of this collection. |
boolean |
remove(Object k)
Removes an element from this set. |
int |
size()
|
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectSet |
---|
equals, hashCode |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectCollection |
---|
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.ObjectCollection |
---|
objectIterator, toArray |
Methods inherited from interface java.util.Set |
---|
addAll, containsAll, removeAll, retainAll, toArray, toArray |
Constructor Detail |
---|
public ObjectArraySet(Object[] a)
a
- the backing array.public ObjectArraySet()
public ObjectArraySet(int capacity)
capacity
- the initial capacity.public ObjectArraySet(ObjectSet<K> s)
public ObjectArraySet(Object[] 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 ObjectIterator<K> iterator()
ObjectCollection
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 ObjectCollection<K>
iterator
in interface ObjectIterable<K>
iterator
in interface ObjectSet<K>
iterator
in interface Iterable<K>
iterator
in interface Collection<K>
iterator
in interface Set<K>
iterator
in class AbstractObjectSet<K>
public boolean contains(Object k)
contains
in interface Collection<K>
contains
in interface Set<K>
public int size()
size
in interface Collection<K>
size
in interface Set<K>
public boolean remove(Object k)
ObjectSet
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 ObjectSet<K>
remove
in interface Collection<K>
remove
in interface Set<K>
remove
in class AbstractObjectSet<K>
Collection.remove(Object)
public boolean add(K k)
add
in interface Collection<K>
add
in interface Set<K>
add
in class AbstractObjectCollection<K>
public void clear()
clear
in interface Collection<K>
clear
in interface Set<K>
clear
in class AbstractObjectCollection<K>
public boolean isEmpty()
isEmpty
in interface Collection<K>
isEmpty
in interface Set<K>
isEmpty
in class AbstractObjectCollection<K>
public 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 |