Top Description Methods
com.carrotsearch.hppc

public Interface IntLookupContainer

extends IntContainer
Known Direct Implementers
com.carrotsearch.hppc.IntObjectHashMap.KeysContainer, com.carrotsearch.hppc.IntShortHashMap.KeysContainer, com.carrotsearch.hppc.IntByteHashMap.KeysContainer, com.carrotsearch.hppc.IntCharHashMap.KeysContainer, com.carrotsearch.hppc.IntDoubleHashMap.KeysContainer, com.carrotsearch.hppc.SortedIterationIntByteHashMap.KeysContainer, com.carrotsearch.hppc.SortedIterationIntCharHashMap.KeysContainer, com.carrotsearch.hppc.SortedIterationIntDoubleHashMap.KeysContainer, com.carrotsearch.hppc.SortedIterationIntFloatHashMap.KeysContainer, com.carrotsearch.hppc.SortedIterationIntIntHashMap.KeysContainer, com.carrotsearch.hppc.SortedIterationIntLongHashMap.KeysContainer, com.carrotsearch.hppc.SortedIterationIntObjectHashMap.KeysContainer, com.carrotsearch.hppc.SortedIterationIntShortHashMap.KeysContainer, com.carrotsearch.hppc.IntFloatHashMap.KeysContainer, com.carrotsearch.hppc.IntHashSet, com.carrotsearch.hppc.IntIntHashMap.KeysContainer, com.carrotsearch.hppc.IntLongHashMap.KeysContainer
Annotations
@Generated:KTypeLookupContainer.java
date:2024-06-04T15:20:17+0200
Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).

Method Summary

Modifier and TypeMethod and Description
public boolean
contains(int e)

Redeclares com.carrotsearch.hppc.IntContainer.contains.

Lookup a given element in the container.

Inherited from com.carrotsearch.hppc.IntContainer:
forEachforEachisEmptyiteratorsizetoArray

Method Detail

containsback to summary
public boolean contains(int e)

Redeclares com.carrotsearch.hppc.IntContainer.contains.

Doc from com.carrotsearch.hppc.IntContainer.contains.

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:boolean

Returns true if this container has an element equal to e.