public final class ArraySet<E> extends Object implements Collection<E>, Set<E>
HashSet. The design is very similar to
ArrayMap, with all of the caveats described there. This implementation is
separate from ArrayMap, however, so the Object array contains only one item for each
entry in the set (instead of a pair for a mapping).
Note that this implementation is not intended to be appropriate for data structures that may contain large numbers of items. It is generally slower than a traditional HashSet, since lookups require a binary search and adds and removes require inserting and deleting entries in the array. For containers holding up to hundreds of items, the performance difference is not significant, less than 50%.
Because this container is intended to better balance memory use, unlike most other standard Java containers it will shrink its array as items are removed from it. Currently you have no control over this shrinking -- if you set a capacity and then remove an item, it may reduce the capacity to better match the current size. In the future an explicit call to set the capacity should turn off this aggressive shrinking behavior.
| 构造器和说明 |
|---|
ArraySet()
Create a new empty ArraySet.
|
ArraySet(ArraySet<E> set)
Create a new ArraySet with the mappings from the given ArraySet.
|
ArraySet(Collection<? extends E> set)
Create a new ArraySet with items from the given collection.
|
ArraySet(int capacity)
Create a new ArraySet with a given initial capacity.
|
ArraySet(int capacity,
boolean identityHashCode) |
| 限定符和类型 | 方法和说明 |
|---|---|
boolean |
add(E value)
Adds the specified object to this set.
|
void |
addAll(ArraySet<? extends E> array)
Perform a
add(Object) of all values in array |
boolean |
addAll(Collection<? extends E> collection)
Perform an
add(Object) of all values in collection |
void |
append(E value)
Special fast path for appending items to the end of the array without validation.
|
void |
clear()
Make the array map empty.
|
boolean |
contains(Object key)
Check whether a value exists in the set.
|
boolean |
containsAll(Collection<?> collection)
Determine if the array set contains all of the values in the given collection.
|
void |
ensureCapacity(int minimumCapacity)
Ensure the array map can hold at least minimumCapacity
items.
|
boolean |
equals(Object object)
This implementation returns false if the object is not a set, or
if the sets have different sizes.
|
int |
hashCode() |
int |
indexOf(Object key)
Returns the index of a value in the set.
|
boolean |
isEmpty()
Return true if the array map contains no items.
|
Iterator<E> |
iterator()
Return an
Iterator over all values in the set. |
boolean |
remove(Object object)
Removes the specified object from this set.
|
boolean |
removeAll(ArraySet<? extends E> array)
Perform a
remove(Object) of all values in array |
boolean |
removeAll(Collection<?> collection)
Remove all values in the array set that exist in the given collection.
|
E |
removeAt(int index)
Remove the key/value mapping at the given index.
|
boolean |
removeIf(Predicate<? super E> filter)
Removes all values that satisfy the predicate.
|
boolean |
retainAll(Collection<?> collection)
Remove all values in the array set that do not exist in the given collection.
|
int |
size()
Return the number of items in this array map.
|
Object[] |
toArray() |
<T> T[] |
toArray(T[] array) |
String |
toString()
This implementation composes a string by iterating over its values.
|
E |
valueAt(int index)
Return the value at the given index in the array.
|
E |
valueAtUnchecked(int index)
Returns the value at the given index in the array without checking that the index is within
bounds.
|
spliteratorparallelStream, streampublic ArraySet()
public ArraySet(int capacity)
public ArraySet(int capacity,
boolean identityHashCode)
public ArraySet(ArraySet<E> set)
public ArraySet(Collection<? extends E> set)
public void clear()
public void ensureCapacity(int minimumCapacity)
public boolean contains(Object key)
public int indexOf(Object key)
key - The value to search for.public E valueAt(int index)
index - The desired index, must be between 0 and size()-1.public E valueAtUnchecked(int index)
public boolean isEmpty()
public boolean add(E value)
add 在接口中 Collection<E>add 在接口中 Set<E>value - the object to add.true if this set is modified, false otherwise.ClassCastException - when the class of the object is inappropriate for this set.public void append(E value)
public void addAll(ArraySet<? extends E> array)
add(Object) of all values in arrayarray - The array whose contents are to be retrieved.public boolean remove(Object object)
public E removeAt(int index)
index - The desired index, must be between 0 and size()-1.public boolean removeAll(ArraySet<? extends E> array)
remove(Object) of all values in arrayarray - The array whose contents are to be removed.public boolean removeIf(Predicate<? super E> filter)
iterator().removeIf 在接口中 Collection<E>filter - A predicate which returns true for elements to be removedpublic int size()
public boolean equals(Object object)
This implementation returns false if the object is not a set, or if the sets have different sizes. Otherwise, for each value in this set, it checks to make sure the value also exists in the other set. If any value doesn't exist, the method returns false; otherwise, it returns true.
public int hashCode()
public String toString()
This implementation composes a string by iterating over its values. If this set contains itself as a value, the string "(this Set)" will appear in its place.
public Iterator<E> iterator()
Iterator over all values in the set.
Note: this is a fairly inefficient way to access the array contents, it requires generating a number of temporary objects and allocates additional state information associated with the container that will remain for the life of the container.
public boolean containsAll(Collection<?> collection)
containsAll 在接口中 Collection<E>containsAll 在接口中 Set<E>collection - The collection whose contents are to be checked against.public boolean addAll(Collection<? extends E> collection)
add(Object) of all values in collectionpublic boolean removeAll(Collection<?> collection)
public boolean retainAll(Collection<?> collection)
Copyright © 2021. All rights reserved.