Uses of Interface
com.carrotsearch.hppc.KTypeContainer

Packages that use KTypeContainer
com.carrotsearch.hppc High Performance Primitive Collections (HPPC) library provides typical data structures (lists, stacks, maps) template-generated for all Java primitive types (byte, int, etc.) to conserve memory and boost performance. 
 

Uses of KTypeContainer in com.carrotsearch.hppc
 

Subinterfaces of KTypeContainer in com.carrotsearch.hppc
 interface KTypeCollection<KType>
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
 interface KTypeDeque<KType>
          A double-linked queue of KTypes.
 interface KTypeIndexedContainer<KType>
          An indexed container provides random access to elements based on an index.
 interface KTypeLookupContainer<KType>
          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).
 interface KTypeSet<KType>
          A set of KTypes.
 

Classes in com.carrotsearch.hppc that implement KTypeContainer
 class KTypeArrayDeque<KType>
          An array-backed deque (doubly linked queue) of KTypes.
 class KTypeArrayList<KType>
          An array-backed list of KTypes.
 class KTypeOpenHashSet<KType>
          A hash set of KTypes, implemented using using open addressing with linear probing for collision resolution.
 class KTypeStack<KType>
          An extension to ObjectArrayList adding stack-related utility methods.
 class KTypeVTypeOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
 

Methods in com.carrotsearch.hppc that return KTypeContainer
 KTypeContainer<VType> KTypeVTypeOpenHashMap.values()
           
 KTypeContainer<VType> KTypeVTypeAssociativeContainer.values()
          Returns a container view of all values present in this container.
 

Methods in com.carrotsearch.hppc with parameters of type KTypeContainer
 int KTypeOpenHashSet.addAll(KTypeContainer<? extends KType> container)
          Adds all elements from a given container to this set.
 int KTypeArrayList.addAll(KTypeContainer<? extends KType> container)
          Adds all elements from another container.
 int KTypeArrayDeque.addFirst(KTypeContainer<? extends KType> container)
          Inserts all elements from the given container to the front of this deque.
 int KTypeArrayDeque.addLast(KTypeContainer<? extends KType> container)
          Inserts all elements from the given container to the end of this deque.
static
<KType> KTypeStack<KType>
KTypeStack.from(KTypeContainer<KType> container)
          Create a stack by pushing all elements of another container to it.
static
<KType> KTypeOpenHashSet<KType>
KTypeOpenHashSet.from(KTypeContainer<KType> container)
          Create a set from elements of another container.
static
<KType> KTypeArrayList<KType>
KTypeArrayList.from(KTypeContainer<KType> container)
          Create a list from elements of another container.
 int KTypeStack.pushAll(KTypeContainer<? extends KType> container)
          Pushes all elements from another container to the top of the stack.
 int KTypeVTypeOpenHashMap.removeAll(KTypeContainer<? extends KType> container)
          Removes all keys (and associated values) present in a given container.
 int KTypeVTypeAssociativeContainer.removeAll(KTypeContainer<? extends KType> container)
          Removes all keys (and associated values) present in a given container.
 

Constructors in com.carrotsearch.hppc with parameters of type KTypeContainer
KTypeArrayDeque(KTypeContainer<? extends KType> container)
          Creates a new deque from elements of another container, appending them at the end of this deque.
KTypeArrayList(KTypeContainer<? extends KType> container)
          Creates a new list from elements of another container.
KTypeOpenHashSet(KTypeContainer<KType> container)
          Creates a hash set from elements of another container.
KTypeStack(KTypeContainer<KType> container)
          Create a stack by pushing all elements of another container to it.
 



Copyright © 2011 Carrot Search s.c.. All Rights Reserved.