public class ByteArraySet extends AbstractByteSet implements java.io.Serializable, java.lang.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 |
---|
ByteArraySet()
Creates a new empty array set.
|
ByteArraySet(byte[] a)
Creates a new array set using the given backing array.
|
ByteArraySet(byte[] a,
int size)
Creates a new array set using the given backing array and the given number of elements of the array.
|
ByteArraySet(ByteCollection c)
Creates a new array set copying the contents of a given collection.
|
ByteArraySet(java.util.Collection<? extends java.lang.Byte> c)
Creates a new array set copying the contents of a given set.
|
ByteArraySet(int capacity)
Creates a new empty array set of given initial capacity.
|
Modifier and Type | Method and Description |
---|---|
boolean |
add(byte k) |
void |
clear() |
ByteArraySet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(byte k) |
boolean |
isEmpty() |
ByteIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
boolean |
remove(byte k)
Removes an element from this set.
|
int |
size() |
equals, hashCode, rem, remove
add, addAll, addAll, byteIterator, contains, containsAll, containsAll, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toByteArray, toByteArray, toString
addAll, byteIterator, containsAll, removeAll, retainAll, toArray, toArray, toByteArray, toByteArray
public ByteArraySet(byte[] a)
It is responsibility of the caller that the elements of a
are distinct.
a
- the backing array.public ByteArraySet()
public ByteArraySet(int capacity)
capacity
- the initial capacity.public ByteArraySet(ByteCollection c)
c
- a collection.public ByteArraySet(java.util.Collection<? extends java.lang.Byte> c)
c
- a collection.public ByteArraySet(byte[] 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 ByteIterator iterator()
ByteCollection
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 ByteCollection
iterator
in interface ByteIterable
iterator
in interface ByteSet
iterator
in interface java.lang.Iterable<java.lang.Byte>
iterator
in interface java.util.Collection<java.lang.Byte>
iterator
in interface java.util.Set<java.lang.Byte>
iterator
in class AbstractByteSet
public boolean contains(byte k)
contains
in interface ByteCollection
contains
in class AbstractByteCollection
Collection.contains(Object)
public int size()
size
in interface java.util.Collection<java.lang.Byte>
size
in interface java.util.Set<java.lang.Byte>
size
in class java.util.AbstractCollection<java.lang.Byte>
public boolean remove(byte k)
ByteSet
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 ByteSet
remove
in class AbstractByteSet
Collection.remove(Object)
public boolean add(byte k)
add
in interface ByteCollection
add
in class AbstractByteCollection
Collection.add(Object)
public void clear()
clear
in interface java.util.Collection<java.lang.Byte>
clear
in interface java.util.Set<java.lang.Byte>
clear
in class java.util.AbstractCollection<java.lang.Byte>
public boolean isEmpty()
isEmpty
in interface java.util.Collection<java.lang.Byte>
isEmpty
in interface java.util.Set<java.lang.Byte>
isEmpty
in class AbstractByteCollection
public ByteArraySet 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