Package com.tangosol.util

Class SafeHashMap.EntrySet

java.lang.Object
java.util.AbstractCollection<Map.Entry<K,V>>
java.util.AbstractSet<Map.Entry<K,V>>
com.tangosol.util.SafeHashMap.EntrySet
All Implemented Interfaces:
Serializable, Iterable<Map.Entry<K,V>>, Collection<Map.Entry<K,V>>, Set<Map.Entry<K,V>>
Direct Known Subclasses:
LocalCache.EntrySet
Enclosing class:
SafeHashMap<K,V>
protected class SafeHashMap.EntrySet extends AbstractSet<Map.Entry<K,V>> implements Serializable
A set of entries backed by this map.
See Also:

  • Constructor Details

    • EntrySet

      protected EntrySet()

  • Method Details

    • iterator

      public Iterator<Map.Entry<K,V>> iterator()
      Returns an iterator over the elements contained in this collection.
      Specified by:
      iterator in interface Collection<Map.Entry<K,V>>
      Specified by:
      iterator in interface Iterable<Map.Entry<K,V>>
      Specified by:
      iterator in interface Set<Map.Entry<K,V>>
      Specified by:
      iterator in class AbstractCollection<Map.Entry<K,V>>
      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:
      size in interface Collection<Map.Entry<K,V>>
      Specified by:
      size in interface Set<Map.Entry<K,V>>
      Specified by:
      size in class AbstractCollection<Map.Entry<K,V>>
      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:
      contains in interface Collection<Map.Entry<K,V>>
      Specified by:
      contains in interface Set<Map.Entry<K,V>>
      Overrides:
      contains in class AbstractCollection<Map.Entry<K,V>>
      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:
      remove in interface Collection<Map.Entry<K,V>>
      Specified by:
      remove in interface Set<Map.Entry<K,V>>
      Overrides:
      remove in class AbstractCollection<Map.Entry<K,V>>
      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:
      clear in interface Collection<Map.Entry<K,V>>
      Specified by:
      clear in interface Set<Map.Entry<K,V>>
      Overrides:
      clear in class AbstractCollection<Map.Entry<K,V>>

    • 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:
      toArray in interface Collection<Map.Entry<K,V>>
      Specified by:
      toArray in interface Set<Map.Entry<K,V>>
      Overrides:
      toArray in class AbstractCollection<Map.Entry<K,V>>
      Returns:
      an array containing all of the elements in this collection

    • toArray

      public <T> T[] toArray(T[] a)
      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 there = in. 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:
      toArray in interface Collection<Map.Entry<K,V>>
      Specified by:
      toArray in interface Set<Map.Entry<K,V>>
      Overrides:
      toArray in class AbstractCollection<Map.Entry<K,V>>
      Parameters:
      a - 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 pattern.
      Returns:
      a new instance of an Iterator over the EntrySet