Package extra166y
Class CustomConcurrentHashMap.KeySet<K>
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- java.util.AbstractSet<K>
-
- extra166y.CustomConcurrentHashMap.KeySet<K>
-
- All Implemented Interfaces:
java.io.Serializable
,java.lang.Iterable<K>
,java.util.Collection<K>
,java.util.Set<K>
- Enclosing class:
- CustomConcurrentHashMap<K,V>
public static class CustomConcurrentHashMap.KeySet<K> extends java.util.AbstractSet<K> implements java.util.Set<K>, java.io.Serializable
A hash-based set with properties identical to those ofCollections.newSetFromMap
applied to aCustomConcurrentHashMap
, but possibly more space-efficient. The set does not permit null elements. The set is serializable; however, serializing a set that uses soft or weak references can give unpredictable results.- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description KeySet(CustomConcurrentHashMap.Strength strength, CustomConcurrentHashMap.Equivalence<? super K> equivalence, int expectedSize)
Creates a set with the given parameters
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
add(K e)
Adds the specified element to this set if there is not already an element equivalent to the given element with respect to this set's Equivalence.void
clear()
Removes all of the elements from this set.boolean
contains(java.lang.Object o)
Returns true if this set contains an element equivalent to the given element with respect to this set's Equivalence.int
hashCode()
Returns the sum of the hash codes of each element, as computed by this set's Equivalence.K
intern(K e)
Returns an element equivalent to the given element with respect to this set's Equivalence, if such an element exists, else adds and returns the given element.boolean
isEmpty()
Returns true if this set contains no elements.java.util.Iterator<K>
iterator()
Returns a weakly consistent iterator over the elements in this set, that may reflect some, all or none of the changes made to the set after the iterator was created.boolean
remove(java.lang.Object o)
Removes an element equivalent to the given element with respect to this set's Equivalence, if one is present.int
size()
Returns the number of elements in this set (its cardinality).-
Methods inherited from class java.util.AbstractCollection
addAll, containsAll, retainAll, toArray, toArray, toString
-
-
-
-
Constructor Detail
-
KeySet
public KeySet(CustomConcurrentHashMap.Strength strength, CustomConcurrentHashMap.Equivalence<? super K> equivalence, int expectedSize)
Creates a set with the given parameters- Parameters:
strength
- the strength of elementsequivalence
- the Equivalence to useexpectedSize
- an estimate of the number of elements that will be held in the set. If no estimate is known, zero is an acceptable value.
-
-
Method Detail
-
intern
public K intern(K e)
Returns an element equivalent to the given element with respect to this set's Equivalence, if such an element exists, else adds and returns the given element.- Parameters:
e
- the element- Returns:
- e, or an element equivalent to e.
-
contains
public boolean contains(java.lang.Object o)
Returns true if this set contains an element equivalent to the given element with respect to this set's Equivalence.
-
iterator
public java.util.Iterator<K> iterator()
Returns a weakly consistent iterator over the elements in this set, that may reflect some, all or none of the changes made to the set after the iterator was created.
-
add
public boolean add(K e)
Adds the specified element to this set if there is not already an element equivalent to the given element with respect to this set's Equivalence.
-
remove
public boolean remove(java.lang.Object o)
Removes an element equivalent to the given element with respect to this set's Equivalence, if one is present.
-
isEmpty
public boolean isEmpty()
Returns true if this set contains no elements.
-
size
public int size()
Returns the number of elements in this set (its cardinality).
-
clear
public void clear()
Removes all of the elements from this set.
-
hashCode
public int hashCode()
Returns the sum of the hash codes of each element, as computed by this set's Equivalence.
-
-