Uses of Interface
com.carrotsearch.hppc.DoubleContainer
Packages that use DoubleContainer
-
Uses of DoubleContainer in com.carrotsearch.hppc
Subinterfaces of DoubleContainer in com.carrotsearch.hppcModifier and TypeInterfaceDescriptioninterfaceA collection allows basic, efficient operations on sets of elements (difference and intersection).interfaceA linear collection that supports element insertion and removal at both ends.interfaceAn indexed container provides random access to elements based on anindex.interfaceMarker interface for containers that can check if they contain a given object in at least timeO(log n)and ideally in amortized constant timeO(1).interfaceA set ofdoubles.Classes in com.carrotsearch.hppc that implement DoubleContainerModifier and TypeClassDescription(package private) classCommon superclass for collections.private final classA view over the set of values of this map.private final classA view over the set of values of this map.classAn array-backedDoubleDeque.classAn array-backed list of doubles.final classA view of the keys inside this hash map.final classA view of the keys inside this hash map.final classA view of the keys inside this hash map.private final classA view over the set of values of this map.final classA view of the keys inside this hash map.classA hash set ofdoubles, implemented using using open addressing with linear probing for collision resolution.final classA view of the keys inside this hash map.final classA view of the keys inside this hash map.final classA view of the keys inside this hash map.classSame asDoubleHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.final classA view of the keys inside this hash map.classA subclass ofDoubleArrayListadding stack-related utility methods.private final classA view over the set of values of this map.private final classA view over the set of values of this map.private final classA view over the set of values of this map.private final classA view over the set of values of this map.private final classA view over the set of values of this map.Methods in com.carrotsearch.hppc that return DoubleContainerModifier and TypeMethodDescriptionByteDoubleAssociativeContainer.values()Returns a container view of all values present in this container.CharDoubleAssociativeContainer.values()Returns a container view of all values present in this container.DoubleDoubleAssociativeContainer.values()Returns a container view of all values present in this container.FloatDoubleAssociativeContainer.values()Returns a container view of all values present in this container.IntDoubleAssociativeContainer.values()Returns a container view of all values present in this container.LongDoubleAssociativeContainer.values()Returns a container view of all values present in this container.ObjectDoubleAssociativeContainer.values()Returns a container view of all values present in this container.ShortDoubleAssociativeContainer.values()Returns a container view of all values present in this container.Methods in com.carrotsearch.hppc with parameters of type DoubleContainerModifier and TypeMethodDescriptionintDoubleArrayList.addAll(DoubleContainer container) Adds all elements from another container.intDoubleHashSet.addAll(DoubleContainer container) Adds all elements from the givenDoubleContainerto this set.intDoubleArrayDeque.addFirst(DoubleContainer container) Inserts all elements from the given container to the front of this deque.intDoubleArrayDeque.addLast(DoubleContainer container) Inserts all elements from the given container to the end of this deque.intDoubleStack.pushAll(DoubleContainer container) Pushes all elements from another container to the top of the stack.intDoubleByteAssociativeContainer.removeAll(DoubleContainer container) Removes all keys (and associated values) present in a given container.intDoubleByteHashMap.removeAll(DoubleContainer other) Removes all keys (and associated values) present in a given container.intDoubleCharAssociativeContainer.removeAll(DoubleContainer container) Removes all keys (and associated values) present in a given container.intDoubleCharHashMap.removeAll(DoubleContainer other) Removes all keys (and associated values) present in a given container.intDoubleDoubleAssociativeContainer.removeAll(DoubleContainer container) Removes all keys (and associated values) present in a given container.intDoubleDoubleHashMap.removeAll(DoubleContainer other) Removes all keys (and associated values) present in a given container.intDoubleFloatAssociativeContainer.removeAll(DoubleContainer container) Removes all keys (and associated values) present in a given container.intDoubleFloatHashMap.removeAll(DoubleContainer other) Removes all keys (and associated values) present in a given container.intDoubleIntAssociativeContainer.removeAll(DoubleContainer container) Removes all keys (and associated values) present in a given container.intDoubleIntHashMap.removeAll(DoubleContainer other) Removes all keys (and associated values) present in a given container.intDoubleLongAssociativeContainer.removeAll(DoubleContainer container) Removes all keys (and associated values) present in a given container.intDoubleLongHashMap.removeAll(DoubleContainer other) Removes all keys (and associated values) present in a given container.intDoubleObjectAssociativeContainer.removeAll(DoubleContainer container) Removes all keys (and associated values) present in a given container.intDoubleObjectHashMap.removeAll(DoubleContainer other) Removes all keys (and associated values) present in a given container.intDoubleShortAssociativeContainer.removeAll(DoubleContainer container) Removes all keys (and associated values) present in a given container.intDoubleShortHashMap.removeAll(DoubleContainer other) Removes all keys (and associated values) present in a given container.Constructors in com.carrotsearch.hppc with parameters of type DoubleContainerModifierConstructorDescriptionDoubleArrayDeque(DoubleContainer container) Creates a new deque from elements of another container, appending elements at the end of the deque in the iteration order.DoubleArrayList(DoubleContainer container) Creates a new list from the elements of another container in its iteration order.DoubleHashSet(DoubleContainer container) New instance copying elements from anotherDoubleContainer.DoubleStack(DoubleContainer container) Create a stack by pushing all elements of another container to it.