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

Method Summary

Modifier and Type	Method	Description
`HashCollection.Analysis<EqConstHashTable<K,V>>`	`analyze()`
`boolean`	`applies(Predicate<? super KeyValue<K,V>> predicate)`	Tests each element of the collection on the given predicate.
`KeyValue<K,V>`	`at(long index)`
`boolean`	`contains(KeyValue<K,V> entry)`	Checks if the given element is contained in the collection.
`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)`	Iterates through all the elements of the given indices and calls the `Consumer.accept(Object)` on the target `Consumer`.
`<C extends Consumer<? super KeyValue<K, V>>> C`	`copyTo(C target)`	Calls `Consumer.accept(Object)` on the target `Consumer` for all the elements of this collection.
`long`	`count(KeyValue<K,V> entry)`	Count how many times this element matches another element in the collection using the `Equalator`.
`long`	`countBy(Predicate<? super KeyValue<K,V>> predicate)`	Count how many matches are found using the given predicate on each element of the collection.
`<C extends Consumer<? super KeyValue<K, V>>> C`	`distinct(C target)`	Calls `Consumer.accept(Object)` on the target `Consumer` for all the unique/distinct elements of this collection.
`<C extends Consumer<? super KeyValue<K, V>>> C`	`distinct(C target, Equalator<? super KeyValue<K,V>> equalator)`	Calls `Consumer.accept(Object)` on the target `Consumer` for all the unique/distinct elements of this collection.
`HashEqualator<KeyValue<K,V>>`	`equality()`
`boolean`	`equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)`
`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)`	Calls `Consumer.accept(Object)` on the target `Consumer` for each element of this collection that is not contained in the other collection (through the given equalator).
`<C extends Consumer<? super KeyValue<K, V>>> C`	`filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)`	Calls `Consumer.accept(Object)` on the target `Consumer` for all the elements of this collection which test `true` on the given predicate.
`KeyValue<K,V>`	`first()`	Gets first element or throws `IndexOutOfBoundsException` if the collection is empty.
`KeyValue<K,V>`	`get()`	Gets one element from the collection.
`V`	`get(K key)`
`protected AbstractChainKeyValueStorage<K,V,one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V>>`	`getInternalStorageChain()`
`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)`	Iterates forwards through the collection and returns the index of the first element that the passed {link Predicate} applies to immediately. Stops iterating on the first element that the predicate applies to.
`long`	`indexOf(KeyValue<K,V> entry)`
`protected int`	`internalClear()`
`protected int`	`internalCountingAddAll(XGettingCollection<? extends KeyValue<K,V>> elements)`
`protected int`	`internalCountingAddAll(KeyValue<K,V>[] elements)`
`protected int`	`internalCountingAddAll(KeyValue<K,V>[] elements, int offset, int length)`
`protected int`	`internalCountingPutAll(XGettingCollection<? extends KeyValue<K,V>> elements)`
`protected int`	`internalCountingPutAll(KeyValue<K,V>[] elements)`
`protected int`	`internalCountingPutAll(KeyValue<K,V>[] elements, int offset, int length)`
`protected void`	`internalRemoveEntry(one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V> entry)`
`protected int`	`internalRemoveNullEntries()`
`<C extends Consumer<? super KeyValue<K, V>>> C`	`intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)`	Tests equality between each element of the two lists and calls `Consumer.accept(Object)` on the target `Consumer` for the equal elements. Therefore it effectively creates a mathematical intersection between the two collections.
`boolean`	`isEmpty()`
`boolean`	`isFull()`	Returns true if the current capacity cannot be increased any more.
`boolean`	`isSorted(Comparator<? super KeyValue<K,V>> comparator)`	Tests if the collection is sorted according to the given comparator.
`<P extends Consumer<? super KeyValue<K, V>>> P`	`iterate(P procedure)`	Executes the given procedure for each element of the `XIterable` until all elements have been processed or the action throws an exception.
`<P extends IndexedAcceptor<? super KeyValue<K, V>>> P`	`iterateIndexed(P procedure)`	Iterates over elements with the `IndexedAcceptor` to use not only the element itself but also its coherent index.
`Iterator<KeyValue<K,V>>`	`iterator()`
`<A> A`	`join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)`	Iterates over all elements of the collections and calls the joiner with each element and the aggregate.
`EqConstHashTable.Keys`	`keys()`
`KeyValue<K,V>`	`last()`	Gets last element or throws `IndexOutOfBoundsException` if the collection is empty.
`long`	`lastIndexBy(Predicate<? super KeyValue<K,V>> predicate)`	Iterates backwards through the collection and returns the index of the last element that the passed `Predicate` applies to immediately. Stops iterating on the first element that the predicate applies to.
`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()`	Defines if null-elements are allowed inside the collection or not.
`boolean`	`nullContained()`
`boolean`	`nullKeyAllowed()`
`boolean`	`nullValuesAllowed()`
`XImmutableTable.EntriesBridge<K,V>`	`old()`
`XImmutableTable.Bridge<K,V>`	`oldMap()`
`KeyValue<K,V>`	`peek()`	Gets last element or null if the collection is empty.
`KeyValue<K,V>`	`poll()`	Gets first element or null if the collection is empty.
`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)`	Returns the first contained element matching the passed 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()`	Returns an array containing all of the elements in this collection.
`KeyValue<K,V>[]`	`toArray(Class<KeyValue<K,V>> type)`	Returns a typed array containing all of the elements in this collection.
`EqConstHashTable<K,V>`	`toReversed()`	Creates a new `XGettingSequence` with the reversed order of elements.
`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)`	Calls `Consumer.accept(Object)` on the target `Consumer` for all the elements of this collection.
`EqConstHashTable.Values`	`values()`
`XGettingTable<K,V>`	`view()`	Creates a view of this collection and returns it.
`XGettingEnum<KeyValue<K,V>>`	`view(long lowIndex, long highIndex)`	Creates a sub-view of this collection and returns it.

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

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.
- internalCountingAddAll
  
  protected int internalCountingAddAll(KeyValue<K,V>[] elements) throws UnsupportedOperationException
  
  Specified by:
  
  internalCountingAddAll in class AbstractExtendedCollection<KeyValue<K,V>>
  
  Throws:
  
  UnsupportedOperationException
- internalCountingAddAll
  
  protected int internalCountingAddAll(KeyValue<K,V>[] elements, int offset, int length) throws UnsupportedOperationException
  
  Specified by:
  
  internalCountingAddAll in class AbstractExtendedCollection<KeyValue<K,V>>
  
  Throws:
  
  UnsupportedOperationException
- internalCountingAddAll
  
  protected int internalCountingAddAll(XGettingCollection<? extends KeyValue<K,V>> elements) throws UnsupportedOperationException
  
  Specified by:
  
  internalCountingAddAll in class AbstractExtendedCollection<KeyValue<K,V>>
  
  Throws:
  
  UnsupportedOperationException
- internalCountingPutAll
  
  protected int internalCountingPutAll(KeyValue<K,V>[] elements) throws UnsupportedOperationException
  
  Specified by:
  
  internalCountingPutAll in class AbstractExtendedCollection<KeyValue<K,V>>
  
  Throws:
  
  UnsupportedOperationException
- internalCountingPutAll
  
  protected int internalCountingPutAll(KeyValue<K,V>[] elements, int offset, int length) throws UnsupportedOperationException
  
  Specified by:
  
  internalCountingPutAll in class AbstractExtendedCollection<KeyValue<K,V>>
  
  Throws:
  
  UnsupportedOperationException
- internalCountingPutAll
  
  protected int internalCountingPutAll(XGettingCollection<? extends KeyValue<K,V>> elements) throws UnsupportedOperationException
  
  Specified by:
  
  internalCountingPutAll in class AbstractExtendedCollection<KeyValue<K,V>>
  
  Throws:
  
  UnsupportedOperationException
- internalRemoveNullEntries
  
  protected int internalRemoveNullEntries()
  
  Specified by:
  
  internalRemoveNullEntries in class AbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V>>
- internalRemoveEntry
  
  protected void internalRemoveEntry(one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V> entry)
  
  Specified by:
  
  internalRemoveEntry in class AbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V>>
- internalClear
  
  protected int internalClear()
  
  Specified by:
  
  internalClear in class AbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V>>
- getInternalStorageChain
  
  protected AbstractChainKeyValueStorage<K,V,one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V>> getInternalStorageChain()
  
  Specified by:
  
  getInternalStorageChain in class AbstractChainCollection<KeyValue<K,V>,K,V,one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V>>
- 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>
  
  Specified by:
  
  size in class AbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedHashedStrongStrong<K,V>>
- 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()
  
  Description copied from interface: XGettingCollection
  
  Creates a view of this collection and returns it. It is a read-only collection, which wraps around this collection and only allows read methods.
  A view is different from immutable collection (XGettingCollection.immure()) in the way, that changes in this collection are still affecting the view. The immutable collection on the other hand has no reference to this collection and changes therefore do not affect the immutable collection.
  
  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>
  
  Returns:
  
  new read-only collection to view this collection
- 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: ExtendedCollection
  
  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()
  
  Description copied from interface: ExtendedCollection
  
  Defines if null-elements are allowed inside the collection or not.
  
  Specified by:
  
  nullAllowed in interface ExtendedCollection<K>
  
  Returns:
  
  true if null is allowed inside the collection; false if not
- 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)
  
  Description copied from interface: XGettingSequence
  
  Creates a sub-view of this collection and returns it. It is a read-only collection, which wraps around this collection and only allows read methods.
  The view is limited to a range from the lowIndex to the highIndex.
  A view is different from immutable collection (XGettingCollection.immure()) in the way, that changes in this collection are still affecting the view. The immutable collection on the other hand has no reference to this collection and changes therefore do not affect the immutable collection.
  
  Specified by:
  
  view in interface XGettingEnum<K>
  
  Specified by:
  
  view in interface XGettingSequence<K>
  
  Parameters:
  
  lowIndex - defines lower boundary for the view of the collection.
  
  highIndex - defines higher boundary for the view of the collection.
  
  Returns:
  
  new read-only collection to view a range of elements in this collection
- toArray
  
  public final KeyValue<K,V>[] toArray(Class<KeyValue<K,V>> type)
  
  Description copied from interface: XGettingCollection
  
  Returns a typed array containing all of the elements in this collection.
  The returned array will be "safe" in that no references to it are maintained by this list. (In other words, this method must allocate a new array). The caller is thus free to modify the returned array.
  This method acts as bridge between MicroStream-based collections and Java-native-based APIs.
  
  Specified by:
  
  toArray in interface XGettingCollection<K>
  
  Returns:
  
  a typed array containing all of the elements in this collection
- iterate
  
  public final <P extends Consumer<? super KeyValue<K, V>>> P iterate(P procedure)
  
  Description copied from interface: XIterable
  
  Executes the given procedure for each element of the XIterable until all elements have been processed or the action throws an exception. Unless otherwise specified by the implementing class, procedures are performed in the order of iteration (if an iteration order is specified). Exceptions thrown by the procedure are relayed to the caller.
  Should be identical to Iterable.forEach(Consumer).
  
  Specified by:
  
  iterate in interface XGettingEnum<K>
  
  Specified by:
  
  iterate in interface XGettingSet<K>
  
  Specified by:
  
  iterate in interface XIterable<K>
  
  Type Parameters:
  
  P - type of procedure
  
  Parameters:
  
  procedure - The procedure to be performed for each element
  
  Returns:
  
  Given procedure
- join
  
  public final <A> A join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
  
  Description copied from interface: XJoinable
  
  Iterates over all elements of the collections and calls the joiner with each element and the aggregate.
  
  Specified by:
  
  join in interface XGettingCollection<K>
  
  Specified by:
  
  join in interface XJoinable<K>
  
  Type Parameters:
  
  A - type of aggregate
  
  Parameters:
  
  joiner - is the actual function to do the joining
  
  aggregate - where to join into
- count
  
  public final long count(KeyValue<K,V> entry)
  
  Description copied from interface: XGettingCollection
  
  Count how many times this element matches another element in the collection using the Equalator.
  
  Specified by:
  
  count in interface XGettingCollection<K>
  
  Parameters:
  
  entry - to count
  
  Returns:
  
  Amount of matches
- countBy
  
  public final long countBy(Predicate<? super KeyValue<K,V>> predicate)
  
  Description copied from interface: XGettingCollection
  
  Count how many matches are found using the given predicate on each element of the collection.
  
  Specified by:
  
  countBy in interface XGettingCollection<K>
  
  Parameters:
  
  predicate - defines which elements are counted and which are not
  
  Returns:
  
  Amount of matches
- search
  
  public final KeyValue<K,V> search(Predicate<? super KeyValue<K,V>> predicate)
  
  Description copied from interface: XGettingCollection
  
  Returns the first contained element matching the passed predicate.
  
  Specified by:
  
  search in interface XGettingCollection<K>
  
  Parameters:
  
  predicate - defines which element is searched
  
  Returns:
  
  Matching element
- 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)
  
  Description copied from interface: XGettingCollection
  
  Tests each element of the collection on the given predicate.
  
  Specified by:
  
  applies in interface XGettingCollection<K>
  
  Parameters:
  
  predicate - that's tested on each element.
  
  Returns:
  
  If all elements test successfully, true is returned. Otherwise (if at least one test has failed), false is returned.
- 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 exactly the given element.
- contains
  
  public final boolean contains(KeyValue<K,V> entry)
  
  Description copied from interface: XGettingCollection
  
  Checks if the given element is contained in the collection.
  In contrast to the XGettingCollection.containsId(Object) method, this method uses the internal Equalator defined by the collection itself.
  
  Specified by:
  
  contains in interface XGettingCollection<K>
  
  Parameters:
  
  entry - to be searched in the collection
  
  Returns:
  
  Whether this collection contains the given element as specified by the Equalator.
- 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>
  
  Parameters:
  
  sample - to seek in the collection
  
  Returns:
  
  the first contained element matching the passed sample
- containsAll
  
  public final boolean containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
  
  Specified by:
  
  containsAll in interface XGettingCollection<K>
  
  Parameters:
  
  elements - to be searched in the collection.
  
  Returns:
  
  Whether this collection contains all given elements as specified by the Equalator.
- equals
  
  public final boolean equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
  
  Specified by:
  
  equals in interface XGettingCollection<K>
  
  Parameters:
  
  samples - is the collection which is checked for equality
  
  equalator - is used to check the equality of the collections
  
  Returns:
  
  true if the passed collection is of the same type as this collection and this.equalsContent(list, equalator) yields true
- 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>
  
  Parameters:
  
  samples - is the collection which is checked for equality
  
  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)
  
  Description copied from interface: XGettingCollection
  
  Tests equality between each element of the two lists and calls Consumer.accept(Object) on the target Consumer for the equal elements.
  Therefore it effectively creates a mathematical intersection between the two collections.
  Since all MicroStream Collections implement the Consumer interface, new collections can be used as target.
  Example:
  BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> collection2 = BulkList.New(2,3,4); BulkList<Integer> intersection = collection1.intersect(collection2, Equalator.identity(), BulkList.New());
  Results in intersection containing 2 and 3.
  
  Specified by:
  
  intersect in interface XGettingCollection<K>
  
  Parameters:
  
  other - collection to intersect with.
  
  equalator - which is used for the equal-tests.
  
  target - on which the Consumer.accept(Object) is called for equal elements.
  
  Returns:
  
  Given target
- 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)
  
  Description copied from interface: XGettingCollection
  
  Calls Consumer.accept(Object) on the target Consumer for each element of this collection that is not contained in the other collection (through the given equalator).
  Since all MicroStream Collections implement the Consumer interface, new collections can be used as target.
  Example:
  BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> collection2 = BulkList.New(2,3,4); BulkList<Integer> exceptCollection = collection1.except(collection2, Equalator.identity(), BulkList.New());
  Results in exceptCollection containing 1.
  
  Specified by:
  
  except in interface XGettingCollection<K>
  
  Type Parameters:
  
  C - type of the target
  
  Parameters:
  
  other - collection whose elements are excluded from the target.
  
  equalator - which is used for the equal-tests.
  
  target - on which the Consumer.accept(Object) is called for elements not contained in the other collection.
  
  Returns:
  
  Given target
- 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)
  
  Description copied from interface: XGettingCollection
  
  Calls Consumer.accept(Object) on the target Consumer for all the elements of this collection. And calls it for all elements of the other collection, that are not already in this collection (defined by the given Equalator)
  Therefore it effectively creates a mathematical union between the two collections.
  Since all MicroStream Collections implement the Consumer interface, new collections can be used as target.
  Example:
  BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> collection2 = BulkList.New(2,3,4); BulkList<Integer> union = collection1.union(collection2, Equalator.identity(), BulkList.New());
  Results in union containing 1, 2, 3 and 4.
  
  Specified by:
  
  union in interface XGettingCollection<K>
  
  Parameters:
  
  other - collection to build a union with.
  
  equalator - which is used for the equal-tests.
  
  target - on which the Consumer.accept(Object) is called for all unified elements.
  
  Returns:
  
  Given target
- copyTo
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C copyTo(C target)
  
  Description copied from interface: XGettingCollection
  
  Calls Consumer.accept(Object) on the target Consumer for all the elements of this collection.
  Since all MicroStream Collections implement the Consumer interface, new collections can be used as target.
  Example:
  BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> copiedCollection = collection1.copyTo(BulkList.New());
  Results in copiedCollection containing 1, 2 and 3.
  
  Specified by:
  
  copyTo in interface XGettingCollection<K>
  
  Parameters:
  
  target - on which the Consumer.accept(Object) is called for all elements of this collection.
  
  Returns:
  
  Given target
- filterTo
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
  
  Description copied from interface: XGettingCollection
  
  Calls Consumer.accept(Object) on the target Consumer for all the elements of this collection which test true on the given predicate.
  Since all MicroStream Collections implement the Consumer interface, new collections can be used as target.
  Example:
  BulkList<Integer> collection1 = BulkList.New(1,2,3); BulkList<Integer> filteredCollection = collection1.filterTo(BulkList.New(), e-> e % 2 == 0);
  Results in filteredCollection containing 2.
  
  Specified by:
  
  filterTo in interface XGettingCollection<K>
  
  Parameters:
  
  target - on which the Consumer.accept(Object) is called for elements that test true.
  
  predicate - on which to test all elements.
  
  Returns:
  
  Given target
- distinct
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C distinct(C target)
  
  Description copied from interface: XGettingCollection
  
  Calls Consumer.accept(Object) on the target Consumer for all the unique/distinct elements of this collection. This means the elements are not equal to each other.
  Uniqueness is defined by the collections internal Equalator.
  Since all MicroStream Collections implement the Consumer interface, new collections can be used as target.
  Example:
  BulkList<Integer> collection1 = BulkList.New(1,2,2,3); BulkList<Integer> distinctCollection = collection1.distinct(BulkList.New());
  Results in distinctCollection containing 1, 2 and 3.
  
  Specified by:
  
  distinct in interface XGettingCollection<K>
  
  Parameters:
  
  target - on which the Consumer.accept(Object) is called for every distinct element of this collection.
  
  Returns:
  
  Given target
- distinct
  
  public final <C extends Consumer<? super KeyValue<K, V>>> C distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
  
  Description copied from interface: XGettingCollection
  
  Calls Consumer.accept(Object) on the target Consumer for all the unique/distinct elements of this collection. This means the elements are not equal to each other.
  Uniqueness is defined by the given Equalator.
  Since all MicroStream Collections implement the Consumer interface, new collections can be used as target.
  Example:
  BulkList<Integer> collection1 = BulkList.New(1,2,2,3); BulkList<Integer> distinctCollection = collection1.distinct(BulkList.New(), Equalator.identity());
  Results in distinctCollection containing 1, 2 and 3.
  
  Specified by:
  
  distinct in interface XGettingCollection<K>
  
  Parameters:
  
  target - on which the Consumer.accept(Object) is called for every distinct element of this collection.
  
  equalator - defines what distinct means (which elements are equal to one another)
  
  Returns:
  
  Given target
- toReversed
  
  public final EqConstHashTable<K,V> toReversed()
  
  Description copied from interface: XGettingSequence
  
  Creates a new XGettingSequence with the reversed order of elements.
  This method creates a new collection and does not change the existing collection.
  
  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>
  
  Returns:
  
  New copy of the collection
- copySelection
  
  public final <T extends Consumer<? super KeyValue<K, V>>> T copySelection(T target, long... indices)
  
  Description copied from interface: XGettingSequence
  
  Iterates through all the elements of the given indices and calls the Consumer.accept(Object) on the target Consumer.
  
  Specified by:
  
  copySelection in interface XGettingSequence<K>
  
  Type Parameters:
  
  T - type of the target
  
  Parameters:
  
  target - on which the Consumer.accept(Object) is called
  
  indices - of the elements which are copied
  
  Returns:
  
  Given target
- iterateIndexed
  
  public final <P extends IndexedAcceptor<? super KeyValue<K, V>>> P iterateIndexed(P procedure)
  
  Description copied from interface: XIndexIterable
  
  Iterates over elements with the IndexedAcceptor to use not only the element itself but also its coherent index.
  
  Specified by:
  
  iterateIndexed in interface XIndexIterable<K>
  
  Type Parameters:
  
  P - type of procedure
  
  Parameters:
  
  procedure - which is executed when iterating
  
  Returns:
  
  Given procedure
- 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()
  
  Description copied from interface: XGettingSequence
  
  Gets first element or throws IndexOutOfBoundsException if the collection is empty.
  Is an alias for XGettingSequence.get().
  
  Specified by:
  
  first in interface XGettingSequence<K>
  
  Returns:
  
  First element
- last
  
  public final KeyValue<K,V> last()
  
  Description copied from interface: XGettingSequence
  
  Gets last element or throws IndexOutOfBoundsException if the collection is empty.
  
  Specified by:
  
  last in interface XGettingSequence<K>
  
  Returns:
  
  Last element
- poll
  
  public final KeyValue<K,V> poll()
  
  Description copied from interface: XGettingSequence
  
  Gets first element or null if the collection is empty.
  
  Specified by:
  
  poll in interface XGettingSequence<K>
  
  Returns:
  
  First element or null
- peek
  
  public final KeyValue<K,V> peek()
  
  Description copied from interface: XGettingSequence
  
  Gets last element or null if the collection is empty.
  This behaves like peeking on a stack without pop.
  
  Specified by:
  
  peek in interface XGettingSequence<K>
  
  Returns:
  
  Last element or null
- 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)
  
  Description copied from interface: XGettingSequence
  
  Iterates forwards through the collection and returns the index of the first element that the passed {link Predicate} applies to immediately.
  Stops iterating on the first element that the predicate applies to.
  Basically the opposite of XGettingSequence.lastIndexBy(Predicate)
  
  Specified by:
  
  indexBy in interface XGettingSequence<K>
  
  Parameters:
  
  predicate - to define a valid element
  
  Returns:
  
  The index of the first positively tested element.
- isSorted
  
  public final boolean isSorted(Comparator<? super KeyValue<K,V>> comparator)
  
  Description copied from interface: XGettingSequence
  
  Tests if the collection is sorted according to the given comparator.
  
  Specified by:
  
  isSorted in interface XGettingSequence<K>
  
  Parameters:
  
  comparator - defines if elements are sorted
  
  Returns:
  
  true if it sorted, false if not
- 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)
  
  Description copied from interface: XGettingSequence
  
  Iterates backwards through the collection and returns the index of the last element that the passed Predicate applies to immediately.
  Stops iterating on the first element that the predicate applies to.
  Basically the opposite of XGettingSequence.indexBy(Predicate).
  Similar but not the same as XGettingSequence.scan(Predicate), since scan iterates through all elements.
  
  Specified by:
  
  lastIndexBy in interface XGettingSequence<K>
  
  Parameters:
  
  predicate - to define a valid element
  
  Returns:
  
  the index of the last positively tested element.
- 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 Predicate applied to ("scanning").
  In order to find the last element, this method must iterate over all elements of the collection (opposed to XGettingSequence.indexBy(Predicate) and XGettingSequence.lastIndexBy(Predicate)).
  Iteration can be safely canceled with a ThrowBreak (X.BREAK)
  
  Specified by:
  
  scan in interface XGettingSequence<K>
  
  Parameters:
  
  predicate - to define a valid element
  
  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()
  
  Description copied from interface: XGettingCollection
  
  Returns an array containing all of the elements in this collection.
  The returned array will be "safe" in that no references to it are maintained by this list. (In other words, this method must allocate a new array). The caller is thus free to modify the returned array.
  This method acts as bridge between MicroStream-based collections and Java-native-based APIs.
  
  Specified by:
  
  toArray in interface XGettingCollection<K>
  
  Returns:
  
  an array containing all of the elements in this collection
- equality
  
  public final HashEqualator<KeyValue<K,V>> equality()
  
  Specified by:
  
  equality in interface XGettingCollection<K>

Class EqConstHashTable<K,​V>