Class DoubleFloatHashMap.ValuesContainer

java.lang.Object
com.carrotsearch.hppc.AbstractFloatCollection
com.carrotsearch.hppc.DoubleFloatHashMap.ValuesContainer
All Implemented Interfaces:
FloatCollection, FloatContainer, Iterable<FloatCursor>
Enclosing class:
DoubleFloatHashMap

private final class DoubleFloatHashMap.ValuesContainer extends AbstractFloatCollection
A view over the set of values of this map.
  • Field Details

  • Constructor Details

    • ValuesContainer

      private ValuesContainer()
  • Method Details

    • size

      public int size()
      Description copied from interface: FloatContainer
      Return the current number of elements in this container. The time for calculating the container's size may take O(n) time, although implementing classes should try to maintain the current size and return in constant time.
    • isEmpty

      public boolean isEmpty()
      Description copied from interface: FloatContainer
      Shortcut for size() == 0.
    • contains

      public boolean contains(float value)
      Description copied from interface: FloatContainer
      Lookup a given element in the container. This operation has no speed guarantees (may be linear with respect to the size of this container).
      Returns:
      Returns true if this container has an element equal to e.
    • forEach

      public <T extends FloatProcedure> T forEach(T procedure)
      Description copied from interface: FloatContainer
      Applies a procedure to all container elements. Returns the argument (any subclass of FloatProcedure. This lets the caller to call methods of the argument by chaining the call (even if the argument is an anonymous type) to retrieve computed values, for example (IntContainer):
       int count = container.forEach(new IntProcedure() {
         int count; // this is a field declaration in an anonymous class.
       
         public void apply(int value) {
           count++;
         }
       }).count;
       
    • forEach

      public <T extends FloatPredicate> T forEach(T predicate)
      Description copied from interface: FloatContainer
      Applies a predicate to container elements as long, as the predicate returns true. The iteration is interrupted otherwise.
    • iterator

      public Iterator<FloatCursor> iterator()
      Description copied from interface: FloatContainer
      Returns an iterator to a cursor traversing the collection. The order of traversal is not defined. More than one cursor may be active at a time. The behavior of iterators is undefined if structural changes are made to the underlying collection.

      The iterator is implemented as a cursor and it returns the same cursor instance on every call to Iterator.next() (to avoid boxing of primitive types). To read the current list's value (or index in the list) use the cursor's public fields. An example is shown below.

       for (FloatCursor<float> c : container) {
         System.out.println("index=" + c.index + " value=" + c.value);
       }
       
    • removeAll

      public int removeAll(float e)
      Description copied from interface: FloatCollection
      Removes all occurrences of e from this collection.
      Parameters:
      e - Element to be removed from this collection, if present.
      Returns:
      The number of removed elements as a result of this call.
    • removeAll

      public int removeAll(FloatPredicate predicate)
      Description copied from interface: FloatCollection
      Removes all elements in this collection for which the given predicate returns true.
      Returns:
      Returns the number of removed elements.
    • clear

      public void clear()
      Description copied from interface: FloatCollection
      Removes all elements from this collection.
      See Also:
    • release

      public void release()
      Description copied from interface: FloatCollection
      Removes all elements from the collection and additionally releases any internal buffers. Typically, if the object is to be reused, a simple FloatCollection.clear() should be a better alternative since it'll avoid reallocation.
      See Also: