public class FloatArraySet extends AbstractFloatSet implements Serializable, Cloneable
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 and Description |
|---|
FloatArraySet()
Creates a new empty array set.
|
FloatArraySet(Collection<? extends Float> c)
Creates a new array set copying the contents of a given set.
|
FloatArraySet(float[] a)
Creates a new array set using the given backing array.
|
FloatArraySet(float[] a,
int size)
Creates a new array set using the given backing array and the given number of elements of the array.
|
FloatArraySet(FloatCollection c)
Creates a new array set copying the contents of a given collection.
|
FloatArraySet(int capacity)
Creates a new empty array set of given initial capacity.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(float k) |
void |
clear() |
FloatArraySet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(float k) |
boolean |
isEmpty() |
FloatIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
boolean |
remove(float k)
Removes an element from this set.
|
int |
size() |
equals, hashCode, rem, removeadd, addAll, addAll, contains, containsAll, containsAll, floatIterator, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toFloatArray, toFloatArray, toStringaddAll, containsAll, floatIterator, removeAll, retainAll, toArray, toArray, toFloatArray, toFloatArrayadd, addAll, contains, containsAll, removeAll, retainAll, spliterator, toArray, toArrayparallelStream, removeIf, streampublic FloatArraySet(float[] a)
It is responsibility of the caller that the elements of a are distinct.
a - the backing array.public FloatArraySet()
public FloatArraySet(int capacity)
capacity - the initial capacity.public FloatArraySet(FloatCollection c)
c - a collection.public FloatArraySet(Collection<? extends Float> c)
c - a collection.public FloatArraySet(float[] 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.public FloatIterator iterator()
FloatCollectionNote 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 FloatCollectioniterator in interface FloatIterableiterator in interface FloatSetiterator in interface Iterable<Float>iterator in interface Collection<Float>iterator in interface Set<Float>iterator in class AbstractFloatSetpublic boolean contains(float k)
contains in interface FloatCollectioncontains in class AbstractFloatCollectionCollection.contains(Object)public int size()
size in interface Collection<Float>size in interface Set<Float>size in class AbstractCollection<Float>public boolean remove(float k)
FloatSetNote 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 FloatSetremove in class AbstractFloatSetCollection.remove(Object)public boolean add(float k)
add in interface FloatCollectionadd in class AbstractFloatCollectionCollection.add(Object)public void clear()
clear in interface Collection<Float>clear in interface Set<Float>clear in class AbstractCollection<Float>public boolean isEmpty()
isEmpty in interface Collection<Float>isEmpty in interface Set<Float>isEmpty in class AbstractFloatCollectionpublic FloatArraySet 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.