com.carrotsearch.hppc

Interface ShortContainer

All Superinterfaces:

java.lang.Iterable<ShortCursor>

All Known Subinterfaces:

ShortCollection, ShortDeque, ShortIndexedContainer, ShortLookupContainer, ShortSet

All Known Implementing Classes:

AbstractShortCollection, ByteShortHashMap.ValuesContainer, CharShortHashMap.ValuesContainer, DoubleShortHashMap.ValuesContainer, FloatShortHashMap.ValuesContainer, IntShortHashMap.ValuesContainer, LongShortHashMap.ValuesContainer, ObjectShortHashMap.ValuesContainer, ShortArrayDeque, ShortArrayList, ShortByteHashMap.KeysContainer, ShortCharHashMap.KeysContainer, ShortDoubleHashMap.KeysContainer, ShortFloatHashMap.KeysContainer, ShortHashSet, ShortIntHashMap.KeysContainer, ShortLongHashMap.KeysContainer, ShortObjectHashMap.KeysContainer, ShortScatterSet, ShortShortHashMap.KeysContainer, ShortShortHashMap.ValuesContainer, ShortStack

@Generated(date="2023-04-24T17:14:46+0800",
           value="KTypeContainer.java")
public interface ShortContainer
extends java.lang.Iterable<ShortCursor>

A generic container holding shorts.

Method Summary

Modifier and Type	Method and Description
boolean	contains(short e) Lookup a given element in the container.
<T extends ShortPredicate> T	forEach(T predicate) Applies a predicate to container elements as long, as the predicate returns true.
<T extends ShortProcedure> T	forEach(T procedure) Applies a procedure to all container elements.
boolean	isEmpty() Shortcut for size() == 0.
java.util.Iterator<ShortCursor>	iterator() Returns an iterator to a cursor traversing the collection.
int	size() Return the current number of elements in this container.
short[]	toArray() Copies all elements of this container to an array.

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Method Detail

iterator

java.util.Iterator<ShortCursor> iterator()

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 (ShortCursor<short> c : container) {
   System.out.println("index=" + c.index + " value=" + c.value);
 }
 

Specified by:

iterator in interface java.lang.Iterable<ShortCursor>

contains

boolean contains(short e)

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.

size

int size()

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

boolean isEmpty()

Shortcut for size() == 0.

toArray

short[] toArray()

Copies all elements of this container to an array. The returned array is always a copy, regardless of the storage used by the container.

forEach

<T extends ShortProcedure> T forEach(T procedure)

Applies a procedure to all container elements. Returns the argument (any subclass of ShortProcedure. 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

<T extends ShortPredicate> T forEach(T predicate)

Applies a predicate to container elements as long, as the predicate returns true. The iteration is interrupted otherwise.