Package com.tangosol.util
Class SegmentedHashMap.EntrySet
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- java.util.AbstractSet
-
- com.tangosol.util.SegmentedHashMap.EntrySet
-
- All Implemented Interfaces:
Iterable,Collection,Set
- Enclosing class:
- SegmentedHashMap
protected class SegmentedHashMap.EntrySet extends AbstractSet
A set of entries backed by this map.
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description protected classSegmentedHashMap.EntrySet.EntrySetIteratorAn Iterator over the EntrySet that is backed by the SegmentedHashMap.
-
Constructor Summary
Constructors Modifier Constructor Description protectedEntrySet()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description voidclear()Removes all of the elements from this set of Keys by clearing the underlying Map.booleancontains(Object o)Returns true if this collection contains the specified element.protected IteratorinstantiateIterator()Factory for EntrySetIterator.Iteratoriterator()Returns an iterator over the elements contained in this collection.booleanremove(Object o)Removes the specified element from this Set of entries if it is present by removing the associated entry from the underlying Map.intsize()Returns the number of elements in this collection.Object[]toArray()Returns an array containing all of the elements in this collection.Object[]toArray(Object[] ao)Returns an array with a runtime type is that of the specified array and that contains all of the elements in this collection.-
Methods inherited from class java.util.AbstractSet
equals, hashCode, removeAll
-
Methods inherited from class java.util.AbstractCollection
add, addAll, containsAll, isEmpty, retainAll, toString
-
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface java.util.Collection
parallelStream, removeIf, stream, toArray
-
Methods inherited from interface java.util.Set
add, addAll, containsAll, isEmpty, retainAll, spliterator
-
-
-
-
Method Detail
-
iterator
public Iterator iterator()
Returns an iterator over the elements contained in this collection.- Specified by:
iteratorin interfaceCollection- Specified by:
iteratorin interfaceIterable- Specified by:
iteratorin interfaceSet- Specified by:
iteratorin classAbstractCollection- Returns:
- an iterator over the elements contained in this collection
-
size
public int size()
Returns the number of elements in this collection. If the collection contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.- Specified by:
sizein interfaceCollection- Specified by:
sizein interfaceSet- Specified by:
sizein classAbstractCollection- Returns:
- the number of elements in this collection
-
contains
public boolean contains(Object o)
Returns true if this collection contains the specified element. More formally, returns true if and only if this collection contains at least one element e such that (o==null ? e==null : o.equals(e)).- Specified by:
containsin interfaceCollection- Specified by:
containsin interfaceSet- Overrides:
containsin classAbstractCollection- Parameters:
o- object to be checked for containment in this collection- Returns:
- true if this collection contains the specified element
-
remove
public boolean remove(Object o)
Removes the specified element from this Set of entries if it is present by removing the associated entry from the underlying Map.- Specified by:
removein interfaceCollection- Specified by:
removein interfaceSet- Overrides:
removein classAbstractCollection- Parameters:
o- object to be removed from this set, if present- Returns:
- true if the set contained the specified element
-
clear
public void clear()
Removes all of the elements from this set of Keys by clearing the underlying Map.- Specified by:
clearin interfaceCollection- Specified by:
clearin interfaceSet- Overrides:
clearin classAbstractCollection
-
toArray
public Object[] toArray()
Returns an array containing all of the elements in this collection. If the collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order. The returned array will be "safe" in that no references to it are maintained by the collection. (In other words, this method must allocate a new array even if the collection is backed by an Array). The caller is thus free to modify the returned array.- Specified by:
toArrayin interfaceCollection- Specified by:
toArrayin interfaceSet- Overrides:
toArrayin classAbstractCollection- Returns:
- an array containing all of the elements in this collection
-
toArray
public Object[] toArray(Object[] ao)
Returns an array with a runtime type is that of the specified array and that contains all of the elements in this collection. If the collection fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this collection.If the collection fits in the specified array with room to spare (i.e., the array has more elements than the collection), the element in the array immediately following the end of the collection is set to null. This is useful in determining the length of the collection only if the caller knows that the collection does not contain any null elements.)
- Specified by:
toArrayin interfaceCollection- Specified by:
toArrayin interfaceSet- Overrides:
toArrayin classAbstractCollection- Parameters:
ao- the array into which the elements of the collection are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose- Returns:
- an array containing the elements of the collection
- Throws:
ArrayStoreException- if the runtime type of the specified array is not a supertype of the runtime type of every element in this collection
-
instantiateIterator
protected Iterator instantiateIterator()
Factory for EntrySetIterator.- Returns:
- a new instance of an Iterator over the EntrySet
-
-