java.lang.Object

one.microstream.collections.AbstractExtendedCollection<E>

one.microstream.collections.AbstractChainCollection<KeyValue<K,V>,K,V,EN>

one.microstream.collections.AbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V>>

one.microstream.collections.EqConstHashTable<K,V>

All Implemented Interfaces:: Iterable<KeyValue<K,V>>, CapacityCarrying, ExtendedCollection<KeyValue<K,V>>, ExtendedMap<K,V>, ExtendedSequence<KeyValue<K,V>>, HashCollection<K>, Sized, XGettingCollection<KeyValue<K,V>>, XGettingEnum<KeyValue<K,V>>, XGettingMap<K,V>, XGettingSequence<KeyValue<K,V>>, XGettingSet<KeyValue<K,V>>, XGettingTable<K,V>, XImmutableCollection<KeyValue<K,V>>, XImmutableEnum<KeyValue<K,V>>, XImmutableMap<K,V>, XImmutableSequence<KeyValue<K,V>>, XImmutableSet<KeyValue<K,V>>, XImmutableTable<K,V>, XIndexIterable<KeyValue<K,V>>, XIterable<KeyValue<K,V>>, XJoinable<KeyValue<K,V>>, ThreadSafe, HashImmutable, Composition, Copyable, Immutable

public final class EqConstHashTable<K,V>
extends AbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V>>
implements XImmutableTable<K,V>, HashCollection<K>, Composition

Nested Class Summary

Nested Classes
Modifier and Type	Class	Description
`static interface`	`EqConstHashTable.Creator<K,V>`
`class`	`EqConstHashTable.Keys`
`class`	`EqConstHashTable.OldVarMap`
`class`	`EqConstHashTable.Values`

Nested classes/interfaces inherited from interface one.microstream.typing.Copyable

Copyable.Static

Nested classes/interfaces inherited from interface one.microstream.collections.interfaces.HashCollection

HashCollection.Analysis<H>

Nested classes/interfaces inherited from interface one.microstream.collections.types.XGettingSequence

XGettingSequence.Factory<E>

Nested classes/interfaces inherited from interface one.microstream.collections.types.XImmutableEnum

XImmutableEnum.Factory<E>

Nested classes/interfaces inherited from interface one.microstream.collections.types.XImmutableSet

XImmutableSet.Factory<E>

Nested classes/interfaces inherited from interface one.microstream.collections.types.XImmutableTable

XImmutableTable.Bridge<K,V>, XImmutableTable.EntriesBridge<K,V>, XImmutableTable.Satellite<K,V>

Nested classes/interfaces inherited from interface one.microstream.collections.types.XIterable

XIterable.Executor<E>

Field Summary

Fields inherited from interface one.microstream.collections.interfaces.HashCollection
DEFAULT_HASH_FACTOR, DEFAULT_HASH_LENGTH
Constructor Summary

Constructors

Constructor Description

EqConstHashTable()

Method Summary

Modifier and Type	Method	Description
`HashCollection.Analysis<EqConstHashTable<K,V>>`	`analyze()`
`boolean`	`applies(Predicate<? super KeyValue<K,V>> predicate)`
`KeyValue<K,V>`	`at(long index)`
`boolean`	`contains(KeyValue<K,V> entry)`
`boolean`	`containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)`
`boolean`	`containsId(KeyValue<K,V> entry)`	Special version of contains() that guarantees to use identity comparison (" == ") when searching for the given element regardless of the collection's internal logic. This method has the same behavior as `XGettingCollection.containsSearched(Predicate)` with a `Predicate` implementation that checks for object identity.
`boolean`	`containsSearched(Predicate<? super KeyValue<K,V>> predicate)`
`EqConstHashTable<K,V>`	`copy()`	Creates a true copy of this collection which references the same elements as this collection does at the time the method is called.
`<T extends Consumer<? super KeyValue<K, V>>> T`	`copySelection(T target, long... indices)`
`<C extends Consumer<? super KeyValue<K, V>>> C`	`copyTo(C target)`
`long`	`count(KeyValue<K,V> entry)`
`long`	`countBy(Predicate<? super KeyValue<K,V>> predicate)`
`<C extends Consumer<? super KeyValue<K, V>>> C`	`distinct(C target)`
`<C extends Consumer<? super KeyValue<K, V>>> C`	`distinct(C target, Equalator<? super KeyValue<K,V>> equalator)`
`HashEqualator<KeyValue<K,V>>`	`equality()`
`boolean`	`equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)`	Returns `true` if the passed collection is of the same type as this collection and`this.equalsContent(list, equalator)` yields `true`.
`boolean`	`equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)`	Returns `true` if all elements of this list and the passed list are sequentially equal as defined by the passed equalator.
`<C extends Consumer<? super KeyValue<K, V>>> C`	`except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)`
`<C extends Consumer<? super KeyValue<K, V>>> C`	`filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)`
`KeyValue<K,V>`	`first()`
`KeyValue<K,V>`	`get()`	Gets one element from the collection.
`V`	`get(K key)`
`float`	`hashDensity()`
`int`	`hashDistributionRange()`
`HashEqualator<? super K>`	`hashEquality()`
`boolean`	`hasVolatileElements()`	Tells if this collection contains volatile elements. An element is volatile, if it can become no longer reachable by the collection without being removed from the collection.
`boolean`	`hasVolatileHashElements()`
`EqConstHashTable<K,V>`	`immure()`	Provides an instance of an immutable collection type with equal behavior and data as this instance.
`long`	`indexBy(Predicate<? super KeyValue<K,V>> predicate)`
`long`	`indexOf(KeyValue<K,V> entry)`
`<C extends Consumer<? super KeyValue<K, V>>> C`	`intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)`
`boolean`	`isEmpty()`
`boolean`	`isFull()`	Returns true if the current capacity cannot be increased any more.
`boolean`	`isSorted(Comparator<? super KeyValue<K,V>> comparator)`
`<P extends Consumer<? super KeyValue<K, V>>> P`	`iterate(P procedure)`
`<P extends IndexedAcceptor<? super KeyValue<K, V>>> P`	`iterateIndexed(P procedure)`
`Iterator<KeyValue<K,V>>`	`iterator()`
`<A> A`	`join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)`
`EqConstHashTable.Keys`	`keys()`
`KeyValue<K,V>`	`last()`
`long`	`lastIndexBy(Predicate<? super KeyValue<K,V>> predicate)`
`long`	`lastIndexOf(KeyValue<K,V> entry)`
`KeyValue<K,V>`	`lookup(K key)`
`KeyValue<K,V>`	`max(Comparator<? super KeyValue<K,V>> comparator)`
`long`	`maximumCapacity()`	Returns the maximum amount of elements this carrier instance can contain. The actual value may be depend on the configuration of the concrete instance or may depend only on the implementation of the carrier (meaning it is constant for all instances of the implementation, e.g.
`long`	`maxIndex(Comparator<? super KeyValue<K,V>> comparator)`
`KeyValue<K,V>`	`min(Comparator<? super KeyValue<K,V>> comparator)`
`long`	`minIndex(Comparator<? super KeyValue<K,V>> comparator)`
`static <K, V> EqConstHashTable<K,V>`	`New()`
`static <K, V> EqConstHashTable<K,V>`	`New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)`
`static <V0, K, V> EqConstHashTable<K,V>`	`New(XGettingCollection<? extends KeyValue<? extends K,? extends V0>> entries, Function<? super V0,V> mapper)`
`static <K, V> EqConstHashTable<K,V>`	`New(HashEqualator<? super K> hashEqualator)`
`static <K, V> EqConstHashTable<K,V>`	`New(HashEqualator<? super K> hashEqualator, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)`
`static <K, V> EqConstHashTable<K,V>`	`New(HashEqualator<? super K> hashEqualator, KeyValue<? extends K,? extends V>... entries)`
`static <K, V> EqConstHashTable<K,V>`	`New(KeyValue<? extends K,? extends V>... entries)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(float hashDensity)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(int initialHashLength)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(int initialHashLength, float hashDensity)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(int initialHashLength, float hashDensity, KeyValue<? extends K,? extends V>... entries)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(HashEqualator<? super K> hashEqualator, float hashDensity)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)`
`static <K, V> EqConstHashTable<K,V>`	`NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity, KeyValue<? extends K,? extends V>... entries)`
`static <K, V, K1, V1> EqConstHashTable<K1,V1>`	`NewProjected(float hashDensity, XGettingCollection<? extends KeyValue<K,V>> entries, Function<? super K,K1> keyProjector, Function<? super V,V1> valueProjector)`
`static <K, V, K1, V1> EqConstHashTable<K1,V1>`	`NewProjected(XGettingCollection<? extends KeyValue<K,V>> entries, Function<? super K,K1> keyProjector, Function<? super V,V1> valueProjector)`
`static <K, V> EqConstHashTable<K,V>`	`NewSingle(K key, V value)`
`boolean`	`nullAllowed()`
`boolean`	`nullContained()`
`boolean`	`nullKeyAllowed()`
`boolean`	`nullValuesAllowed()`
`XImmutableTable.EntriesBridge<K,V>`	`old()`
`XImmutableTable.Bridge<K,V>`	`oldMap()`
`KeyValue<K,V>`	`peek()`
`KeyValue<K,V>`	`poll()`
`Predicate<KeyValue<K,V>>`	`predicateContainsEntry()`
`Predicate<K>`	`predicateContainsKey()`
`<C extends Consumer<? super V>> C`	`query(XIterable<? extends K> keys, C collector)`
`XEnum<KeyValue<K,V>>`	`range(long lowIndex, long highIndex)`
`int`	`rehash()`	Recalculates the hash value of all entries and reorginazes and optimizes the hash storage accordingly.
`long`	`remainingCapacity()`	Returns the amount of elements this carrier instance can collect before reaching its maximimum capacity.
`long`	`scan(Predicate<? super KeyValue<K,V>> predicate)`	Iterates through the collection and returns the index of the last element that the passed `Predicate`applied to ("scanning").
`KeyValue<K,V>`	`search(Predicate<? super KeyValue<K,V>> predicate)`
`V`	`searchValue(Predicate<? super K> keyPredicate)`
`KeyValue<K,V>`	`seek(KeyValue<K,V> sample)`	Returns the first contained element matching the passed sample as defined by the collection's equality logic or null, if no fitting element is contained.
`void`	`setHashDensity(float hashDensity)`	Sets the hash density (1/density) of this hashing collection if applicable.
`long`	`size()`
`Object[]`	`toArray()`
`KeyValue<K,V>[]`	`toArray(Class<KeyValue<K,V>> type)`
`EqConstHashTable<K,V>`	`toReversed()`
`String`	`toString()`
`<C extends Consumer<? super KeyValue<K, V>>> C`	`union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)`
`EqConstHashTable.Values`	`values()`
`XGettingTable<K,V>`	`view()`
`XGettingEnum<KeyValue<K,V>>`	`view(long lowIndex, long highIndex)`

Methods inherited from class one.microstream.collections.AbstractExtendedCollection

ensureFreeArrayCapacity, validateIndex

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface one.microstream.hashing.HashImmutable

equals, hashCode

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface one.microstream.collections.types.XGettingCollection

equals, hashCode, intSize

Methods inherited from interface one.microstream.collections.types.XGettingSequence

hasIndex

Constructor Details
- EqConstHashTable
  
  public EqConstHashTable()
Method Details
- New
  
  public static final <K, V> EqConstHashTable<K,V> New()
- NewCustom
  
  public static final <K, V> EqConstHashTable<K,V> NewCustom(int initialHashLength)
- NewCustom
  
  public static final <K, V> EqConstHashTable<K,V> NewCustom(float hashDensity)
- NewCustom
  
  public static final <K, V> EqConstHashTable<K,V> NewCustom(int initialHashLength, float hashDensity)
- New
  
  public static final <K, V> EqConstHashTable<K,V> New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
- New
  
  public static final <V0, K, V> EqConstHashTable<K,V> New(XGettingCollection<? extends KeyValue<? extends K,? extends V0>> entries, Function<? super V0,V> mapper)
- NewCustom
  
  public static final <K, V> EqConstHashTable<K,V> NewCustom(int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
- NewSingle
  
  public static final <K, V> EqConstHashTable<K,V> NewSingle(K key, V value)
- New
  
  @SafeVarargs public static final <K, V> EqConstHashTable<K,V> New(KeyValue<? extends K,? extends V>... entries)
- NewCustom
  
  @SafeVarargs public static final <K, V> EqConstHashTable<K,V> NewCustom(int initialHashLength, float hashDensity, KeyValue<? extends K,? extends V>... entries)
- New
  
  public static final <K, V> EqConstHashTable<K,V> New(HashEqualator<? super K> hashEqualator)
- NewCustom
  
  public static final <K, V> EqConstHashTable<K,V> NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength)
- NewCustom
  
  public static final <K, V> EqConstHashTable<K,V> NewCustom(HashEqualator<? super K> hashEqualator, float hashDensity)
- NewCustom
  
  public static final <K, V> EqConstHashTable<K,V> NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity)
- New
  
  public static final <K, V> EqConstHashTable<K,V> New(HashEqualator<? super K> hashEqualator, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
- NewCustom
  
  public static final <K, V> EqConstHashTable<K,V> NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
- New
  
  @SafeVarargs public static final <K, V> EqConstHashTable<K,V> New(HashEqualator<? super K> hashEqualator, KeyValue<? extends K,? extends V>... entries)
- NewCustom
  
  @SafeVarargs public static final <K, V> EqConstHashTable<K,V> NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity, KeyValue<? extends K,? extends V>... entries)
- NewProjected
  
  public static final <K, V, K1, V1> EqConstHashTable<K1,V1> NewProjected(float hashDensity, XGettingCollection<? extends KeyValue<K,V>> entries, Function<? super K,K1> keyProjector, Function<? super V,V1> valueProjector)
- NewProjected
  
  public static final <K, V, K1, V1> EqConstHashTable<K1,V1> NewProjected(XGettingCollection<? extends KeyValue<K,V>> entries, Function<? super K,K1> keyProjector, Function<? super V,V1> valueProjector)
- lookup
  
  public final KeyValue<K,V> lookup(K key)
  
  Specified by:
  
  lookup in interface XGettingMap<K,V>
- rehash
  
  public final int rehash()
  
  Description copied from interface: HashCollection
  
  Recalculates the hash value of all entries and reorginazes and optimizes the hash storage accordingly. This method is meant for cases where a hash collection has to collect its elements before proper hash values can be derived for them or where hash mutable elements can change their hash-relevant state after having been added (and hashed) in a hash collection. Note that depending on the hash-relevant state of elements and their changing of it, it can be possible that some elements oust others, thus decreasing the collection's size. This behavior depends on the type of the elements and the used hash logic and cannot be compensated by a general purpose collection implementation.
  
  Specified by:
  
  rehash in interface HashCollection<K>
  
  Returns:
  
  the new size of the collection which might be lower than before the call.
- size
  
  public final long size()
  
  Specified by:
  
  size in interface HashCollection<K>
  
  Specified by:
  
  size in interface Sized
  
  Specified by:
  
  size in interface XGettingCollection<K>
- isEmpty
  
  public final boolean isEmpty()
  
  Specified by:
  
  isEmpty in interface Sized
- copy
  
  public final EqConstHashTable<K,V> copy()
  
  Description copied from interface: XGettingCollection
  
  Creates a true copy of this collection which references the same elements as this collection does at the time the method is called. The elements themselves are NOT copied (no deep copying).
  The type of the returned set is the same as of this list if possible.
  
  Specified by:
  
  copy in interface Copyable
  
  Specified by:
  
  copy in interface XGettingCollection<K>
  
  Specified by:
  
  copy in interface XGettingEnum<K>
  
  Specified by:
  
  copy in interface XGettingMap<K,V>
  
  Specified by:
  
  copy in interface XGettingSequence<K>
  
  Specified by:
  
  copy in interface XGettingSet<K>
  
  Specified by:
  
  copy in interface XGettingTable<K,V>
  
  Specified by:
  
  copy in interface XImmutableCollection<K>
  
  Specified by:
  
  copy in interface XImmutableEnum<K>
  
  Specified by:
  
  copy in interface XImmutableMap<K,V>
  
  Specified by:
  
  copy in interface XImmutableSequence<K>
  
  Specified by:
  
  copy in interface XImmutableSet<K>
  
  Specified by:
  
  copy in interface XImmutableTable<K,V>
  
  Returns:
  
  a copy of this list
- immure
  
  public final EqConstHashTable<K,V> immure()
  
  Description copied from interface: XImmutableTable
  
  Provides an instance of an immutable collection type with equal behavior and data as this instance.
  If this instance already is of an immutable collection type, it returns itself.
  
  Specified by:
  
  immure in interface XGettingCollection<K>
  
  Specified by:
  
  immure in interface XGettingEnum<K>
  
  Specified by:
  
  immure in interface XGettingMap<K,V>
  
  Specified by:
  
  immure in interface XGettingSequence<K>
  
  Specified by:
  
  immure in interface XGettingSet<K>
  
  Specified by:
  
  immure in interface XGettingTable<K,V>
  
  Specified by:
  
  immure in interface XImmutableCollection<K>
  
  Specified by:
  
  immure in interface XImmutableEnum<K>
  
  Specified by:
  
  immure in interface XImmutableMap<K,V>
  
  Specified by:
  
  immure in interface XImmutableSequence<K>
  
  Specified by:
  
  immure in interface XImmutableSet<K>
  
  Specified by:
  
  immure in interface XImmutableTable<K,V>
  
  Returns:
  
  an immutable copy of this collection instance.
  
  See Also:
  
  XImmutableCollection.copy()
- view
  
  public final XGettingTable<K,V> view()
  
  Specified by:
  
  view in interface XGettingCollection<K>
  
  Specified by:
  
  view in interface XGettingEnum<K>
  
  Specified by:
  
  view in interface XGettingMap<K,V>
  
  Specified by:
  
  view in interface XGettingSequence<K>
  
  Specified by:
  
  view in interface XGettingTable<K,V>
- setHashDensity
  
  public final void setHashDensity(float hashDensity)
  
  Description copied from interface: HashCollection
  
  Sets the hash density (1/density) of this hashing collection if applicable.
  If this procedure is not applicable for the hash collection (e.g. an immutable hash collection), calling this method has no effect.
  
  Specified by:
  
  setHashDensity in interface HashCollection<K>
  
  Parameters:
  
  hashDensity - the new hash density to be set.
- hasVolatileElements
  
  public final boolean hasVolatileElements()
  
  Description copied from interface: XGettingCollection
  
  Tells if this collection contains volatile elements.
  An element is volatile, if it can become no longer reachable by the collection without being removed from the collection. Examples are WeakReference of SoftReference or implementations of collection entries that remove the element contained in an entry by some means outside the collection.
  Note that WeakReference instances that are added to a a simple (non-volatile) implementation of a collection do NOT make the collection volatile, as the elements themselves (the reference instances) are still strongly referenced.
  
  Specified by:
  
  hasVolatileElements in interface ExtendedCollection<K>
  
  Specified by:
  
  hasVolatileElements in interface XGettingCollection<K>
  
  Returns:
  
  true if the collection contains volatile elements.
- nullAllowed
  
  public final boolean nullAllowed()
  
  Specified by:
  
  nullAllowed in interface ExtendedCollection<K>
- nullKeyAllowed
  
  public final boolean nullKeyAllowed()
  
  Specified by:
  
  nullKeyAllowed in interface XGettingMap<K,V>
  
  Specified by:
  
  nullKeyAllowed in interface XImmutableMap<K,V>
  
  Specified by:
  
  nullKeyAllowed in interface XImmutableTable<K,V>
- nullValuesAllowed
  
  public final boolean nullValuesAllowed()
  
  Specified by:
  
  nullValuesAllowed in interface XGettingMap<K,V>
  
  Specified by:
  
  nullValuesAllowed in interface XImmutableMap<K,V>
  
  Specified by:
  
  nullValuesAllowed in interface XImmutableTable<K,V>
- get
  
  public final V get(K key)
  
  Specified by:
  
  get in interface XGettingMap<K,V>
  
  Specified by:
  
  get in interface XImmutableMap<K,V>
  
  Specified by:
  
  get in interface XImmutableTable<K,V>
- keys
  
  public final EqConstHashTable.Keys keys()
  
  Specified by:
  
  keys in interface XGettingMap<K,V>
  
  Specified by:
  
  keys in interface XGettingTable<K,V>
  
  Specified by:
  
  keys in interface XImmutableMap<K,V>
  
  Specified by:
  
  keys in interface XImmutableTable<K,V>
- old
  
  public final XImmutableTable.EntriesBridge<K,V> old()
  
  Specified by:
  
  old in interface XGettingCollection<K>
  
  Specified by:
  
  old in interface XGettingMap<K,V>
  
  Specified by:
  
  old in interface XGettingTable<K,V>
  
  Specified by:
  
  old in interface XImmutableMap<K,V>
  
  Specified by:
  
  old in interface XImmutableTable<K,V>
- oldMap
  
  public XImmutableTable.Bridge<K,V> oldMap()
  
  Specified by:
  
  oldMap in interface XGettingMap<K,V>
  
  Specified by:
  
  oldMap in interface XGettingTable<K,V>
  
  Specified by:
  
  oldMap in interface XImmutableMap<K,V>
  
  Specified by:
  
  oldMap in interface XImmutableTable<K,V>
- searchValue
  
  public final V searchValue(Predicate<? super K> keyPredicate)
  
  Specified by:
  
  searchValue in interface XGettingMap<K,V>
  
  Specified by:
  
  searchValue in interface XImmutableMap<K,V>
  
  Specified by:
  
  searchValue in interface XImmutableTable<K,V>
- query
  
  public final <C extends Consumer<? super V>> C query(XIterable<? extends K> keys, C collector)
  
  Specified by:
  
  query in interface XGettingMap<K,V>
- values
  
  public final EqConstHashTable.Values values()
  
  Specified by:
  
  values in interface XGettingMap<K,V>
  
  Specified by:
  
  values in interface XGettingTable<K,V>
  
  Specified by:
  
  values in interface XImmutableMap<K,V>
  
  Specified by:
  
  values in interface XImmutableTable<K,V>
- maximumCapacity
  
  public final long maximumCapacity()
  
  Description copied from interface: CapacityCarrying
  
  Returns the maximum amount of elements this carrier instance can contain.
  The actual value may be depend on the configuration of the concrete instance or may depend only on the implementation of the carrier (meaning it is constant for all instances of the implementation, e.g. Integer.MAX_VALUE)
  
  Specified by:
  
  maximumCapacity in interface CapacityCarrying
  
  Returns:
  
  the maximum amount of elements this carrier instance can contain.
- isFull
  
  public final boolean isFull()
  
  Description copied from interface: CapacityCarrying
  
  Returns true if the current capacity cannot be increased any more.
  
  Specified by:
  
  isFull in interface CapacityCarrying
- remainingCapacity
  
  public final long remainingCapacity()
  
  Description copied from interface: CapacityCarrying
  
  Returns the amount of elements this carrier instance can collect before reaching its maximimum capacity.
  
  Specified by:
  
  remainingCapacity in interface CapacityCarrying
- analyze
  
  public final HashCollection.Analysis<EqConstHashTable<K,V>> analyze()
  
  Specified by:
  
  analyze in interface HashCollection<K>
- hashDistributionRange
  
  public final int hashDistributionRange()
  
  Specified by:
  
  hashDistributionRange in interface HashCollection<K>
- hashEquality
  
  public final HashEqualator<? super K> hashEquality()
  
  Specified by:
  
  hashEquality in interface HashCollection<K>
- hashDensity
  
  public final float hashDensity()
  
  Specified by:
  
  hashDensity in interface HashCollection<K>
- hasVolatileHashElements
  
  public final boolean hasVolatileHashElements()
  
  Specified by:
  
  hasVolatileHashElements in interface HashCollection<K>
- toString
  
  public final String toString()
  
  Overrides:
  
  toString in class Object
- predicateContainsKey
  
  public final Predicate<K> predicateContainsKey()
- predicateContainsEntry
  
  public final Predicate<KeyValue<K,V>> predicateContainsEntry()
- range
  
  public final XEnum<KeyValue<K,V>> range(long lowIndex, long highIndex)
  
  Specified by:
  
  range in interface XGettingEnum<K>
  
  Specified by:
  
  range in interface XGettingSequence<K>
- view
  
  public final XGettingEnum<KeyValue<K,V>> view(long lowIndex, long highIndex)
  
  Specified by:
  
  view in interface XGettingEnum<K>
  
  Specified by:
  
  view in interface XGettingSequence<K>
- toArray
  
  public final KeyValue<K,V>[] toArray(Class<KeyValue<K,V>> type)
  
  Specified by:
  
  toArray in interface XGettingCollection<K>
- iterate
  
  public final <P extends Consumer<? super KeyValue<K, V>>> P iterate(P procedure)
  
  Specified by:
  
  iterate in interface XGettingEnum<K>
  
  Specified by:
  
  iterate in interface XGettingSet<K>
  
  Specified by:
  
  iterate in interface XIterable<K>
- join
  
  public final <A> A join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
  
  Specified by:
  
  join in interface XGettingCollection<K>
  
  Specified by:
  
  join in interface XJoinable<K>
- count
  
  public final long count(KeyValue<K,V> entry)
  
  Specified by:
  
  count in interface XGettingCollection<K>
- countBy
  
  public final long countBy(Predicate<? super KeyValue<K,V>> predicate)
  
  Specified by:
  
  countBy in interface XGettingCollection<K>
- search
  
  public final KeyValue<K,V> search(Predicate<? super KeyValue<K,V>> predicate)
  
  Specified by:
  
  search in interface XGettingCollection<K>
- max
  
  public final KeyValue<K,V> max(Comparator<? super KeyValue<K,V>> comparator)
  
  Specified by:
  
  max in interface XGettingCollection<K>
- min
  
  public final KeyValue<K,V> min(Comparator<? super KeyValue<K,V>> comparator)
  
  Specified by:
  
  min in interface XGettingCollection<K>
- containsSearched
  
  public final boolean containsSearched(Predicate<? super KeyValue<K,V>> predicate)
  
  Specified by:
  
  containsSearched in interface XGettingCollection<K>
- applies
  
  public final boolean applies(Predicate<? super KeyValue<K,V>> predicate)
  
  Specified by:
  
  applies in interface XGettingCollection<K>
- nullContained
  
  public final boolean nullContained()
  
  Specified by:
  
  nullContained in interface XGettingCollection<K>
- containsId
  
  public final boolean containsId(KeyValue<K,V> entry)
  
  Description copied from interface: XGettingCollection
  
  Special version of contains() that guarantees to use identity comparison (" == ") when searching for the given element regardless of the collection's internal logic.
  This method has the same behavior as XGettingCollection.containsSearched(Predicate) with a Predicate implementation that checks for object identity. The only difference is a performance and usability advantage
  
  Specified by:
  
  containsId in interface XGettingCollection<K>
  
  Parameters:
  
  entry - the element to be searched in the collection by identity.
  
  Returns:
  
  whether this collection contains exactely the given element.
- contains
  
  public final boolean contains(KeyValue<K,V> entry)
  
  Specified by:
  
  contains in interface XGettingCollection<K>
- seek
  
  public final KeyValue<K,V> seek(KeyValue<K,V> sample)
  
  Description copied from interface: XGettingCollection
  
  Returns the first contained element matching the passed sample as defined by the collection's equality logic or null, if no fitting element is contained. (For collections using referential equality, this method is basically just a variation of XGettingCollection.contains(Object) with a different return type. For collections with data-dependant equality, the returned element might be the same as the passed one or a data-wise equal one, depending on the content of the collection)
  
  Specified by:
  
  seek in interface XGettingCollection<K>
- containsAll
  
  public final boolean containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
  
  Specified by:
  
  containsAll in interface XGettingCollection<K>
- equals
  
  public final boolean equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
  
  Description copied from interface: XGettingCollection
  
  Returns true if the passed collection is of the same type as this collection andthis.equalsContent(list, equalator) yields true.
  
  Specified by:
  
  equals in interface XGettingCollection<K>
- equalsContent
  
  public final boolean equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
  
  Description copied from interface: XGettingCollection
  
  Returns true if all elements of this list and the passed list are sequentially equal as defined by the passed equalator.
  Note that for colletion types that don't have a defined order of elements, this method is hardly usable (as is XGettingCollection.equals(Object) for them as defined in Collection). The core problem of comparing collections that have no defined order is that they aren't really reliably comparable to any other collection.
  
  Specified by:
  
  equalsContent in interface XGettingCollection<K>
  
  equalator - the equalator to use to determine the equality of each element
  
  Returns:
  
  true if this list is equal to the passed list, false otherwise
- intersect
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
  
  Specified by:
  
  intersect in interface XGettingCollection<K>
- except
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
  
  Specified by:
  
  except in interface XGettingCollection<K>
- union
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
  
  Specified by:
  
  union in interface XGettingCollection<K>
- copyTo
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C copyTo(C target)
  
  Specified by:
  
  copyTo in interface XGettingCollection<K>
- filterTo
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
  
  Specified by:
  
  filterTo in interface XGettingCollection<K>
- distinct
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C distinct(C target)
  
  Specified by:
  
  distinct in interface XGettingCollection<K>
- distinct
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
  
  Specified by:
  
  distinct in interface XGettingCollection<K>
- toReversed
  
  public final EqConstHashTable<K,V> toReversed()
  
  Specified by:
  
  toReversed in interface XGettingEnum<K>
  
  Specified by:
  
  toReversed in interface XGettingSequence<K>
  
  Specified by:
  
  toReversed in interface XImmutableEnum<K>
  
  Specified by:
  
  toReversed in interface XImmutableSequence<K>
- copySelection
  
  public final <T extends Consumer<? super KeyValue<K, V>>> T copySelection(T target, long... indices)
  
  Specified by:
  
  copySelection in interface XGettingSequence<K>
- iterateIndexed
  
  public final <P extends IndexedAcceptor<? super KeyValue<K, V>>> P iterateIndexed(P procedure)
  
  Specified by:
  
  iterateIndexed in interface XIndexIterable<K>
- at
  
  public final KeyValue<K,V> at(long index)
  
  Specified by:
  
  at in interface XGettingSequence<K>
- get
  
  public final KeyValue<K,V> get()
  
  Description copied from interface: XGettingCollection
  
  Gets one element from the collection. If the collection is not ordered XGettingSequence, then it is undefined which element is returned. If the collection is ordered, the element at index 0 is returned.
  
  Specified by:
  
  get in interface XGettingCollection<K>
  
  Specified by:
  
  get in interface XGettingSequence<K>
  
  Returns:
  
  the first / any element.
  
  See Also:
  
  XGettingSequence.at(long), XGettingSequence.first(), XGettingSequence.last()
- first
  
  public final KeyValue<K,V> first()
  
  Specified by:
  
  first in interface XGettingSequence<K>
- last
  
  public final KeyValue<K,V> last()
  
  Specified by:
  
  last in interface XGettingSequence<K>
- poll
  
  public final KeyValue<K,V> poll()
  
  Specified by:
  
  poll in interface XGettingSequence<K>
- peek
  
  public final KeyValue<K,V> peek()
  
  Specified by:
  
  peek in interface XGettingSequence<K>
- indexOf
  
  public final long indexOf(KeyValue<K,V> entry)
  
  Specified by:
  
  indexOf in interface XGettingSequence<K>
- indexBy
  
  public final long indexBy(Predicate<? super KeyValue<K,V>> predicate)
  
  Specified by:
  
  indexBy in interface XGettingSequence<K>
- isSorted
  
  public final boolean isSorted(Comparator<? super KeyValue<K,V>> comparator)
  
  Specified by:
  
  isSorted in interface XGettingSequence<K>
- lastIndexOf
  
  public final long lastIndexOf(KeyValue<K,V> entry)
  
  Specified by:
  
  lastIndexOf in interface XGettingSequence<K>
- lastIndexBy
  
  public final long lastIndexBy(Predicate<? super KeyValue<K,V>> predicate)
  
  Specified by:
  
  lastIndexBy in interface XGettingSequence<K>
- maxIndex
  
  public final long maxIndex(Comparator<? super KeyValue<K,V>> comparator)
  
  Specified by:
  
  maxIndex in interface XGettingSequence<K>
- minIndex
  
  public final long minIndex(Comparator<? super KeyValue<K,V>> comparator)
  
  Specified by:
  
  minIndex in interface XGettingSequence<K>
- scan
  
  public final long scan(Predicate<? super KeyValue<K,V>> predicate)
  
  Description copied from interface: XGettingSequence
  
  Iterates through the collection and returns the index of the last element that the passed Predicateapplied to ("scanning").
  
  Specified by:
  
  scan in interface XGettingSequence<K>
  
  Returns:
  
  the index of the last positively tested element.
- iterator
  
  public final Iterator<KeyValue<K,V>> iterator()
  
  Specified by:
  
  iterator in interface Iterable<K>
  
  Specified by:
  
  iterator in interface XGettingCollection<K>
- toArray
  
  public final Object[] toArray()
  
  Specified by:
  
  toArray in interface XGettingCollection<K>
- equality
  
  public final HashEqualator<KeyValue<K,V>> equality()
  
  Specified by:
  
  equality in interface XGettingCollection<K>

Class EqConstHashTable<K,​V>