Uses of Interface
one.microstream.typing.KeyValue

Packages that use KeyValue

Package	Description
one.microstream
one.microstream.cache
one.microstream.collections
one.microstream.collections.interfaces
one.microstream.collections.old
one.microstream.collections.sorting
one.microstream.collections.types
one.microstream.hashing
one.microstream.persistence.binary.types
one.microstream.persistence.types
one.microstream.storage.types
one.microstream.typing
one.microstream.util.cql
one.microstream.util.xcsv

Uses of KeyValue in one.microstream

Methods in one.microstream that return KeyValue

Modifier and Type	Method	Description
static <K, V> KeyValue<K,V>	X.KeyValue(K key, V value)
static <T, K, V> KeyValue<K,V>	X.toKeyValue(T instance, Function<? super T,KeyValue<K,V>> mapper)

Methods in one.microstream with parameters of type KeyValue

Modifier and Type	Method	Description
static <K, V> HashTable<K,V>	X.Table(KeyValue<? extends K,? extends V>... elements)

Method parameters in one.microstream with type arguments of type KeyValue

Modifier and Type	Method	Description
static <T, K, V> KeyValue<K,V>	X.toKeyValue(T instance, Function<? super T,KeyValue<K,V>> mapper)

Uses of KeyValue in one.microstream.cache

Subinterfaces of KeyValue in one.microstream.cache

Modifier and Type	Interface	Description
interface	CacheEntry<K,V>

Classes in one.microstream.cache that implement KeyValue

Modifier and Type	Class	Description
static class	CacheEntry.Default<K,V>

Methods in one.microstream.cache that return KeyValue

Modifier and Type	Method	Description
KeyValue<Object,CachedValue>	CacheTable.Default.min(Comparator<? super KeyValue<Object,CachedValue>> comparator)
KeyValue<Object,CachedValue>	CacheTable.min(Comparator<? super KeyValue<Object,CachedValue>> comparator)
KeyValue<Object,CachedValue>	CacheTable.Default.rangeMin(long offset, long length, Comparator<? super KeyValue<Object,CachedValue>> comparator)
KeyValue<Object,CachedValue>	CacheTable.rangeMin(long offset, long length, Comparator<? super KeyValue<Object,CachedValue>> comparator)
KeyValue<Object,CachedValue>	CacheTable.Default.search(Predicate<? super KeyValue<Object,CachedValue>> predicate)
KeyValue<Object,CachedValue>	CacheTable.search(Predicate<? super KeyValue<Object,CachedValue>> predicate)

Methods in one.microstream.cache that return types with arguments of type KeyValue

Modifier and Type	Method	Description
static Comparator<KeyValue<Object,CachedValue>>	EvictionPolicy.BiggestObjectsComparator()
Iterator<KeyValue<Object,CachedValue>>	CacheTable.Default.iterator()
Iterator<KeyValue<Object,CachedValue>>	CacheTable.iterator()
static Comparator<KeyValue<Object,CachedValue>>	EvictionPolicy.LeastFrequentlyUsedComparator()
static Comparator<KeyValue<Object,CachedValue>>	EvictionPolicy.LeastRecentlyUsedComparator()
Iterable<KeyValue<Object,CachedValue>>	EvictionPolicy.pickEntriesToEvict(CacheTable cacheTable)	Select the entries which should be evicted.
Iterable<KeyValue<Object,CachedValue>>	EvictionPolicy.Sampling.pickEntriesToEvict(CacheTable cacheTable)
Iterable<KeyValue<Object,CachedValue>>	EvictionPolicy.Searching.pickEntriesToEvict(CacheTable cacheTable)

Method parameters in one.microstream.cache with type arguments of type KeyValue

Modifier and Type	Method	Description
void	Cache.Default.evict(Iterable<KeyValue<Object,CachedValue>> entriesToEvict)
void	Cache.evict(Iterable<KeyValue<Object,CachedValue>> entriesToEvict)	Evicts given entries from this cache.
void	CacheTable.Default.iterate(Consumer<KeyValue<Object,CachedValue>> procedure)
void	CacheTable.iterate(Consumer<KeyValue<Object,CachedValue>> procedure)
KeyValue<Object,CachedValue>	CacheTable.Default.min(Comparator<? super KeyValue<Object,CachedValue>> comparator)
KeyValue<Object,CachedValue>	CacheTable.min(Comparator<? super KeyValue<Object,CachedValue>> comparator)
KeyValue<Object,CachedValue>	CacheTable.Default.rangeMin(long offset, long length, Comparator<? super KeyValue<Object,CachedValue>> comparator)
KeyValue<Object,CachedValue>	CacheTable.rangeMin(long offset, long length, Comparator<? super KeyValue<Object,CachedValue>> comparator)
static EvictionPolicy	EvictionPolicy.Sampling(_intReference elementCount, Predicate<CacheTable> evictionNecessity, Predicate<KeyValue<Object,CachedValue>> evictionPermission, Comparator<KeyValue<Object,CachedValue>> comparator)
KeyValue<Object,CachedValue>	CacheTable.Default.search(Predicate<? super KeyValue<Object,CachedValue>> predicate)
KeyValue<Object,CachedValue>	CacheTable.search(Predicate<? super KeyValue<Object,CachedValue>> predicate)

Uses of KeyValue in one.microstream.collections

Classes in one.microstream.collections with type parameters of type KeyValue

Modifier and Type	Class	Description
class	AbstractChainKeyValueCollection<K,V,EN extends AbstractChainEntry<KeyValue<K,V>,K,V,EN>>
class	AbstractChainKeyValueStorage<K,V,EN extends AbstractChainEntry<KeyValue<K,V>,K,V,EN>>
class	ChainStrongStrongStorage<K,V,EN extends AbstractChainEntry<KeyValue<K,V>,K,V,EN>>

Classes in one.microstream.collections that implement KeyValue

Modifier and Type	Class	Description
class	AbstractChainEntry<E,K,V,EN extends AbstractChainEntry<E,K,V,EN>>
static class	AbstractChainEntry.Head<E,K,V,EN extends AbstractChainEntry<E,K,V,EN>>
class	AbstractChainEntryLinked<E,K,V,EN extends AbstractChainEntryLinked<E,K,V,EN>>
class	AbstractChainEntryLinkedHashed<E,K,V,EN extends AbstractChainEntryLinkedHashed<E,K,V,EN>>
class	AbstractChainEntryLinkedKV<K,V,EN extends AbstractChainEntryLinkedKV<K,V,EN>>
class	AbstractChainEntryLinkedKVHashed<K,V,EN extends AbstractChainEntryLinkedKVHashed<K,V,EN>>
class	ChainEntryLinkedHashedStrong<E>
class	ChainEntryLinkedStrong<E>

Methods in one.microstream.collections with type parameters of type KeyValue

Modifier and Type	Method	Description
<T extends Consumer<? super KeyValue<K, V>>> T	ConstHashTable.copySelection(T target, long... indices)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.copySelection(T target, long... indices)
<T extends Consumer<? super KeyValue<K, V>>> T	EqConstHashTable.copySelection(T target, long... indices)
<T extends Consumer<? super KeyValue<K, V>>> T	EqHashTable.copySelection(T target, long... indices)
<T extends Consumer<? super KeyValue<K, V>>> T	HashTable.copySelection(T target, long... indices)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.copySelection(T target, long... indices)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.copyTo(C target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.copyTo(T target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.copyTo(C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.copyTo(C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.copyTo(C target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.copyTo(T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.copyTo(T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.copyTo(T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.copyTo(T target)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.distinct(C target)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.distinct(T target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.distinct(C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.distinct(C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.distinct(C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.distinct(T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.distinct(T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.distinct(T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.distinct(T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<P extends Consumer<? super KeyValue<K, V>>> P	ConstHashTable.iterate(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	EmptyTable.iterate(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	EqConstHashTable.iterate(P procedure)
<P extends Consumer<? super KeyValue<K1, ? extends XGettingMap<K2, V>>>> P	EqHash2DMap.iterate(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	EqHashTable.iterate(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	HashTable.iterate(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	LockedGettingMap.iterate(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	LockedMap.iterate(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	MapView.iterate(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	TableView.iterate(P procedure)
<P extends IndexedAcceptor<? super KeyValue<K, V>>> P	ConstHashTable.iterateIndexed(P procedure)
<P extends IndexedAcceptor<? super KeyValue<K, V>>> P	EmptyTable.iterateIndexed(P procedure)
<P extends IndexedAcceptor<? super KeyValue<K, V>>> P	EqConstHashTable.iterateIndexed(P procedure)
<P extends IndexedAcceptor<? super KeyValue<K, V>>> P	EqHashTable.iterateIndexed(P procedure)
<P extends IndexedAcceptor<? super KeyValue<K, V>>> P	HashTable.iterateIndexed(P procedure)
<P extends IndexedAcceptor<? super KeyValue<K, V>>> P	TableView.iterateIndexed(P procedure)
<PIE extends Consumer<? super KeyValue<K2, V>>> PIE	EqHash2DMap.iterateInnerEntries(PIE procedure)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.moveSelection(C target, long... indices)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.moveSelection(C target, long... indices)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.moveTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.moveTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	LockedMap.moveTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<P extends Consumer<? super KeyValue<K, V>>> P	EqHashTable.process(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	HashTable.process(P procedure)
<P extends Consumer<? super KeyValue<K, V>>> P	LockedMap.process(P processor)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)

Methods in one.microstream.collections that return KeyValue

Modifier and Type	Method	Description
KeyValue<K,V>	EqHashTable.addGet(K key, V value)
KeyValue<K,V>	EqHashTable.addGet(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.addGet(K key, V value)
KeyValue<K,V>	HashTable.addGet(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.addGet(K key, V value)
KeyValue<K,V>	LockedMap.addGet(KeyValue<K,V> element)
KeyValue<K,V>	ConstHashTable.at(long index)
KeyValue<K,V>	EmptyTable.at(long index)
KeyValue<K,V>	EqConstHashTable.at(long index)
KeyValue<K,V>	EqHashTable.at(long index)
KeyValue<K,V>	HashTable.at(long index)
KeyValue<K,V>	TableView.at(long index)
KeyValue<K,V>	EqHashTable.deduplicate(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.deduplicate(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.deduplicate(KeyValue<K,V> element)
KeyValue<K,V>	EqHashTable.fetch()
KeyValue<K,V>	HashTable.fetch()
KeyValue<K,V>	LockedMap.fetch()
KeyValue<K,V>	ConstHashTable.first()
KeyValue<K,V>	EmptyTable.first()
KeyValue<K,V>	EqConstHashTable.first()
KeyValue<K,V>	EqHashTable.first()
KeyValue<K,V>	HashTable.first()
KeyValue<K,V>	TableView.first()
KeyValue<K,V>	ConstHashTable.get()
KeyValue<K,V>	EmptyTable.get()
KeyValue<K,V>	EqConstHashTable.get()
KeyValue<K,V>	EqHashTable.get()
KeyValue<K,V>	HashTable.get()
KeyValue<K,V>	LockedGettingMap.get()
KeyValue<K,V>	LockedMap.get()
KeyValue<K,V>	MapView.get()
KeyValue<K,V>	TableView.get()
KeyValue<K,V>	ConstHashTable.last()
KeyValue<K,V>	EmptyTable.last()
KeyValue<K,V>	EqConstHashTable.last()
KeyValue<K,V>	EqHashTable.last()
KeyValue<K,V>	HashTable.last()
KeyValue<K,V>	TableView.last()
KeyValue<K,V>	ConstHashTable.lookup(K key)
KeyValue<K,V>	EmptyTable.lookup(K key)
KeyValue<K,V>	EqConstHashTable.lookup(K key)
KeyValue<K,V>	EqHashTable.lookup(K key)
KeyValue<K,V>	HashTable.lookup(K key)
KeyValue<K,V>	LockedGettingMap.lookup(K key)
KeyValue<K,V>	LockedMap.lookup(K key)
KeyValue<K,V>	MapView.lookup(K key)
KeyValue<K,V>	TableView.lookup(K key)
KeyValue<K,V>	ConstHashTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EmptyTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EqConstHashTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EqHashTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	HashTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	LockedGettingMap.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	LockedMap.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	MapView.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	TableView.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	ConstHashTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EmptyTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EqConstHashTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EqHashTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	HashTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	LockedGettingMap.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	LockedMap.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	MapView.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	TableView.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	ConstHashTable.peek()
KeyValue<K,V>	EmptyTable.peek()
KeyValue<K,V>	EqConstHashTable.peek()
KeyValue<K,V>	EqHashTable.peek()
KeyValue<K,V>	HashTable.peek()
KeyValue<K,V>	TableView.peek()
KeyValue<K,V>	EqHashTable.pick()
KeyValue<K,V>	HashTable.pick()
KeyValue<K,V>	EqHashTable.pinch()
KeyValue<K,V>	HashTable.pinch()
KeyValue<K,V>	LockedMap.pinch()
KeyValue<K,V>	ConstHashTable.poll()
KeyValue<K,V>	EmptyTable.poll()
KeyValue<K,V>	EqConstHashTable.poll()
KeyValue<K,V>	EqHashTable.poll()
KeyValue<K,V>	HashTable.poll()
KeyValue<K,V>	TableView.poll()
KeyValue<K,V>	EqHashTable.pop()
KeyValue<K,V>	HashTable.pop()
KeyValue<K,V>	EqHashTable.putGet(K key, V value)
KeyValue<K,V>	EqHashTable.putGet(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.putGet(K key, V value)
KeyValue<K,V>	HashTable.putGet(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.putGet(K key, V value)
KeyValue<K,V>	LockedMap.putGet(KeyValue<K,V> element)
KeyValue<K,V>	EqHashTable.removeAt(long index)
KeyValue<K,V>	HashTable.removeAt(long index)
KeyValue<K,V>	EqHashTable.replace(K key, V value)
KeyValue<K,V>	EqHashTable.replace(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.replace(K key, V value)
KeyValue<K,V>	HashTable.replace(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.replace(K key, V value)
KeyValue<K,V>	LockedMap.replace(KeyValue<K,V> element)
KeyValue<K,V>	EqHashTable.retrieve(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.retrieve(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.retrieve(KeyValue<K,V> element)
KeyValue<K,V>	EqHashTable.retrieveBy(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	HashTable.retrieveBy(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	LockedMap.retrieveBy(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	ConstHashTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	EmptyTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	EqConstHashTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	EqHashTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	HashTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	LockedGettingMap.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	LockedMap.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	MapView.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	TableView.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	ConstHashTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	EmptyTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	EqConstHashTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	EqHashTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	HashTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	LockedGettingMap.seek(KeyValue<K,V> sample)
KeyValue<K,V>	LockedMap.seek(KeyValue<K,V> sample)
KeyValue<K,V>	MapView.seek(KeyValue<K,V> sample)
KeyValue<K,V>	TableView.seek(KeyValue<K,V> sample)
KeyValue<K,V>	EqHashTable.setGet(long index, KeyValue<K,V> element)
KeyValue<K,V>	EqHashTable.setGet(K key, V value)
KeyValue<K,V>	HashTable.setGet(long index, KeyValue<K,V> element)
KeyValue<K,V>	HashTable.setGet(K key, V value)
KeyValue<K,V>	LockedMap.setGet(K key, V value)
KeyValue<K,V>	EqHashTable.substitute(K key, V value)
KeyValue<K,V>	HashTable.substitute(K key, V value)
KeyValue<K,V>	LockedMap.substitute(K key, V value)
KeyValue<K,V>[]	ConstHashTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	ConstMiniMap.toArray()
KeyValue<K,V>[]	EmptyTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	EqConstHashTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	EqHashTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	HashTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	LockedGettingMap.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	LockedMap.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	MapView.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	MiniMap.toArray()
KeyValue<K,V>[]	TableView.toArray(Class<KeyValue<K,V>> type)

Methods in one.microstream.collections that return types with arguments of type KeyValue

Modifier and Type	Method	Description
Aggregator<KeyValue<K,V>,? extends XCollection<KeyValue<K,V>>>	LockedMap.collector()
Aggregator<KeyValue<K,V>,? extends XCollection<KeyValue<K,V>>>	LockedMap.collector()
HashEqualator<KeyValue<K,V>>	ConstHashTable.equality()
Equalator<? super KeyValue<K,V>>	EmptyTable.equality()
HashEqualator<KeyValue<K,V>>	EqConstHashTable.equality()
HashEqualator<KeyValue<K,V>>	EqHashTable.equality()
HashEqualator<KeyValue<K,V>>	HashTable.equality()
Equalator<? super KeyValue<K,V>>	LockedGettingMap.equality()
Equalator<? super KeyValue<K,V>>	LockedMap.equality()
Equalator<? super KeyValue<K,V>>	MapView.equality()
Equalator<? super KeyValue<K,V>>	TableView.equality()
Iterator<KeyValue<K,V>>	ConstHashTable.iterator()
Iterator<KeyValue<K,V>>	EmptyTable.iterator()
Iterator<KeyValue<K,V>>	EqConstHashTable.iterator()
Iterator<KeyValue<K,V>>	EqHashTable.iterator()
Iterator<KeyValue<K,V>>	HashTable.iterator()
Iterator<KeyValue<K,V>>	LockedGettingMap.iterator()
Iterator<KeyValue<K,V>>	LockedMap.iterator()
Iterator<KeyValue<K,V>>	MapView.iterator()
Iterator<KeyValue<K,V>>	TableView.iterator()
Predicate<KeyValue<K,V>>	ConstHashTable.predicateContainsEntry()
Predicate<KeyValue<K,V>>	EqConstHashTable.predicateContainsEntry()
Predicate<KeyValue<K,V>>	EqHashTable.predicateContainsEntry()
Predicate<KeyValue<K,V>>	HashTable.predicateContainsEntry()
Consumer<KeyValue<K,V>>	EqHashTable.procedureRemoveEntry()
static <KI, VI, KO, VO> Aggregator<KeyValue<KI,VI>,ConstHashTable<KO,VO>>	ConstHashTable.projector(ConstHashTable<KO,VO> target, Function<KI,KO> keyProjector, Function<VI,VO> valueProjector)
XSet<KeyValue<K,V>>	LockedMap.putAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XEnum<KeyValue<K,V>>	ConstHashTable.range(long lowIndex, long highIndex)
XGettingEnum<KeyValue<K,V>>	EmptyTable.range(long lowIndex, long highIndex)
XEnum<KeyValue<K,V>>	EqConstHashTable.range(long lowIndex, long highIndex)
XEnum<KeyValue<K,V>>	EqHashTable.range(long lowIndex, long highIndex)
XEnum<KeyValue<K,V>>	HashTable.range(long lowIndex, long highIndex)
XGettingEnum<KeyValue<K,V>>	TableView.range(long lowIndex, long highIndex)
Spliterator<KeyValue<K,V>>	LockedGettingMap.spliterator()
Spliterator<KeyValue<K,V>>	LockedMap.spliterator()
XImmutableEnum<KeyValue<K,V>>	EmptyTable.toReversed()
XGettingEnum<KeyValue<K,V>>	TableView.toReversed()
XGettingEnum<KeyValue<K,V>>	ConstHashTable.view(long lowIndex, long highIndex)
XGettingEnum<KeyValue<K,V>>	EmptyTable.view(long lowIndex, long highIndex)
XGettingEnum<KeyValue<K,V>>	EqConstHashTable.view(long lowIndex, long highIndex)
XGettingEnum<KeyValue<K,V>>	EqHashTable.view(long lowIndex, long highIndex)
XGettingEnum<KeyValue<K,V>>	HashTable.view(long lowIndex, long highIndex)
XGettingEnum<KeyValue<K,V>>	TableView.view(long lowIndex, long highIndex)

Methods in one.microstream.collections with parameters of type KeyValue

Modifier and Type	Method	Description
void	EqHashTable.accept(KeyValue<K,V> entry)
void	HashTable.accept(KeyValue<K,V> entry)
void	LockedMap.accept(KeyValue<K,V> element)
boolean	EqHashTable.add(KeyValue<K,V> entry)
boolean	HashTable.add(KeyValue<K,V> entry)
boolean	LockedMap.add(KeyValue<K,V> element)
EqHashTable<K,V>	EqHashTable.addAll(KeyValue<K,V>... elements)
EqHashTable<K,V>	EqHashTable.addAll(KeyValue<K,V>[] elements, int srcIndex, int srcLength)
HashTable<K,V>	HashTable.addAll(KeyValue<K,V>... elements)
HashTable<K,V>	HashTable.addAll(KeyValue<K,V>[] elements, int srcIndex, int srcLength)
XMap<K,V>	LockedMap.addAll(KeyValue<K,V>... elements)
XMap<K,V>	LockedMap.addAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
KeyValue<K,V>	EqHashTable.addGet(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.addGet(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.addGet(KeyValue<K,V> element)
boolean	ConstHashTable.contains(KeyValue<K,V> entry)
boolean	EmptyTable.contains(KeyValue<K,V> element)
boolean	EqConstHashTable.contains(KeyValue<K,V> entry)
boolean	EqHashTable.contains(KeyValue<K,V> entry)
boolean	HashTable.contains(KeyValue<K,V> entry)
boolean	LockedGettingMap.contains(KeyValue<K,V> element)
boolean	LockedMap.contains(KeyValue<K,V> element)
boolean	MapView.contains(KeyValue<K,V> element)
boolean	TableView.contains(KeyValue<K,V> element)
boolean	ConstHashTable.containsId(KeyValue<K,V> entry)
boolean	EmptyTable.containsId(KeyValue<K,V> element)
boolean	EqConstHashTable.containsId(KeyValue<K,V> entry)
boolean	EqHashTable.containsId(KeyValue<K,V> entry)
boolean	HashTable.containsId(KeyValue<K,V> entry)
boolean	LockedGettingMap.containsId(KeyValue<K,V> element)
boolean	LockedMap.containsId(KeyValue<K,V> element)
boolean	MapView.containsId(KeyValue<K,V> element)
boolean	TableView.containsId(KeyValue<K,V> element)
long	ConstHashTable.count(KeyValue<K,V> entry)
long	EmptyTable.count(KeyValue<K,V> element)
long	EqConstHashTable.count(KeyValue<K,V> entry)
long	EqHashTable.count(KeyValue<K,V> entry)
long	HashTable.count(KeyValue<K,V> entry)
long	LockedGettingMap.count(KeyValue<K,V> element)
long	LockedMap.count(KeyValue<K,V> element)
long	MapView.count(KeyValue<K,V> element)
long	TableView.count(KeyValue<K,V> element)
KeyValue<K,V>	EqHashTable.deduplicate(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.deduplicate(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.deduplicate(KeyValue<K,V> element)
long	ConstHashTable.indexOf(KeyValue<K,V> entry)
long	EmptyTable.indexOf(KeyValue<K,V> element)
long	EqConstHashTable.indexOf(KeyValue<K,V> entry)
long	EqHashTable.indexOf(KeyValue<K,V> entry)
long	HashTable.indexOf(KeyValue<K,V> entry)
long	TableView.indexOf(KeyValue<K,V> element)
boolean	EqHashTable.input(long index, KeyValue<K,V> element)
boolean	HashTable.input(long index, KeyValue<K,V> element)
long	EqHashTable.inputAll(long index, KeyValue<K,V>... elements)
long	EqHashTable.inputAll(long index, KeyValue<K,V>[] elements, int offset, int length)
long	HashTable.inputAll(long index, KeyValue<K,V>... elements)
long	HashTable.inputAll(long index, KeyValue<K,V>[] elements, int offset, int length)
boolean	EqHashTable.insert(long index, KeyValue<K,V> element)
boolean	HashTable.insert(long index, KeyValue<K,V> element)
long	EqHashTable.insertAll(long index, KeyValue<K,V>... elements)
long	EqHashTable.insertAll(long index, KeyValue<K,V>[] elements, int offset, int length)
long	HashTable.insertAll(long index, KeyValue<K,V>... elements)
long	HashTable.insertAll(long index, KeyValue<K,V>[] elements, int offset, int length)
long	ConstHashTable.lastIndexOf(KeyValue<K,V> entry)
long	EmptyTable.lastIndexOf(KeyValue<K,V> element)
long	EqConstHashTable.lastIndexOf(KeyValue<K,V> entry)
long	EqHashTable.lastIndexOf(KeyValue<K,V> entry)
long	HashTable.lastIndexOf(KeyValue<K,V> entry)
long	TableView.lastIndexOf(KeyValue<K,V> element)
static <K, V> MiniMap<K,V>	MiniMap.miniMap(KeyValue<? extends K,? extends V>... data)
static <K, V> ConstHashTable<K,V>	ConstHashTable.New(KeyValue<? extends K,? extends V>... entries)
static <K, V> EqConstHashTable<K,V>	EqConstHashTable.New(HashEqualator<? super K> hashEqualator, KeyValue<? extends K,? extends V>... entries)
static <K, V> EqConstHashTable<K,V>	EqConstHashTable.New(KeyValue<? extends K,? extends V>... entries)
static <K, V> EqHashTable<K,V>	EqHashTable.New(HashEqualator<? super K> hashEqualator, KeyValue<? extends K,? extends V>... entries)
static <K, V> EqHashTable<K,V>	EqHashTable.New(KeyValue<? extends K,? extends V>... entries)
static <K, V> HashTable<K,V>	HashTable.New(KeyValue<? extends K,? extends V>... entries)
static <K, V> ConstHashTable<K,V>	ConstHashTable.NewCustom(int initialHashLength, float hashDensity, KeyValue<? extends K,? extends V>... entries)
static <K, V> EqConstHashTable<K,V>	EqConstHashTable.NewCustom(int initialHashLength, float hashDensity, KeyValue<? extends K,? extends V>... entries)
static <K, V> EqConstHashTable<K,V>	EqConstHashTable.NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity, KeyValue<? extends K,? extends V>... entries)
static <K, V> EqHashTable<K,V>	EqHashTable.NewCustom(int initialHashLength, float hashDensity, KeyValue<? extends K,? extends V>... entries)
static <K, V> EqHashTable<K,V>	EqHashTable.NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity, KeyValue<? extends K,? extends V>... entries)
static <K, V> HashTable<K,V>	HashTable.NewCustom(long desiredCapacity, float hashDensity, KeyValue<? extends K,? extends V>... entries)
boolean	EqHashTable.prepend(KeyValue<K,V> element)
boolean	HashTable.prepend(KeyValue<K,V> element)
EqHashTable<K,V>	EqHashTable.prependAll(KeyValue<K,V>... elements)
EqHashTable<K,V>	EqHashTable.prependAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
HashTable<K,V>	HashTable.prependAll(KeyValue<K,V>... elements)
HashTable<K,V>	HashTable.prependAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
boolean	EqHashTable.preput(KeyValue<K,V> element)
boolean	HashTable.preput(KeyValue<K,V> element)
EqHashTable<K,V>	EqHashTable.preputAll(KeyValue<K,V>... elements)
EqHashTable<K,V>	EqHashTable.preputAll(KeyValue<K,V>[] elements, int offset, int length)
HashTable<K,V>	HashTable.preputAll(KeyValue<K,V>... elements)
HashTable<K,V>	HashTable.preputAll(KeyValue<K,V>[] elements, int offset, int length)
boolean	EqHashTable.put(KeyValue<K,V> entry)
boolean	HashTable.put(KeyValue<K,V> entry)
boolean	LockedMap.put(KeyValue<K,V> element)
EqHashTable<K,V>	EqHashTable.putAll(KeyValue<K,V>... elements)
EqHashTable<K,V>	EqHashTable.putAll(KeyValue<K,V>[] elements, int srcIndex, int srcLength)
HashTable<K,V>	HashTable.putAll(KeyValue<K,V>... elements)
HashTable<K,V>	HashTable.putAll(KeyValue<K,V>[] elements, int srcIndex, int srcLength)
XMap<K,V>	LockedMap.putAll(KeyValue<K,V>... elements)
XMap<K,V>	LockedMap.putAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
MiniMap<K,V>	MiniMap.putAll(KeyValue<K,V>... data)
KeyValue<K,V>	EqHashTable.putGet(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.putGet(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.putGet(KeyValue<K,V> element)
long	EqHashTable.remove(KeyValue<K,V> entry)
long	HashTable.remove(KeyValue<K,V> entry)
long	LockedMap.remove(KeyValue<K,V> element)
boolean	EqHashTable.removeOne(KeyValue<K,V> entry)
boolean	HashTable.removeOne(KeyValue<K,V> entry)
boolean	LockedMap.removeOne(KeyValue<K,V> element)
KeyValue<K,V>	EqHashTable.replace(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.replace(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.replace(KeyValue<K,V> element)
KeyValue<K,V>	EqHashTable.retrieve(KeyValue<K,V> entry)
KeyValue<K,V>	HashTable.retrieve(KeyValue<K,V> entry)
KeyValue<K,V>	LockedMap.retrieve(KeyValue<K,V> element)
KeyValue<K,V>	ConstHashTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	EmptyTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	EqConstHashTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	EqHashTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	HashTable.seek(KeyValue<K,V> sample)
KeyValue<K,V>	LockedGettingMap.seek(KeyValue<K,V> sample)
KeyValue<K,V>	LockedMap.seek(KeyValue<K,V> sample)
KeyValue<K,V>	MapView.seek(KeyValue<K,V> sample)
KeyValue<K,V>	TableView.seek(KeyValue<K,V> sample)
boolean	EqHashTable.set(long index, KeyValue<K,V> element)
EqHashTable<K,V>	EqHashTable.set(long index, KeyValue<K,V>[] elements, int offset, int length)
boolean	HashTable.set(long index, KeyValue<K,V> element)
HashTable<K,V>	HashTable.set(long index, KeyValue<K,V>[] elements, int offset, int length)
EqHashTable<K,V>	EqHashTable.setAll(long index, KeyValue<K,V>... elements)
HashTable<K,V>	HashTable.setAll(long index, KeyValue<K,V>... elements)
void	EqHashTable.setFirst(KeyValue<K,V> element)
void	HashTable.setFirst(KeyValue<K,V> element)
KeyValue<K,V>	EqHashTable.setGet(long index, KeyValue<K,V> element)
KeyValue<K,V>	HashTable.setGet(long index, KeyValue<K,V> element)
void	EqHashTable.setLast(KeyValue<K,V> element)
void	HashTable.setLast(KeyValue<K,V> element)

Method parameters in one.microstream.collections with type arguments of type KeyValue

Modifier and Type	Method	Description
EqHashTable<K,V>	EqHashTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements)
HashTable<K,V>	HashTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XMap<K,V>	LockedMap.addAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	ConstHashTable.applies(Predicate<? super KeyValue<K,V>> predicate)
boolean	EmptyTable.applies(Predicate<? super KeyValue<K,V>> predicate)
boolean	EqConstHashTable.applies(Predicate<? super KeyValue<K,V>> predicate)
boolean	EqHashTable.applies(Predicate<? super KeyValue<K,V>> predicate)
boolean	HashTable.applies(Predicate<? super KeyValue<K,V>> predicate)
boolean	LockedGettingMap.applies(Predicate<? super KeyValue<K,V>> predicate)
boolean	LockedMap.applies(Predicate<? super KeyValue<K,V>> predicate)
boolean	MapView.applies(Predicate<? super KeyValue<K,V>> predicate)
boolean	TableView.applies(Predicate<? super KeyValue<K,V>> predicate)
boolean	ConstHashTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	EmptyTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	EqConstHashTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	EqHashTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	HashTable.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	LockedGettingMap.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	LockedMap.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	MapView.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	TableView.containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean	ConstHashTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate)
boolean	EmptyTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate)
boolean	EqConstHashTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate)
boolean	EqHashTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate)
boolean	HashTable.containsSearched(Predicate<? super KeyValue<K,V>> predicate)
boolean	LockedGettingMap.containsSearched(Predicate<? super KeyValue<K,V>> predicate)
boolean	LockedMap.containsSearched(Predicate<? super KeyValue<K,V>> predicate)
boolean	MapView.containsSearched(Predicate<? super KeyValue<K,V>> predicate)
boolean	TableView.containsSearched(Predicate<? super KeyValue<K,V>> predicate)
long	ConstHashTable.countBy(Predicate<? super KeyValue<K,V>> predicate)
long	EmptyTable.countBy(Predicate<? super KeyValue<K,V>> predicate)
long	EqConstHashTable.countBy(Predicate<? super KeyValue<K,V>> predicate)
long	EqHashTable.countBy(Predicate<? super KeyValue<K,V>> predicate)
long	HashTable.countBy(Predicate<? super KeyValue<K,V>> predicate)
long	LockedGettingMap.countBy(Predicate<? super KeyValue<K,V>> predicate)
long	LockedMap.countBy(Predicate<? super KeyValue<K,V>> predicate)
long	MapView.countBy(Predicate<? super KeyValue<K,V>> predicate)
long	TableView.countBy(Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.distinct(C target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.distinct(T target, Equalator<? super KeyValue<K,V>> equalator)
boolean	ConstHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	ConstHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EmptyTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EmptyTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EqConstHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EqConstHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EqHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EqHashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	HashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	HashTable.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	LockedGettingMap.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	LockedGettingMap.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	LockedMap.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	LockedMap.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	MapView.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	MapView.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	TableView.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	TableView.equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	ConstHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	ConstHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EmptyTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EmptyTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EqConstHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EqConstHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EqHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	EqHashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	HashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	HashTable.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	LockedGettingMap.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	LockedGettingMap.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	LockedMap.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	LockedMap.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	MapView.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	MapView.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	TableView.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
boolean	TableView.equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.filterTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)
void	LockedGettingMap.forEach(Consumer<? super KeyValue<K,V>> action)
void	LockedMap.forEach(Consumer<? super KeyValue<K,V>> action)
long	ConstHashTable.indexBy(Predicate<? super KeyValue<K,V>> predicate)
long	EmptyTable.indexBy(Predicate<? super KeyValue<K,V>> predicate)
long	EqConstHashTable.indexBy(Predicate<? super KeyValue<K,V>> predicate)
long	EqHashTable.indexBy(Predicate<? super KeyValue<K,V>> predicate)
long	HashTable.indexBy(Predicate<? super KeyValue<K,V>> predicate)
long	TableView.indexBy(Predicate<? super KeyValue<K,V>> predicate)
long	EqHashTable.inputAll(long index, XGettingCollection<? extends KeyValue<K,V>> elements)
long	HashTable.inputAll(long index, XGettingCollection<? extends KeyValue<K,V>> elements)
long	EqHashTable.insertAll(long index, XGettingCollection<? extends KeyValue<K,V>> elements)
long	HashTable.insertAll(long index, XGettingCollection<? extends KeyValue<K,V>> elements)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
boolean	ConstHashTable.isSorted(Comparator<? super KeyValue<K,V>> comparator)
boolean	EmptyTable.isSorted(Comparator<? super KeyValue<K,V>> comparator)
boolean	EqConstHashTable.isSorted(Comparator<? super KeyValue<K,V>> comparator)
boolean	EqHashTable.isSorted(Comparator<? super KeyValue<K,V>> comparator)
boolean	HashTable.isSorted(Comparator<? super KeyValue<K,V>> comparator)
boolean	TableView.isSorted(Comparator<? super KeyValue<K,V>> comparator)
int	HashMapIdObject.iterate(Consumer<? super KeyValue<Long,E>> procedure)
<A> A	ConstHashTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
<A> A	EmptyTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
<A> A	EqConstHashTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
<A> A	EqHashTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
<A> A	HashTable.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
<A> A	LockedGettingMap.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
<A> A	LockedMap.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
<A> A	MapView.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
<A> A	TableView.join(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)
long	ConstHashTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate)
long	EmptyTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate)
long	EqConstHashTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate)
long	EqHashTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate)
long	HashTable.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate)
long	TableView.lastIndexBy(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	ConstHashTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EmptyTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EqConstHashTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EqHashTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	HashTable.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	LockedGettingMap.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	LockedMap.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	MapView.max(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	TableView.max(Comparator<? super KeyValue<K,V>> comparator)
long	ConstHashTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator)
long	EmptyTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator)
long	EqConstHashTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator)
long	EqHashTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator)
long	HashTable.maxIndex(Comparator<? super KeyValue<K,V>> comparator)
long	TableView.maxIndex(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	ConstHashTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EmptyTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EqConstHashTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	EqHashTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	HashTable.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	LockedGettingMap.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	LockedMap.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	MapView.min(Comparator<? super KeyValue<K,V>> comparator)
KeyValue<K,V>	TableView.min(Comparator<? super KeyValue<K,V>> comparator)
long	ConstHashTable.minIndex(Comparator<? super KeyValue<K,V>> comparator)
long	EmptyTable.minIndex(Comparator<? super KeyValue<K,V>> comparator)
long	EqConstHashTable.minIndex(Comparator<? super KeyValue<K,V>> comparator)
long	EqHashTable.minIndex(Comparator<? super KeyValue<K,V>> comparator)
long	HashTable.minIndex(Comparator<? super KeyValue<K,V>> comparator)
long	TableView.minIndex(Comparator<? super KeyValue<K,V>> comparator)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.moveTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.moveTo(C target, Predicate<? super KeyValue<K,V>> predicate)
<C extends Consumer<? super KeyValue<K, V>>> C	LockedMap.moveTo(C target, Predicate<? super KeyValue<K,V>> predicate)
static <K, V> ConstHashTable<K,V>	ConstHashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> EqConstHashTable<K,V>	EqConstHashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <V0, K, V> EqConstHashTable<K,V>	EqConstHashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V0>> entries, Function<? super V0,V> mapper)
static <K, V> EqConstHashTable<K,V>	EqConstHashTable.New(HashEqualator<? super K> hashEqualator, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> EqHashTable<K,V>	EqHashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> EqHashTable<K,V>	EqHashTable.New(HashEqualator<? super K> hashEqualator, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> HashTable<K,V>	HashTable.New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> ConstHashTable<K,V>	ConstHashTable.NewCustom(int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> EqConstHashTable<K,V>	EqConstHashTable.NewCustom(int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> EqConstHashTable<K,V>	EqConstHashTable.NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> EqHashTable<K,V>	EqHashTable.NewCustom(int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> EqHashTable<K,V>	EqHashTable.NewCustom(HashEqualator<? super K> hashEqualator, int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <K, V> HashTable<K,V>	HashTable.NewCustom(int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)
static <KI, VI, KO, VO> ConstHashTable<KO,VO>	ConstHashTable.NewProjected(float hashDensity, XGettingCollection<? extends KeyValue<KI,VI>> entries, Function<? super KI,KO> keyProjector, Function<? super VI,VO> valueProjector)
static <KO, VO, KI extends KO, VI extends VO> ConstHashTable<KO,VO>	ConstHashTable.NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries)
static <KI, VI, KO, VO> ConstHashTable<KO,VO>	ConstHashTable.NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries, Function<? super KI,KO> keyProjector, Function<? super VI,VO> valueProjector)
static <K, V, K1, V1> EqConstHashTable<K1,V1>	EqConstHashTable.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>	EqConstHashTable.NewProjected(XGettingCollection<? extends KeyValue<K,V>> entries, Function<? super K,K1> keyProjector, Function<? super V,V1> valueProjector)
static <KI, VI, KO, VO> HashTable<KO,VO>	HashTable.NewProjected(float hashDensity, XGettingCollection<? extends KeyValue<KI,VI>> entries, Function<? super KI,KO> keyProjector, Function<? super VI,VO> valueProjector)
static <KO, VO, KI extends KO, VI extends VO> HashTable<KO,VO>	HashTable.NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries)
static <KI, VI, KO, VO> HashTable<KO,VO>	HashTable.NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries, Function<? super KI,KO> keyProjector, Function<? super VI,VO> valueProjector)
EqHashTable<K,V>	EqHashTable.prependAll(XGettingCollection<? extends KeyValue<K,V>> elements)
HashTable<K,V>	HashTable.prependAll(XGettingCollection<? extends KeyValue<K,V>> elements)
EqHashTable<K,V>	EqHashTable.preputAll(XGettingCollection<? extends KeyValue<K,V>> elements)
HashTable<K,V>	HashTable.preputAll(XGettingCollection<? extends KeyValue<K,V>> elements)
EqHashTable<K,V>	EqHashTable.putAll(XGettingCollection<? extends KeyValue<K,V>> elements)
HashTable<K,V>	HashTable.putAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XSet<KeyValue<K,V>>	LockedMap.putAll(XGettingCollection<? extends KeyValue<K,V>> elements)
long	EqHashTable.removeAll(XGettingCollection<? extends KeyValue<K,V>> elements)
long	HashTable.removeAll(XGettingCollection<? extends KeyValue<K,V>> elements)
long	LockedMap.removeAll(XGettingCollection<? extends KeyValue<K,V>> elements)
long	EqHashTable.removeBy(Predicate<? super KeyValue<K,V>> predicate)
long	HashTable.removeBy(Predicate<? super KeyValue<K,V>> predicate)
long	LockedMap.removeBy(Predicate<? super KeyValue<K,V>> predicate)
long	EqHashTable.removeDuplicates(Equalator<? super KeyValue<K,V>> equalator)
long	HashTable.removeDuplicates(Equalator<? super KeyValue<K,V>> equalator)
long	LockedMap.removeDuplicates(Equalator<? super KeyValue<K,V>> equalator)
long	EqHashTable.retainAll(XGettingCollection<? extends KeyValue<K,V>> elements)
long	HashTable.retainAll(XGettingCollection<? extends KeyValue<K,V>> elements)
long	LockedMap.retainAll(XGettingCollection<? extends KeyValue<K,V>> elements)
KeyValue<K,V>	EqHashTable.retrieveBy(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	HashTable.retrieveBy(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	LockedMap.retrieveBy(Predicate<? super KeyValue<K,V>> predicate)
long	ConstHashTable.scan(Predicate<? super KeyValue<K,V>> predicate)
long	EmptyTable.scan(Predicate<? super KeyValue<K,V>> predicate)
long	EqConstHashTable.scan(Predicate<? super KeyValue<K,V>> predicate)
long	EqHashTable.scan(Predicate<? super KeyValue<K,V>> predicate)
long	HashTable.scan(Predicate<? super KeyValue<K,V>> predicate)
long	TableView.scan(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	ConstHashTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	EmptyTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	EqConstHashTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	EqHashTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	HashTable.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	LockedGettingMap.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	LockedMap.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	MapView.search(Predicate<? super KeyValue<K,V>> predicate)
KeyValue<K,V>	TableView.search(Predicate<? super KeyValue<K,V>> predicate)
EqHashTable<K,V>	EqHashTable.set(long index, XGettingSequence<? extends KeyValue<K,V>> elements, long offset, long length)
HashTable<K,V>	HashTable.set(long index, XGettingSequence<? extends KeyValue<K,V>> elements, long offset, long length)
EqHashTable<K,V>	EqHashTable.sort(Comparator<? super KeyValue<K,V>> comparator)
HashTable<K,V>	HashTable.sort(Comparator<? super KeyValue<K,V>> comparator)
long	EqHashTable.substitute(Function<? super KeyValue<K,V>,? extends KeyValue<K,V>> mapper)
long	EqHashTable.substitute(Function<? super KeyValue<K,V>,? extends KeyValue<K,V>> mapper)
long	HashTable.substitute(Function<? super KeyValue<K,V>,? extends KeyValue<K,V>> mapper)
long	HashTable.substitute(Function<? super KeyValue<K,V>,? extends KeyValue<K,V>> mapper)
KeyValue<K,V>[]	ConstHashTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	EmptyTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	EqConstHashTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	EqHashTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	HashTable.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	LockedGettingMap.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	LockedMap.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	MapView.toArray(Class<KeyValue<K,V>> type)
KeyValue<K,V>[]	TableView.toArray(Class<KeyValue<K,V>> type)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	ConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	EmptyTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqConstHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	EqHashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<C extends Consumer<? super KeyValue<K, V>>> C	HashTable.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedGettingMap.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	LockedMap.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	MapView.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)
<T extends Consumer<? super KeyValue<K, V>>> T	TableView.union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)

Constructors in one.microstream.collections with parameters of type KeyValue

Constructor	Description
ConstMiniMap(KeyValue<K,V>... data)
MiniMap(int initialCapacity, KeyValue<? extends K,? extends V>... data)

Constructor parameters in one.microstream.collections with type arguments of type KeyValue

Constructor	Description
AbstractChainKeyValueStorage(AbstractChainCollection<KeyValue<K,V>,K,V,EN> parent, EN head)
ChainStrongStrongStorage(AbstractChainCollection<KeyValue<K,V>,K,V,EN> parent, EN head)

Uses of KeyValue in one.microstream.collections.interfaces

Classes in one.microstream.collections.interfaces with type parameters of type KeyValue

Modifier and Type	Interface	Description
interface	ChainKeyValueStorage<K,V,EN extends AbstractChainEntry<KeyValue<K,V>,K,V,EN>>

Methods in one.microstream.collections.interfaces that return types with arguments of type KeyValue

Modifier and Type	Method	Description
XGettingList<KeyValue<Integer,Integer>>	HashCollection.Analysis.getChainLengthDistribution()

Constructor parameters in one.microstream.collections.interfaces with type arguments of type KeyValue

Constructor	Description
Analysis(H subject, int size, float hashDensity, int slotCount, int shortestEntryChainLength, int longestEntryChainLength, int distributionRange, XGettingList<KeyValue<Integer,Integer>> chainLengthDistribution)

Uses of KeyValue in one.microstream.collections.old

Methods in one.microstream.collections.old with parameters of type KeyValue

Modifier and Type	Method	Description
static <K, V> HashMap<K,V>	OldCollections.OldHashMap(KeyValue<? extends K,? extends V>... keyValueTuples)

Uses of KeyValue in one.microstream.collections.sorting

Methods in one.microstream.collections.sorting with parameters of type KeyValue

Modifier and Type	Method	Description
XChart<K,V>	XChart.addAll(KeyValue<K,V>... elements)
XChart<K,V>	XChart.addAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
XChart<K,V>	XChart.putAll(KeyValue<K,V>... elements)
XChart<K,V>	XChart.putAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)

Method parameters in one.microstream.collections.sorting with type arguments of type KeyValue

Modifier and Type	Method	Description
XChart<K,V>	XChart.addAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XChart<K,V>	XChart.putAll(XGettingCollection<? extends KeyValue<K,V>> elements)

Uses of KeyValue in one.microstream.collections.types

Methods in one.microstream.collections.types with type parameters of type KeyValue

Modifier and Type	Method	Description
<PIE extends Consumer<? super KeyValue<K2, V>>> PIE	XGetting2DMap.iterateInnerEntries(PIE procedure)

Methods in one.microstream.collections.types that return KeyValue

Modifier and Type	Method	Description
KeyValue<K,V>	XAddGetMap.addGet(K key, V value)
KeyValue<K,V>	XGettingMap.lookup(K key)
KeyValue<K,V>	XMap.putGet(K key, V value)	Ensures the passed key and value to be contained as an entry in the map.
KeyValue<K,V>	XPutGetMap.putGet(K key, V value)	Ensures the passed key and value to be contained as an entry in the map.
KeyValue<K,V>	XPutGetMap.replace(K key, V value)
KeyValue<K,V>	XMap.setGet(K key, V value)	Sets the passed key and value to an appropriate entry if one can be found.
KeyValue<K,V>	XAddGetMap.substitute(K key, V value)

Methods in one.microstream.collections.types with parameters of type KeyValue

Modifier and Type	Method	Description
XAddingTable<K,V>	XAddingTable.addAll(KeyValue<K,V>... elements)
XAddingTable<K,V>	XAddingTable.addAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
XBasicTable<K,V>	XBasicTable.addAll(KeyValue<K,V>... elements)
XBasicTable<K,V>	XBasicTable.addAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
XMap<K,V>	XMap.addAll(KeyValue<K,V>... elements)
XMap<K,V>	XMap.addAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
XTable<K,V>	XTable.addAll(KeyValue<K,V>... elements)
XTable<K,V>	XTable.addAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
XBasicTable<K,V>	XBasicTable.putAll(KeyValue<K,V>... elements)
XBasicTable<K,V>	XBasicTable.putAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
XMap<K,V>	XMap.putAll(KeyValue<K,V>... elements)
XMap<K,V>	XMap.putAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)
XTable<K,V>	XTable.putAll(KeyValue<K,V>... elements)
XTable<K,V>	XTable.putAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)

Method parameters in one.microstream.collections.types with type arguments of type KeyValue

Modifier and Type	Method	Description
XAddingTable<K,V>	XAddingTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XBasicTable<K,V>	XBasicTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XMap<K,V>	XMap.addAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XTable<K,V>	XTable.addAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XBasicTable<K,V>	XBasicTable.putAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XTable<K,V>	XTable.putAll(XGettingCollection<? extends KeyValue<K,V>> elements)
XTable<K,V>	XTable.sort(Comparator<? super KeyValue<K,V>> comparator)

Uses of KeyValue in one.microstream.hashing

Methods in one.microstream.hashing with type parameters of type KeyValue

Modifier and Type	Method	Description
static <KV extends KeyValue<?, ?>> HashEqualator<KV>	XHashing.keyValueHashEqualityKeyIdentity()

Methods in one.microstream.hashing that return types with arguments of type KeyValue

Modifier and Type	Method	Description
static <K, V> HashEqualator<KeyValue<K,V>>	XHashing.wrapAsKeyValue(HashEqualator<? super K> hashEqualator)	Wrappers the passed HashEqualator instance as a KeyValue HashEqualator instance, using the KeyValue instance's key as the hash element.

Uses of KeyValue in one.microstream.persistence.binary.types

Method parameters in one.microstream.persistence.binary.types with type arguments of type KeyValue

Modifier and Type	Method	Description
void	Binary.storeKeyValuesAsEntries(long typeId, long objectId, long headerOffset, Iterable<? extends KeyValue<?,?>> keyValues, long size, PersistenceFunction persister)
void	Binary.storeKeyValuesAsEntries(long offset, PersistenceFunction persister, Iterable<? extends KeyValue<?,?>> elements, long elementCount)

Uses of KeyValue in one.microstream.persistence.types

Methods in one.microstream.persistence.types that return KeyValue

Modifier and Type	Method	Description
KeyValue<String,String>	PersistenceRefactoringMapping.Default.lookup(String key)
KeyValue<String,String>	PersistenceRefactoringMapping.lookup(String key)
KeyValue<String,String>	PersistenceTypeDescriptionResolver.Default.lookup(String sourceIdentifier)
KeyValue<String,String>	PersistenceTypeDescriptionResolver.lookup(String sourceIdentifier)	Returns a key-value pair with the passed source identifier as the key and a mapped target identifier as the value.
static KeyValue<String,String>	PersistenceTypeNameMapper.Defaults.microstreamMapping(String s1, String s2)
KeyValue<PersistenceTypeDefinitionMember,PersistenceTypeDefinitionMember>	PersistenceTypeDescriptionResolver.Default.resolveMember(PersistenceTypeDefinition sourceType, PersistenceTypeDefinitionMember sourceMember, PersistenceTypeDefinition targetType)
KeyValue<PersistenceTypeDefinitionMember,PersistenceTypeDefinitionMember>	PersistenceTypeDescriptionResolver.resolveMember(PersistenceTypeDefinition sourceType, PersistenceTypeDefinitionMember sourceMember, PersistenceTypeDefinition targetType)	Returns a key-value pair with the passed source member as the key and a mapped target member as the value.
static KeyValue<String,String>	PersistenceTypeDictionary.splitFullQualifiedFieldName(String identifier)

Methods in one.microstream.persistence.types that return types with arguments of type KeyValue

Modifier and Type	Method	Description
static XGettingSequence<KeyValue<String,String>>	Persistence.parseRefactoringMappings(StringTable stringTable)
static XGettingSequence<KeyValue<String,String>>	Persistence.readRefactoringMappings(File file)	Deprecated. replaced by Persistence.readRefactoringMappings(Path)
static XGettingSequence<KeyValue<String,String>>	Persistence.readRefactoringMappings(String string)
static XGettingSequence<KeyValue<String,String>>	Persistence.readRefactoringMappings(String string, char valueSeparator)
static XGettingSequence<KeyValue<String,String>>	Persistence.readRefactoringMappings(String string, XCsvConfiguration configuration)
static XGettingSequence<KeyValue<String,String>>	Persistence.readRefactoringMappings(String string, XCsvDataType dataType)
static XGettingSequence<KeyValue<String,String>>	Persistence.readRefactoringMappings(Path file)
static XGettingSequence<KeyValue<String,String>>	Persistence.readRefactoringMappings(AFile file)

Method parameters in one.microstream.persistence.types with type arguments of type KeyValue

Modifier and Type	Method	Description
static PersistenceRefactoringMappingProvider	PersistenceRefactoringMappingProvider.New(Iterable<? extends KeyValue<String,String>> entries)	Quick provisional documentation:
static PersistenceRefactoringMappingProvider	PersistenceRefactoringMappingProvider.New(XGettingSequence<KeyValue<String,String>> entries)	Quick provisional documentation:
static PersistenceRefactoringMappingProvider	Persistence.RefactoringMapping(XGettingSequence<KeyValue<String,String>> refactoringMappings)

Uses of KeyValue in one.microstream.storage.types

Methods in one.microstream.storage.types that return KeyValue

Modifier and Type	Method	Description
KeyValue<Long,Long>	StorageChannel.Default.exportTypeEntities(StorageEntityTypeHandler type, AWritableFile file)
KeyValue<Long,Long>	StorageChannel.Default.exportTypeEntities(StorageEntityTypeHandler type, AWritableFile file, Predicate<? super StorageEntity> predicateEntity)
KeyValue<Long,Long>	StorageChannel.exportTypeEntities(StorageEntityTypeHandler type, AWritableFile file)
KeyValue<Long,Long>	StorageChannel.exportTypeEntities(StorageEntityTypeHandler type, AWritableFile file, Predicate<? super StorageEntity> predicateEntity)
KeyValue<ByteBuffer[],long[]>	StorageChannel.Default.storeEntities(long timestamp, Chunk chunkData)
KeyValue<ByteBuffer[],long[]>	StorageChannel.storeEntities(long timestamp, Chunk chunkData)

Method parameters in one.microstream.storage.types with type arguments of type KeyValue

Modifier and Type	Method	Description
static StorageIdAnalysis	StorageIdAnalysis.New(XGettingSequence<KeyValue<Persistence.IdType,Long>> values, XGettingEnum<Long> occuringTypeIds)

Uses of KeyValue in one.microstream.typing

Classes in one.microstream.typing that implement KeyValue

Modifier and Type	Class	Description
static class	KeyValue.Default<K,V>

Methods in one.microstream.typing that return KeyValue

Modifier and Type	Method	Description
static <K, V> KeyValue<K,V>	KeyValue.New(K key, V value)

Uses of KeyValue in one.microstream.util.cql

Methods in one.microstream.util.cql that return types with arguments of type KeyValue

Modifier and Type	Method	Description
static <K, V> CqlResultor<KeyValue<K,V>,EqHashTable<K,V>>	CQL.resultingEqHashTable()
static <K, V> CqlResultor<KeyValue<K,V>,EqHashTable<K,V>>	CQL.resultingEqHashTable(HashEqualator<? super K> hashEqualator)
static <K, V> CqlResultor<KeyValue<K,V>,HashTable<K,V>>	CQL.resultingHashTable()

Uses of KeyValue in one.microstream.util.xcsv

Methods in one.microstream.util.xcsv that return types with arguments of type KeyValue

Modifier and Type	Method	Description
XGettingSequence<? extends KeyValue<String,StringTable>>	XCsvContent.Default.segments()
XGettingSequence<? extends KeyValue<String,StringTable>>	XCsvContent.segments()

Method parameters in one.microstream.util.xcsv with type arguments of type KeyValue

Modifier and Type	Method	Description
static XCsvContent.Default	XCsvContent.Default.New(String name, XGettingSequence<? extends KeyValue<String,StringTable>> segments, XCsvConfiguration configuration)