public class CharArraySet extends AbstractCharSet 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 |
|---|
CharArraySet()
Creates a new empty array set.
|
CharArraySet(char[] a)
Creates a new array set using the given backing array.
|
CharArraySet(char[] a,
int size)
Creates a new array set using the given backing array and the given number of elements of the array.
|
CharArraySet(CharCollection c)
Creates a new array set copying the contents of a given collection.
|
CharArraySet(Collection<? extends Character> c)
Creates a new array set copying the contents of a given set.
|
CharArraySet(int capacity)
Creates a new empty array set of given initial capacity.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(char k) |
void |
clear() |
CharArraySet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(char k) |
boolean |
isEmpty() |
CharIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
boolean |
remove(char k)
Removes an element from this set.
|
int |
size() |
equals, hashCode, rem, removeadd, addAll, addAll, charIterator, contains, containsAll, containsAll, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toCharArray, toCharArray, toStringaddAll, charIterator, containsAll, removeAll, retainAll, toArray, toArray, toCharArray, toCharArrayadd, addAll, contains, containsAll, removeAll, retainAll, spliterator, toArray, toArrayparallelStream, removeIf, streampublic CharArraySet(char[] a)
It is responsibility of the caller that the elements of a are distinct.
a - the backing array.public CharArraySet()
public CharArraySet(int capacity)
capacity - the initial capacity.public CharArraySet(CharCollection c)
c - a collection.public CharArraySet(Collection<? extends Character> c)
c - a collection.public CharArraySet(char[] 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 CharIterator iterator()
CharCollectionNote 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 CharCollectioniterator in interface CharIterableiterator in interface CharSetiterator in interface Iterable<Character>iterator in interface Collection<Character>iterator in interface Set<Character>iterator in class AbstractCharSetpublic boolean contains(char k)
contains in interface CharCollectioncontains in class AbstractCharCollectionCollection.contains(Object)public int size()
size in interface Collection<Character>size in interface Set<Character>size in class AbstractCollection<Character>public boolean remove(char k)
CharSetNote 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 CharSetremove in class AbstractCharSetCollection.remove(Object)public boolean add(char k)
add in interface CharCollectionadd in class AbstractCharCollectionCollection.add(Object)public void clear()
clear in interface Collection<Character>clear in interface Set<Character>clear in class AbstractCollection<Character>public boolean isEmpty()
isEmpty in interface Collection<Character>isEmpty in interface Set<Character>isEmpty in class AbstractCharCollectionpublic CharArraySet 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.