Class HashTable<K,V>
- Type Parameters:
K- type of contained keysV- type of contained values
- All Implemented Interfaces:
Iterable<KeyValue<K,V>>,Consumer<KeyValue<K,V>>,CapacityCarrying,CapacityExtendable,ConsolidatableCollection,ExtendedCollection<KeyValue<K,V>>,ExtendedMap<K,V>,ExtendedSequence<KeyValue<K,V>>,HashCollection<K>,OptimizableCollection,ReleasingCollection<KeyValue<K,V>>,Sized,Truncateable,Sortable<KeyValue<K,V>>,SortableProcedure<KeyValue<K,V>>,XAddGetCollection<KeyValue<K,V>>,XAddGetMap<K,V>,XAddGetSet<KeyValue<K,V>>,XAddingCollection<KeyValue<K,V>>,XAddingEnum<KeyValue<K,V>>,XAddingMap<K,V>,XAddingSequence<KeyValue<K,V>>,XAddingSet<KeyValue<K,V>>,XAddingTable<K,V>,XBasicEnum<KeyValue<K,V>>,XBasicSequence<KeyValue<K,V>>,XBasicTable<K,V>,XCollection<KeyValue<K,V>>,XDecreasingEnum<KeyValue<K,V>>,XDecreasingSequence<KeyValue<K,V>>,XEnum<KeyValue<K,V>>,XExpandingEnum<KeyValue<K,V>>,XExpandingSequence<KeyValue<K,V>>,XExtendingEnum<KeyValue<K,V>>,XExtendingSequence<KeyValue<K,V>>,XGettingCollection<KeyValue<K,V>>,XGettingEnum<KeyValue<K,V>>,XGettingMap<K,V>,XGettingSequence<KeyValue<K,V>>,XGettingSet<KeyValue<K,V>>,XGettingTable<K,V>,XIncreasingEnum<KeyValue<K,V>>,XIncreasingSequence<KeyValue<K,V>>,XIndexIterable<KeyValue<K,V>>,XInputtingEnum<KeyValue<K,V>>,XInputtingSequence<KeyValue<K,V>>,XInsertingEnum<KeyValue<K,V>>,XInsertingSequence<KeyValue<K,V>>,XIterable<KeyValue<K,V>>,XJoinable<KeyValue<K,V>>,XMap<K,V>,XOrderingEnum<KeyValue<K,V>>,XOrderingSequence<KeyValue<K,V>>,XPrependingEnum<KeyValue<K,V>>,XPrependingSequence<KeyValue<K,V>>,XPreputtingEnum<KeyValue<K,V>>,XPreputtingSequence<KeyValue<K,V>>,XProcessingCollection<KeyValue<K,V>>,XProcessingEnum<KeyValue<K,V>>,XProcessingMap<K,V>,XProcessingSequence<KeyValue<K,V>>,XProcessingSet<KeyValue<K,V>>,XPutGetCollection<KeyValue<K,V>>,XPutGetEnum<KeyValue<K,V>>,XPutGetMap<K,V>,XPutGetSequence<KeyValue<K,V>>,XPutGetSet<KeyValue<K,V>>,XPuttingCollection<KeyValue<K,V>>,XPuttingEnum<KeyValue<K,V>>,XPuttingMap<K,V>,XPuttingSequence<KeyValue<K,V>>,XPuttingSet<KeyValue<K,V>>,XRemovingCollection<KeyValue<K,V>>,XRemovingEnum<KeyValue<K,V>>,XRemovingMap<K,V>,XRemovingSequence<KeyValue<K,V>>,XRemovingSet<KeyValue<K,V>>,XReplacingCollection<KeyValue<K,V>>,XSequence<KeyValue<K,V>>,XSet<KeyValue<K,V>>,XSettingEnum<KeyValue<K,V>>,XSettingSequence<KeyValue<K,V>>,XSortableEnum<KeyValue<K,V>>,XSortableSequence<KeyValue<K,V>>,XTable<K,V>,IdentityEqualityLogic,Processable<KeyValue<K,V>>,Clearable,Composition,Copyable
public final class HashTable<K,V> extends AbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V>> implements XTable<K,V>, HashCollection<K>, Composition, IdentityEqualityLogic
Map.
In contrast to EqHashTable this implementation uses the default isSame-Equalator(Equalator.identity()
and the Java hashCode implementation System.identityHashCode(Object).
This implementation is not synchronized and thus should only be used by a
single thread or in a thread-safe manner (i.e. read-only as soon as multiple threads access it).
See SynchSet wrapper class to use a list in a synchronized manner.
Also note that by being an extended collection, this implementation offers various functional and batch procedures
to maximize internal iteration potential, eliminating the need to use the ill-conceived external iteration
Iterator paradigm.
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static interfaceHashTable.Creator<K,V>classHashTable.KeysclassHashTable.OldVarMapclassHashTable.ValuesNested classes/interfaces inherited from interface one.microstream.collections.interfaces.HashCollection
HashCollection.Analysis<H>Nested classes/interfaces inherited from interface one.microstream.collections.types.XBasicSequence
XBasicSequence.Factory<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XGettingSequence
XGettingSequence.Factory<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XIncreasingEnum
XIncreasingEnum.Factory<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XIterable
XIterable.Executor<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XProcessingSequence
XProcessingSequence.Factory<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XProcessingSet
XProcessingSet.Factory<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XPutGetSequence
XPutGetSequence.Factory<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XPutGetSet
XPutGetSet.Factory<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XRemovingEnum
XRemovingEnum.Factory<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XRemovingMap
XRemovingMap.Factory<K,V>Nested classes/interfaces inherited from interface one.microstream.collections.types.XSet
XSet.Factory<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XTable
XTable.Bridge<K,V>, XTable.EntriesBridge<K,V>, XTable.Satellite<K,V> -
Field Summary
Fields inherited from interface one.microstream.collections.interfaces.HashCollection
DEFAULT_HASH_FACTOR, DEFAULT_HASH_LENGTH -
Method Summary
Modifier and Type Method Description voidaccept(KeyValue<K,V> entry)booleanadd(K key, V value)Adds the passed key and value as an entry if key is not yet contained.booleanadd(KeyValue<K,V> entry)Adds the passed element.HashTable<K,V>addAll(XGettingCollection<? extends KeyValue<K,V>> elements)HashTable<K,V>addAll(KeyValue<K,V>... elements)HashTable<K,V>addAll(KeyValue<K,V>[] elements, int srcIndex, int srcLength)KeyValue<K,V>addGet(K key, V value)KeyValue<K,V>addGet(KeyValue<K,V> entry)HashCollection.Analysis<HashTable<K,V>>analyze()booleanapplies(Predicate<? super KeyValue<K,V>> predicate)Tests each element of the collection on the given predicate.KeyValue<K,V>at(long index)voidclear()Clears all elements from the collection while leaving the capacity as it is.longconsolidate()Consolidates the internal storage of this collection by discarding all elements of the internal storage that have become obsolete or otherwise unneeded anymore.booleancontains(KeyValue<K,V> entry)Checks if the given element is contained in the collection.booleancontainsAll(XGettingCollection<? extends KeyValue<K,V>> elements)booleancontainsId(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 asXGettingCollection.containsSearched(Predicate)with aPredicateimplementation that checks for object identity.booleancontainsSearched(Predicate<? super KeyValue<K,V>> predicate)HashTable<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>>>
TcopySelection(T target, long... indices)Iterates through all the elements of the given indices and calls theConsumer.accept(Object)on the targetConsumer.<C extends Consumer<? super KeyValue<K, V>>>
CcopyTo(C target)CallsConsumer.accept(Object)on the targetConsumerfor all the elements of this collection.longcount(KeyValue<K,V> entry)Count how many times this element matches another element in the collection using theEqualator.longcountBy(Predicate<? super KeyValue<K,V>> predicate)Count how many matches are found using the given predicate on each element of the collection.longcurrentCapacity()Returns the current amount of elements this instance can hold before a storage rebuild becomes necessary.KeyValue<K,V>deduplicate(KeyValue<K,V> entry)<C extends Consumer<? super KeyValue<K, V>>>
Cdistinct(C target)CallsConsumer.accept(Object)on the targetConsumerfor all the unique/distinct elements of this collection.<C extends Consumer<? super KeyValue<K, V>>>
Cdistinct(C target, Equalator<? super KeyValue<K,V>> equalator)CallsConsumer.accept(Object)on the targetConsumerfor all the unique/distinct elements of this collection.Vensure(K key, Function<? super K,V> valueProvider)Ensures that this map instance contains a non-null value for the passed key and returns that value.CapacityExtendableensureCapacity(long minimalCapacity)CapacityExtendableensureFreeCapacity(long requiredFreeCapacity)Ensures that the next minimalFreeCapacity elements can be actually added in a fast way, meaning for example no internal storage rebuild will be necessary.HashEqualator<KeyValue<K,V>>equality()booleanequals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)booleanequalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)Returnstrueif 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>>>
Cexcept(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)CallsConsumer.accept(Object)on the targetConsumerfor each element of this collection that is not contained in the other collection (through the given equalator).KeyValue<K,V>fetch()<C extends Consumer<? super KeyValue<K, V>>>
CfilterTo(C target, Predicate<? super KeyValue<K,V>> predicate)CallsConsumer.accept(Object)on the targetConsumerfor all the elements of this collection which testtrueon the given predicate.KeyValue<K,V>first()Gets first element or throwsIndexOutOfBoundsExceptionif the collection is empty.KeyValue<K,V>get()Gets one element from the collection.Vget(K key)protected AbstractChainKeyValueStorage<K,V,one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V>>getInternalStorageChain()floathashDensity()inthashDistributionRange()HashEqualator<K>hashEquality()booleanhasVolatileElements()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.booleanhasVolatileHashElements()booleanhasVolatileValues()ConstHashTable<K,V>immure()Provides an instance of an immutable collection type with equal behavior and data as this instance.longindexBy(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.longindexOf(KeyValue<K,V> entry)booleaninput(long index, KeyValue<K,V> element)longinputAll(long index, XGettingCollection<? extends KeyValue<K,V>> elements)longinputAll(long index, KeyValue<K,V>... elements)longinputAll(long index, KeyValue<K,V>[] elements, int offset, int length)booleaninsert(long index, KeyValue<K,V> element)longinsertAll(long index, XGettingCollection<? extends KeyValue<K,V>> elements)longinsertAll(long index, KeyValue<K,V>... elements)longinsertAll(long index, KeyValue<K,V>[] elements, int offset, int length)protected intinternalClear()protected intinternalCountingAddAll(XGettingCollection<? extends KeyValue<K,V>> elements)protected intinternalCountingAddAll(KeyValue<K,V>[] elements)protected intinternalCountingAddAll(KeyValue<K,V>[] elements, int offset, int length)protected intinternalCountingPutAll(XGettingCollection<? extends KeyValue<K,V>> elements)protected intinternalCountingPutAll(KeyValue<K,V>[] elements)protected intinternalCountingPutAll(KeyValue<K,V>[] elements, int offset, int length)protected voidinternalRemoveEntry(one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V> entry)protected intinternalRemoveNullEntries()<C extends Consumer<? super KeyValue<K, V>>>
Cintersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)Tests equality between each element of the two lists and callsConsumer.accept(Object)on the targetConsumerfor the equal elements.
Therefore it effectively creates a mathematical intersection between the two collections.booleanisEmpty()booleanisFull()Returns true if the current capacity cannot be increased any more.booleanisSorted(Comparator<? super KeyValue<K,V>> comparator)Tests if the collection is sorted according to the given comparator.<P extends Consumer<? super KeyValue<K, V>>>
Piterate(P procedure)Executes the given procedure for each element of theXIterableuntil all elements have been processed or the action throws an exception.<P extends IndexedAcceptor<? super KeyValue<K, V>>>
PiterateIndexed(P procedure)Iterates over elements with theIndexedAcceptorto use not only the element itself but also its coherent index.Iterator<KeyValue<K,V>>iterator()<A> Ajoin(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.HashTable.Keyskeys()KeyValue<K,V>last()Gets last element or throwsIndexOutOfBoundsExceptionif the collection is empty.longlastIndexBy(Predicate<? super KeyValue<K,V>> predicate)Iterates backwards through the collection and returns the index of the last element that the passedPredicateapplies to immediately.
Stops iterating on the first element that the predicate applies to.longlastIndexOf(KeyValue<K,V> entry)KeyValue<K,V>lookup(K key)KeyValue<K,V>max(Comparator<? super KeyValue<K,V>> comparator)longmaximumCapacity()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.longmaxIndex(Comparator<? super KeyValue<K,V>> comparator)KeyValue<K,V>min(Comparator<? super KeyValue<K,V>> comparator)longminIndex(Comparator<? super KeyValue<K,V>> comparator)<C extends Consumer<? super KeyValue<K, V>>>
CmoveSelection(C target, long... indices)<C extends Consumer<? super KeyValue<K, V>>>
CmoveTo(C target, Predicate<? super KeyValue<K,V>> predicate)static <K, V> HashTable<K,V>New()static <K, V> HashTable<K,V>New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)static <K, V> HashTable<K,V>New(KeyValue<? extends K,? extends V>... entries)static <K, V> HashTable<K,V>NewCustom(float hashDensity)static <K, V> HashTable<K,V>NewCustom(int initialHashLength)static <K, V> HashTable<K,V>NewCustom(int initialHashLength, float hashDensity)static <K, V> HashTable<K,V>NewCustom(int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries)static <K, V> HashTable<K,V>NewCustom(long desiredCapacity, float hashDensity, KeyValue<? extends K,? extends V>... entries)static <KI, VI, KO, VO>
HashTable<KO,VO>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>NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries)static <KI, VI, KO, VO>
HashTable<KO,VO>NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries, Function<? super KI,KO> keyProjector, Function<? super VI,VO> valueProjector)static <K, V> HashTable<K,V>NewSingle(K key, V value)booleannullAdd()booleannullAllowed()Defines if null-elements are allowed inside the collection or not.booleannullContained()booleannullInput(long index)booleannullInsert(long index)booleannullKeyAllowed()booleannullPrepend()booleannullPreput()booleannullPut()longnullRemove()booleannullValuesAllowed()XTable.EntriesBridge<K,V>old()XTable.Bridge<K,V>oldMap()longoptimize()Optimizes the internal storage of this collection and returns the storage size of the collection after the process is complete.KeyValue<K,V>peek()Gets last element or null if the collection is empty.KeyValue<K,V>pick()KeyValue<K,V>pinch()KeyValue<K,V>poll()Gets first element or null if the collection is empty.KeyValue<K,V>pop()Predicate<KeyValue<K,V>>predicateContainsEntry()booleanprepend(KeyValue<K,V> element)HashTable<K,V>prependAll(XGettingCollection<? extends KeyValue<K,V>> elements)HashTable<K,V>prependAll(KeyValue<K,V>... elements)HashTable<K,V>prependAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)booleanpreput(KeyValue<K,V> element)HashTable<K,V>preputAll(XGettingCollection<? extends KeyValue<K,V>> elements)HashTable<K,V>preputAll(KeyValue<K,V>... elements)HashTable<K,V>preputAll(KeyValue<K,V>[] elements, int offset, int length)<P extends Consumer<? super KeyValue<K, V>>>
Pprocess(P procedure)booleanput(K key, V value)Ensures the passed key and value to be contained as an entry in the map.booleanput(KeyValue<K,V> entry)Adds the specified element to this collection if it is not already present (optional operation).HashTable<K,V>putAll(XGettingCollection<? extends KeyValue<K,V>> elements)Adds the specified elements to this collection if it is not already present (optional operation).HashTable<K,V>putAll(KeyValue<K,V>... elements)Ensures the passed key-value-pairs to be contained as entries in the map.HashTable<K,V>putAll(KeyValue<K,V>[] elements, int srcIndex, int srcLength)Ensures the passed key-value-pairs to be contained as entries in the map.KeyValue<K,V>putGet(K key, V value)Ensures the passed key and value to be contained as an entry in the map.KeyValue<K,V>putGet(KeyValue<K,V> entry)<C extends Consumer<? super V>>
Cquery(XIterable<? extends K> keys, C collector)XEnum<KeyValue<K,V>>range(long lowIndex, long highIndex)intrehash()Recalculates the hash value of all entries and reorginazes and optimizes the hash storage accordingly.longremove(KeyValue<K,V> entry)longremoveAll(XGettingCollection<? extends KeyValue<K,V>> elements)KeyValue<K,V>removeAt(long index)longremoveBy(Predicate<? super KeyValue<K,V>> predicate)longremoveDuplicates()longremoveDuplicates(Equalator<? super KeyValue<K,V>> equalator)VremoveFor(K key)booleanremoveOne(KeyValue<K,V> entry)HashTable<K,V>removeRange(long startIndex, long length)longremoveSelection(long[] indices)KeyValue<K,V>replace(K key, V value)KeyValue<K,V>replace(KeyValue<K,V> entry)longretainAll(XGettingCollection<? extends KeyValue<K,V>> elements)Removing all elements except the ones contained in the given elements-collection.HashTable<K,V>retainRange(long startIndex, long length)Removing all elements but the ones from the offset (basically start index) to the offset+length (end index).KeyValue<K,V>retrieve(KeyValue<K,V> entry)KeyValue<K,V>retrieveBy(Predicate<? super KeyValue<K,V>> predicate)HashTable<K,V>reverse()Reverses the order of its own elements and returns itself.longscan(Predicate<? super KeyValue<K,V>> predicate)Iterates through the collection and returns the index of the last element that the passedPredicateapplied to ("scanning").KeyValue<K,V>search(Predicate<? super KeyValue<K,V>> predicate)Returns the first contained element matching the passed predicate.VsearchValue(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.HashTable<K,V>set(long index, XGettingSequence<? extends KeyValue<K,V>> elements, long offset, long length)booleanset(long index, KeyValue<K,V> element)HashTable<K,V>set(long index, KeyValue<K,V>[] elements, int offset, int length)booleanset(K key, V value)Sets the passed key and value to an appropriate entry if one can be found.HashTable<K,V>setAll(long index, KeyValue<K,V>... elements)voidsetFirst(KeyValue<K,V> element)KeyValue<K,V>setGet(long index, KeyValue<K,V> element)KeyValue<K,V>setGet(K key, V value)Sets the passed key and value to an appropriate entry if one can be found.voidsetHashDensity(float hashDensity)Sets the hash density (1/density) of this hashing collection if applicable.voidsetLast(KeyValue<K,V> element)HashTable<K,V>shiftBy(long sourceIndex, long distance)Moves the element from the sourceIndex in the sequence to a higher index position.
All other elements are possibly moved to create the empty slot for the shifting element.HashTable<K,V>shiftBy(long sourceIndex, long distance, long length)Moves multiple elements from the sourceIndex in the sequence to a higher index position.
All other elements are possibly moved to create the empty slot for the shifting elements.HashTable<K,V>shiftTo(long sourceIndex, long targetIndex)Moves the element from the sourceIndex in the sequence to the targetIndex.
All other elements are possibly moved to create the empty slot for the shifting element.HashTable<K,V>shiftTo(long sourceIndex, long targetIndex, long length)Moves multiple elements from the sourceIndex in the sequence to the targetIndex.
All other elements are possibly moved to create the empty slot for the shifting element.longsize()HashTable<K,V>sort(Comparator<? super KeyValue<K,V>> comparator)Sorts this collection according to the given comparator and returns itself.longsubstitute(Function<? super KeyValue<K,V>,? extends KeyValue<K,V>> mapper)KeyValue<K,V>substitute(K key, V value)static <K, VK, VV> Function<K,HashTable<VK,VV>>supplier()HashTable<K,V>swap(long indexA, long indexB)HashTable<K,V>swap(long indexA, long indexB, long length)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.HashTable<K,V>toReversed()Creates a newXGettingSequencewith the reversed order of elements.StringtoString()voidtruncate()Clears (and reinitializes if needed) this collection in the fastest possible way, i.e.<C extends Consumer<? super KeyValue<K, V>>>
Cunion(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, C target)CallsConsumer.accept(Object)on the targetConsumerfor all the elements of this collection.booleanvaluePut(K key, V value)Ensures the passed value to be either set to an existing entry equal to sampleKey or inserted as a new one.VvaluePutGet(K key, V value)Ensures the passed value to be either set to an existing entry appropriate to sampleKey or inserted as a new one.HashTable.Valuesvalues()booleanvalueSet(K key, V value)Sets only the passed value to an existing entry appropriate to the passed sampleKey.VvalueSetGet(K key, V value)Sets only the passed value to an existing entry appropriate to the passed sampleKey.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, validateIndexMethods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface one.microstream.collections.interfaces.CapacityCarrying
remainingCapacityMethods inherited from interface one.microstream.collections.interfaces.CapacityExtendable
currentFreeCapacityMethods inherited from interface one.microstream.collections.types.XGettingCollection
equals, hashCode, intSize
-
Method Details
-
New
-
NewCustom
-
NewCustom
-
NewCustom
-
New
public static final <K, V> HashTable<K,V> New(XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) -
NewCustom
public static final <K, V> HashTable<K,V> NewCustom(int initialHashLength, float hashDensity, XGettingCollection<? extends KeyValue<? extends K,? extends V>> entries) -
NewSingle
-
New
@SafeVarargs public static final <K, V> HashTable<K,V> New(KeyValue<? extends K,? extends V>... entries) -
NewCustom
@SafeVarargs public static final <K, V> HashTable<K,V> NewCustom(long desiredCapacity, float hashDensity, KeyValue<? extends K,? extends V>... entries) -
supplier
-
NewProjected
public static final <KI, VI, KO, VO> HashTable<KO,VO> NewProjected(float hashDensity, XGettingCollection<? extends KeyValue<KI,VI>> entries, Function<? super KI,KO> keyProjector, Function<? super VI,VO> valueProjector) -
NewProjected
public static final <KO, VO, KI extends KO, VI extends VO> HashTable<KO,VO> NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries) -
NewProjected
public static final <KI, VI, KO, VO> HashTable<KO,VO> NewProjected(XGettingCollection<? extends KeyValue<KI,VI>> entries, Function<? super KI,KO> keyProjector, Function<? super VI,VO> valueProjector) -
lookup
- Specified by:
lookupin interfaceXGettingMap<K,V>
-
internalCountingAddAll
protected int internalCountingAddAll(KeyValue<K,V>[] elements) throws UnsupportedOperationException- Specified by:
internalCountingAddAllin classAbstractExtendedCollection<KeyValue<K,V>>- Throws:
UnsupportedOperationException
-
internalCountingAddAll
protected int internalCountingAddAll(KeyValue<K,V>[] elements, int offset, int length) throws UnsupportedOperationException- Specified by:
internalCountingAddAllin classAbstractExtendedCollection<KeyValue<K,V>>- Throws:
UnsupportedOperationException
-
internalCountingAddAll
protected int internalCountingAddAll(XGettingCollection<? extends KeyValue<K,V>> elements) throws UnsupportedOperationException- Specified by:
internalCountingAddAllin classAbstractExtendedCollection<KeyValue<K,V>>- Throws:
UnsupportedOperationException
-
internalCountingPutAll
protected int internalCountingPutAll(KeyValue<K,V>[] elements) throws UnsupportedOperationException- Specified by:
internalCountingPutAllin classAbstractExtendedCollection<KeyValue<K,V>>- Throws:
UnsupportedOperationException
-
internalCountingPutAll
protected int internalCountingPutAll(KeyValue<K,V>[] elements, int offset, int length) throws UnsupportedOperationException- Specified by:
internalCountingPutAllin classAbstractExtendedCollection<KeyValue<K,V>>- Throws:
UnsupportedOperationException
-
internalCountingPutAll
protected int internalCountingPutAll(XGettingCollection<? extends KeyValue<K,V>> elements) throws UnsupportedOperationException- Specified by:
internalCountingPutAllin classAbstractExtendedCollection<KeyValue<K,V>>- Throws:
UnsupportedOperationException
-
internalRemoveNullEntries
protected int internalRemoveNullEntries()- Specified by:
internalRemoveNullEntriesin classAbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V>>
-
internalRemoveEntry
protected void internalRemoveEntry(one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V> entry)- Specified by:
internalRemoveEntryin classAbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V>>
-
internalClear
protected int internalClear()- Specified by:
internalClearin classAbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V>>
-
getInternalStorageChain
protected AbstractChainKeyValueStorage<K,V,one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V>> getInternalStorageChain()- Specified by:
getInternalStorageChainin classAbstractChainCollection<KeyValue<K,V>,K,V,one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V>>
-
size
public final long size()- Specified by:
sizein interfaceHashCollection<K>- Specified by:
sizein interfaceSized- Specified by:
sizein interfaceXGettingCollection<K>- Specified by:
sizein classAbstractChainKeyValueCollection<K,V,one.microstream.collections.ChainMapEntryLinkedStrongStrong<K,V>>
-
rehash
public final int rehash()Description copied from interface:HashCollectionRecalculates 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:
rehashin interfaceHashCollection<K>- Returns:
- the new size of the collection which might be lower than before the call.
-
isEmpty
public final boolean isEmpty() -
clear
public final void clear()Description copied from interface:XRemovingCollectionClears all elements from the collection while leaving the capacity as it is.- Specified by:
clearin interfaceClearable- Specified by:
clearin interfaceXRemovingCollection<K>
-
truncate
public final void truncate()Description copied from interface:XRemovingCollectionClears (and reinitializes if needed) this collection in the fastest possible way, i.e. by allocating a new and empty internal storage of default capacity. The collection will be empty after calling this method.- Specified by:
truncatein interfaceTruncateable- Specified by:
truncatein interfaceXRemovingCollection<K>
-
consolidate
public final long consolidate()Consolidates the internal storage of this collection by discarding all elements of the internal storage that have become obsolete or otherwise unneeded anymore. (e.g.WeakReferenceentries whose reference has been cleared).In a
HashTablethis removes all empty entries from the passed chain and returns the number of removed entries.- Specified by:
consolidatein interfaceConsolidatableCollection- Specified by:
consolidatein interfaceXRemovingCollection<K>- Returns:
- the number of discarded entries.
-
ensureCapacity
- Specified by:
ensureCapacityin interfaceCapacityExtendable
-
ensureFreeCapacity
Description copied from interface:CapacityExtendableEnsures that the next minimalFreeCapacity elements can be actually added in a fast way, meaning for example no internal storage rebuild will be necessary.- Specified by:
ensureFreeCapacityin interfaceCapacityExtendable
-
optimize
public final long optimize()Description copied from interface:OptimizableCollectionOptimizes the internal storage of this collection and returns the storage size of the collection after the process is complete.- Specified by:
optimizein interfaceOptimizableCollection- Specified by:
optimizein interfaceXRemovingCollection<K>- Returns:
- the storage size of the collection after the optimzation.
-
copy
Description copied from interface:XGettingCollectionCreates 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:
copyin interfaceCopyable- Specified by:
copyin interfaceXAddGetCollection<K>- Specified by:
copyin interfaceXAddGetSet<K>- Specified by:
copyin interfaceXBasicEnum<K>- Specified by:
copyin interfaceXBasicSequence<K>- Specified by:
copyin interfaceXBasicTable<K,V>- Specified by:
copyin interfaceXCollection<K>- Specified by:
copyin interfaceXDecreasingEnum<K>- Specified by:
copyin interfaceXDecreasingSequence<K>- Specified by:
copyin interfaceXEnum<K>- Specified by:
copyin interfaceXGettingCollection<K>- Specified by:
copyin interfaceXGettingEnum<K>- Specified by:
copyin interfaceXGettingMap<K,V>- Specified by:
copyin interfaceXGettingSequence<K>- Specified by:
copyin interfaceXGettingSet<K>- Specified by:
copyin interfaceXGettingTable<K,V>- Specified by:
copyin interfaceXIncreasingEnum<K>- Specified by:
copyin interfaceXIncreasingSequence<K>- Specified by:
copyin interfaceXMap<K,V>- Specified by:
copyin interfaceXProcessingEnum<K>- Specified by:
copyin interfaceXProcessingMap<K,V>- Specified by:
copyin interfaceXProcessingSet<K>- Specified by:
copyin interfaceXPutGetCollection<K>- Specified by:
copyin interfaceXPutGetEnum<K>- Specified by:
copyin interfaceXPutGetSequence<K>- Specified by:
copyin interfaceXPutGetSet<K>- Specified by:
copyin interfaceXSequence<K>- Specified by:
copyin interfaceXSet<K>- Specified by:
copyin interfaceXSettingEnum<K>- Specified by:
copyin interfaceXSettingSequence<K>- Specified by:
copyin interfaceXSortableEnum<K>- Specified by:
copyin interfaceXSortableSequence<K>- Specified by:
copyin interfaceXTable<K,V>- Returns:
- a copy of this list
-
immure
Description copied from interface:XGettingMapProvides 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:
immurein interfaceXBasicEnum<K>- Specified by:
immurein interfaceXGettingCollection<K>- Specified by:
immurein interfaceXGettingEnum<K>- Specified by:
immurein interfaceXGettingMap<K,V>- Specified by:
immurein interfaceXGettingSequence<K>- Specified by:
immurein interfaceXGettingSet<K>- Specified by:
immurein interfaceXGettingTable<K,V>- Specified by:
immurein interfaceXMap<K,V>- Specified by:
immurein interfaceXProcessingSet<K>- Returns:
- an immutable copy of this collection instance.
-
view
Description copied from interface:XGettingCollectionCreates 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:
viewin interfaceXGettingCollection<K>- Specified by:
viewin interfaceXGettingEnum<K>- Specified by:
viewin interfaceXGettingMap<K,V>- Specified by:
viewin interfaceXGettingSequence<K>- Specified by:
viewin interfaceXGettingTable<K,V>- Returns:
- new read-only collection to view this collection
-
setHashDensity
public final void setHashDensity(float hashDensity)Description copied from interface:HashCollectionSets 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:
setHashDensityin interfaceHashCollection<K>- Parameters:
hashDensity- the new hash density to be set.
-
hasVolatileElements
public final boolean hasVolatileElements()Description copied from interface:ExtendedCollectionTells 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 areWeakReferenceofSoftReferenceor implementations of collection entries that remove the element contained in an entry by some means outside the collection.
Note thatWeakReferenceinstances 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:
hasVolatileElementsin interfaceExtendedCollection<K>- Specified by:
hasVolatileElementsin interfaceXGettingCollection<K>- Returns:
trueif the collection contains volatile elements.
-
nullAllowed
public final boolean nullAllowed()Description copied from interface:ExtendedCollectionDefines if null-elements are allowed inside the collection or not.- Specified by:
nullAllowedin interfaceExtendedCollection<K>- Returns:
trueif null is allowed inside the collection;falseif not
-
nullKeyAllowed
public final boolean nullKeyAllowed()- Specified by:
nullKeyAllowedin interfaceXAddingMap<K,V>- Specified by:
nullKeyAllowedin interfaceXGettingMap<K,V>- Specified by:
nullKeyAllowedin interfaceXMap<K,V>
-
nullValuesAllowed
public final boolean nullValuesAllowed()- Specified by:
nullValuesAllowedin interfaceXAddingMap<K,V>- Specified by:
nullValuesAllowedin interfaceXGettingMap<K,V>- Specified by:
nullValuesAllowedin interfaceXMap<K,V>
-
get
-
ensure
Description copied from interface:XAddGetMapEnsures that this map instance contains a non-null value for the passed key and returns that value.If a non-null value can be found for the passed key, it is returned. Otherwise, the value provided by the passed supplier will be associated with the passed key and is returned.
- Specified by:
ensurein interfaceXAddGetMap<K,V>- Parameters:
key- the search key.valueProvider- the value supplier used to provide a value for the passed key in case non could be found.- Returns:
- the value associated with the passed key, either already existing or newly assiciated by the call of this method.
-
keys
-
old
-
oldMap
-
searchValue
- Specified by:
searchValuein interfaceXGettingMap<K,V>- Specified by:
searchValuein interfaceXMap<K,V>
-
query
- Specified by:
queryin interfaceXGettingMap<K,V>
-
values
- Specified by:
valuesin interfaceXBasicTable<K,V>- Specified by:
valuesin interfaceXGettingMap<K,V>- Specified by:
valuesin interfaceXGettingTable<K,V>- Specified by:
valuesin interfaceXMap<K,V>- Specified by:
valuesin interfaceXProcessingMap<K,V>- Specified by:
valuesin interfaceXTable<K,V>
-
currentCapacity
public final long currentCapacity()Description copied from interface:CapacityExtendableReturns the current amount of elements this instance can hold before a storage rebuild becomes necessary.For carrier implementations that don't have a concept of storage rebuilding (like linked list for example) this method returns the same value as
CapacityCarrying.maximumCapacity().- Specified by:
currentCapacityin interfaceCapacityExtendable- Returns:
- the current capacity of this instance before a rebuild is required.
-
maximumCapacity
public final long maximumCapacity()Description copied from interface:CapacityCarryingReturns 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:
maximumCapacityin interfaceCapacityCarrying- Returns:
- the maximum amount of elements this carrier instance can contain.
-
isFull
public final boolean isFull()Description copied from interface:CapacityCarryingReturns true if the current capacity cannot be increased any more.- Specified by:
isFullin interfaceCapacityCarrying
-
hasVolatileValues
public final boolean hasVolatileValues()- Specified by:
hasVolatileValuesin interfaceXBasicTable<K,V>- Specified by:
hasVolatileValuesin interfaceXTable<K,V>
-
addGet
- Specified by:
addGetin interfaceXAddGetMap<K,V>
-
substitute
- Specified by:
substitutein interfaceXAddGetMap<K,V>
-
putGet
Description copied from interface:XMapEnsures the passed key and value to be contained as an entry in the map. -
replace
- Specified by:
replacein interfaceXPutGetMap<K,V>
-
setGet
Description copied from interface:XMapSets the passed key and value to an appropriate entry if one can be found. -
add
Description copied from interface:XMapAdds the passed key and value as an entry if key is not yet contained. Return value indicates new entry. -
put
Description copied from interface:XMapEnsures the passed key and value to be contained as an entry in the map. -
set
Description copied from interface:XMapSets the passed key and value to an appropriate entry if one can be found. -
valuePut
Description copied from interface:XMapEnsures the passed value to be either set to an existing entry equal to sampleKey or inserted as a new one. -
valueSet
Description copied from interface:XMapSets only the passed value to an existing entry appropriate to the passed sampleKey. -
valuePutGet
Description copied from interface:XMapEnsures the passed value to be either set to an existing entry appropriate to sampleKey or inserted as a new one.- Specified by:
valuePutGetin interfaceXMap<K,V>- Parameters:
key- to find the an existing elementvalue- to add- Returns:
- the old value
-
valueSetGet
Description copied from interface:XMapSets only the passed value to an existing entry appropriate to the passed sampleKey.- Specified by:
valueSetGetin interfaceXMap<K,V>- Parameters:
key- to find the an existing elementvalue- to add- Returns:
- the old value
-
removeFor
- Specified by:
removeForin interfaceXProcessingMap<K,V>
-
analyze
- Specified by:
analyzein interfaceHashCollection<K>
-
hashDistributionRange
public final int hashDistributionRange()- Specified by:
hashDistributionRangein interfaceHashCollection<K>
-
hashEquality
- Specified by:
hashEqualityin interfaceHashCollection<K>
-
hashDensity
public final float hashDensity()- Specified by:
hashDensityin interfaceHashCollection<K>
-
hasVolatileHashElements
public final boolean hasVolatileHashElements()- Specified by:
hasVolatileHashElementsin interfaceHashCollection<K>
-
toString
-
predicateContainsEntry
-
sort
Description copied from interface:SortableSorts this collection according to the given comparator and returns itself.- Specified by:
sortin interfaceSortable<K>- Specified by:
sortin interfaceXDecreasingEnum<K>- Specified by:
sortin interfaceXDecreasingSequence<K>- Specified by:
sortin interfaceXEnum<K>- Specified by:
sortin interfaceXIncreasingEnum<K>- Specified by:
sortin interfaceXIncreasingSequence<K>- Specified by:
sortin interfaceXSequence<K>- Specified by:
sortin interfaceXSettingEnum<K>- Specified by:
sortin interfaceXSettingSequence<K>- Specified by:
sortin interfaceXSortableEnum<K>- Specified by:
sortin interfaceXSortableSequence<K>- Specified by:
sortin interfaceXTable<K,V>- Parameters:
comparator- to sort this collection- Returns:
- this
-
range
- Specified by:
rangein interfaceXDecreasingEnum<K>- Specified by:
rangein interfaceXDecreasingSequence<K>- Specified by:
rangein interfaceXEnum<K>- Specified by:
rangein interfaceXGettingEnum<K>- Specified by:
rangein interfaceXGettingSequence<K>- Specified by:
rangein interfaceXIncreasingEnum<K>- Specified by:
rangein interfaceXIncreasingSequence<K>- Specified by:
rangein interfaceXSettingEnum<K>- Specified by:
rangein interfaceXSettingSequence<K>
-
view
Description copied from interface:XGettingSequenceCreates 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:
viewin interfaceXGettingEnum<K>- Specified by:
viewin interfaceXGettingSequence<K>- Specified by:
viewin interfaceXProcessingSequence<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
Description copied from interface:XGettingCollectionReturns 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:
toArrayin interfaceXGettingCollection<K>- Returns:
- a typed array containing all of the elements in this collection
-
iterate
Description copied from interface:XIterableExecutes the given procedure for each element of theXIterableuntil 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 toIterable.forEach(Consumer).- Specified by:
iteratein interfaceXGettingEnum<K>- Specified by:
iteratein interfaceXGettingSet<K>- Specified by:
iteratein interfaceXIterable<K>- Specified by:
iteratein interfaceXProcessingCollection<K>- Type Parameters:
P- type of procedure- Parameters:
procedure- The procedure to be performed for each element- Returns:
- Given procedure
-
join
Description copied from interface:XJoinableIterates over all elements of the collections and calls the joiner with each element and the aggregate. -
count
Description copied from interface:XGettingCollectionCount how many times this element matches another element in the collection using theEqualator.- Specified by:
countin interfaceXGettingCollection<K>- Parameters:
entry- to count- Returns:
- Amount of matches
-
countBy
Description copied from interface:XGettingCollectionCount how many matches are found using the given predicate on each element of the collection.- Specified by:
countByin interfaceXGettingCollection<K>- Parameters:
predicate- defines which elements are counted and which are not- Returns:
- Amount of matches
-
search
Description copied from interface:XGettingCollectionReturns the first contained element matching the passed predicate.- Specified by:
searchin interfaceXGettingCollection<K>- Parameters:
predicate- defines which element is searched- Returns:
- Matching element
-
max
- Specified by:
maxin interfaceXGettingCollection<K>
-
min
- Specified by:
minin interfaceXGettingCollection<K>
-
containsSearched
- Specified by:
containsSearchedin interfaceXGettingCollection<K>
-
applies
Description copied from interface:XGettingCollectionTests each element of the collection on the given predicate.- Specified by:
appliesin interfaceXGettingCollection<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:
nullContainedin interfaceXGettingCollection<K>
-
containsId
Description copied from interface:XGettingCollectionSpecial 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 asXGettingCollection.containsSearched(Predicate)with aPredicateimplementation that checks for object identity. The only difference is a performance and usability advantage- Specified by:
containsIdin interfaceXGettingCollection<K>- Parameters:
entry- the element to be searched in the collection by identity.- Returns:
- whether this collection contains exactly the given element.
-
contains
Description copied from interface:XGettingCollectionChecks if the given element is contained in the collection.
In contrast to theXGettingCollection.containsId(Object)method, this method uses the internalEqualatordefined by the collection itself.- Specified by:
containsin interfaceXGettingCollection<K>- Parameters:
entry- to be searched in the collection- Returns:
- Whether this collection contains the given element as specified by the
Equalator.
-
seek
Description copied from interface:XGettingCollectionReturns 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 ofXGettingCollection.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:
seekin interfaceXGettingCollection<K>- Parameters:
sample- to seek in the collection- Returns:
- the first contained element matching the passed sample
-
containsAll
- Specified by:
containsAllin interfaceXGettingCollection<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:
equalsin interfaceXGettingCollection<K>- Parameters:
samples- is the collection which is checked for equalityequalator- is used to check the equality of the collections- Returns:
trueif the passed collection is of the same type as this collection andthis.equalsContent(list, equalator)yieldstrue
-
equalsContent
public final boolean equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)Description copied from interface:XGettingCollectionReturnstrueif 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 inCollection). 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:
equalsContentin interfaceXGettingCollection<K>- Parameters:
samples- is the collection which is checked for equalityequalator- the equalator to use to determine the equality of each element- Returns:
trueif this list is equal to the passed list,falseotherwise
-
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:XGettingCollectionTests equality between each element of the two lists and callsConsumer.accept(Object)on the targetConsumerfor the equal elements.
Therefore it effectively creates a mathematical intersection between the two collections.Since all MicroStream Collections implement the
Consumerinterface, 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 inintersectioncontaining 2 and 3.- Specified by:
intersectin interfaceXGettingCollection<K>- Parameters:
other- collection to intersect with.equalator- which is used for the equal-tests.target- on which theConsumer.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:XGettingCollectionCallsConsumer.accept(Object)on the targetConsumerfor each element of this collection that is not contained in the other collection (through the given equalator).Since all MicroStream Collections implement the
Consumerinterface, 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 inexceptCollectioncontaining 1.- Specified by:
exceptin interfaceXGettingCollection<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 theConsumer.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:XGettingCollectionCallsConsumer.accept(Object)on the targetConsumerfor 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 givenEqualator)
Therefore it effectively creates a mathematical union between the two collections.Since all MicroStream Collections implement the
Consumerinterface, 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 inunioncontaining 1, 2, 3 and 4.- Specified by:
unionin interfaceXGettingCollection<K>- Parameters:
other- collection to build a union with.equalator- which is used for the equal-tests.target- on which theConsumer.accept(Object)is called for all unified elements.- Returns:
- Given target
-
copyTo
Description copied from interface:XGettingCollectionCallsConsumer.accept(Object)on the targetConsumerfor all the elements of this collection.Since all MicroStream Collections implement the
Consumerinterface, new collections can be used as target.Example:
BulkList<Integer> collection1 = BulkList.New(1,2,3);
BulkList<Integer> copiedCollection = collection1.copyTo(BulkList.New());
Results incopiedCollectioncontaining 1, 2 and 3.- Specified by:
copyToin interfaceXGettingCollection<K>- Parameters:
target- on which theConsumer.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:XGettingCollectionCallsConsumer.accept(Object)on the targetConsumerfor all the elements of this collection which testtrueon the given predicate.Since all MicroStream Collections implement the
Consumerinterface, 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 infilteredCollectioncontaining 2.- Specified by:
filterToin interfaceXGettingCollection<K>- Parameters:
target- on which theConsumer.accept(Object)is called for elements that testtrue.predicate- on which to test all elements.- Returns:
- Given target
-
distinct
Description copied from interface:XGettingCollectionCallsConsumer.accept(Object)on the targetConsumerfor all the unique/distinct elements of this collection. This means the elements are not equal to each other.
Uniqueness is defined by the collections internalEqualator.Since all MicroStream Collections implement the
Consumerinterface, 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 indistinctCollectioncontaining 1, 2 and 3.- Specified by:
distinctin interfaceXGettingCollection<K>- Parameters:
target- on which theConsumer.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:XGettingCollectionCallsConsumer.accept(Object)on the targetConsumerfor all the unique/distinct elements of this collection. This means the elements are not equal to each other.
Uniqueness is defined by the givenEqualator.Since all MicroStream Collections implement the
Consumerinterface, 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 indistinctCollectioncontaining 1, 2 and 3.- Specified by:
distinctin interfaceXGettingCollection<K>- Parameters:
target- on which theConsumer.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
-
nullAdd
public final boolean nullAdd()- Specified by:
nullAddin interfaceXAddingCollection<K>
-
add
Description copied from interface:XAddingCollectionAdds the passed element.- Specified by:
addin interfaceXAddingCollection<K>- Parameters:
entry- to add- Returns:
trueif element was added;falseif not
-
addAll
- Specified by:
addAllin interfaceXAddGetCollection<K>- Specified by:
addAllin interfaceXAddGetSet<K>- Specified by:
addAllin interfaceXAddingCollection<K>- Specified by:
addAllin interfaceXAddingEnum<K>- Specified by:
addAllin interfaceXAddingSequence<K>- Specified by:
addAllin interfaceXAddingSet<K>- Specified by:
addAllin interfaceXAddingTable<K,V>- Specified by:
addAllin interfaceXBasicEnum<K>- Specified by:
addAllin interfaceXBasicSequence<K>- Specified by:
addAllin interfaceXBasicTable<K,V>- Specified by:
addAllin interfaceXCollection<K>- Specified by:
addAllin interfaceXEnum<K>- Specified by:
addAllin interfaceXExpandingEnum<K>- Specified by:
addAllin interfaceXExpandingSequence<K>- Specified by:
addAllin interfaceXExtendingEnum<K>- Specified by:
addAllin interfaceXExtendingSequence<K>- Specified by:
addAllin interfaceXIncreasingEnum<K>- Specified by:
addAllin interfaceXIncreasingSequence<K>- Specified by:
addAllin interfaceXInputtingEnum<K>- Specified by:
addAllin interfaceXInputtingSequence<K>- Specified by:
addAllin interfaceXInsertingEnum<K>- Specified by:
addAllin interfaceXInsertingSequence<K>- Specified by:
addAllin interfaceXMap<K,V>- Specified by:
addAllin interfaceXPutGetCollection<K>- Specified by:
addAllin interfaceXPutGetEnum<K>- Specified by:
addAllin interfaceXPutGetSequence<K>- Specified by:
addAllin interfaceXPutGetSet<K>- Specified by:
addAllin interfaceXPuttingEnum<K>- Specified by:
addAllin interfaceXPuttingSet<K>- Specified by:
addAllin interfaceXSequence<K>- Specified by:
addAllin interfaceXSet<K>- Specified by:
addAllin interfaceXTable<K,V>
-
addAll
- Specified by:
addAllin interfaceXAddGetCollection<K>- Specified by:
addAllin interfaceXAddGetSet<K>- Specified by:
addAllin interfaceXAddingCollection<K>- Specified by:
addAllin interfaceXAddingEnum<K>- Specified by:
addAllin interfaceXAddingSequence<K>- Specified by:
addAllin interfaceXAddingSet<K>- Specified by:
addAllin interfaceXAddingTable<K,V>- Specified by:
addAllin interfaceXBasicEnum<K>- Specified by:
addAllin interfaceXBasicSequence<K>- Specified by:
addAllin interfaceXBasicTable<K,V>- Specified by:
addAllin interfaceXCollection<K>- Specified by:
addAllin interfaceXEnum<K>- Specified by:
addAllin interfaceXExpandingEnum<K>- Specified by:
addAllin interfaceXExpandingSequence<K>- Specified by:
addAllin interfaceXExtendingEnum<K>- Specified by:
addAllin interfaceXExtendingSequence<K>- Specified by:
addAllin interfaceXIncreasingEnum<K>- Specified by:
addAllin interfaceXIncreasingSequence<K>- Specified by:
addAllin interfaceXInputtingEnum<K>- Specified by:
addAllin interfaceXInputtingSequence<K>- Specified by:
addAllin interfaceXInsertingEnum<K>- Specified by:
addAllin interfaceXInsertingSequence<K>- Specified by:
addAllin interfaceXMap<K,V>- Specified by:
addAllin interfaceXPutGetCollection<K>- Specified by:
addAllin interfaceXPutGetEnum<K>- Specified by:
addAllin interfaceXPutGetSequence<K>- Specified by:
addAllin interfaceXPutGetSet<K>- Specified by:
addAllin interfaceXPuttingEnum<K>- Specified by:
addAllin interfaceXPuttingSet<K>- Specified by:
addAllin interfaceXSequence<K>- Specified by:
addAllin interfaceXSet<K>- Specified by:
addAllin interfaceXTable<K,V>
-
addAll
- Specified by:
addAllin interfaceXAddGetCollection<K>- Specified by:
addAllin interfaceXAddGetSet<K>- Specified by:
addAllin interfaceXAddingCollection<K>- Specified by:
addAllin interfaceXAddingEnum<K>- Specified by:
addAllin interfaceXAddingSequence<K>- Specified by:
addAllin interfaceXAddingSet<K>- Specified by:
addAllin interfaceXAddingTable<K,V>- Specified by:
addAllin interfaceXBasicEnum<K>- Specified by:
addAllin interfaceXBasicSequence<K>- Specified by:
addAllin interfaceXBasicTable<K,V>- Specified by:
addAllin interfaceXCollection<K>- Specified by:
addAllin interfaceXEnum<K>- Specified by:
addAllin interfaceXExpandingEnum<K>- Specified by:
addAllin interfaceXExpandingSequence<K>- Specified by:
addAllin interfaceXExtendingEnum<K>- Specified by:
addAllin interfaceXExtendingSequence<K>- Specified by:
addAllin interfaceXIncreasingEnum<K>- Specified by:
addAllin interfaceXIncreasingSequence<K>- Specified by:
addAllin interfaceXInputtingEnum<K>- Specified by:
addAllin interfaceXInputtingSequence<K>- Specified by:
addAllin interfaceXInsertingEnum<K>- Specified by:
addAllin interfaceXInsertingSequence<K>- Specified by:
addAllin interfaceXMap<K,V>- Specified by:
addAllin interfaceXPutGetCollection<K>- Specified by:
addAllin interfaceXPutGetEnum<K>- Specified by:
addAllin interfaceXPutGetSequence<K>- Specified by:
addAllin interfaceXPutGetSet<K>- Specified by:
addAllin interfaceXPuttingEnum<K>- Specified by:
addAllin interfaceXPuttingSet<K>- Specified by:
addAllin interfaceXSequence<K>- Specified by:
addAllin interfaceXSet<K>- Specified by:
addAllin interfaceXTable<K,V>
-
nullPut
public final boolean nullPut()- Specified by:
nullPutin interfaceXPuttingCollection<K>
-
accept
-
put
Description copied from interface:XPuttingCollectionAdds the specified element to this collection if it is not already present (optional operation).- Specified by:
putin interfaceXPuttingCollection<K>- Parameters:
entry- to add- Returns:
- true if this collection did not already contain the specified element
-
addGet
- Specified by:
addGetin interfaceXAddGetSet<K>
-
deduplicate
- Specified by:
deduplicatein interfaceXAddGetSet<K>
-
putGet
- Specified by:
putGetin interfaceXPutGetSet<K>
-
replace
- Specified by:
replacein interfaceXPutGetSet<K>
-
putAll
Description copied from interface:XMapEnsures the passed key-value-pairs to be contained as entries in the map. A return value indicates a new entry.- Specified by:
putAllin interfaceXBasicEnum<K>- Specified by:
putAllin interfaceXBasicSequence<K>- Specified by:
putAllin interfaceXBasicTable<K,V>- Specified by:
putAllin interfaceXCollection<K>- Specified by:
putAllin interfaceXEnum<K>- Specified by:
putAllin interfaceXExpandingEnum<K>- Specified by:
putAllin interfaceXExpandingSequence<K>- Specified by:
putAllin interfaceXIncreasingEnum<K>- Specified by:
putAllin interfaceXIncreasingSequence<K>- Specified by:
putAllin interfaceXInputtingEnum<K>- Specified by:
putAllin interfaceXInputtingSequence<K>- Specified by:
putAllin interfaceXMap<K,V>- Specified by:
putAllin interfaceXPutGetCollection<K>- Specified by:
putAllin interfaceXPutGetEnum<K>- Specified by:
putAllin interfaceXPutGetSequence<K>- Specified by:
putAllin interfaceXPutGetSet<K>- Specified by:
putAllin interfaceXPuttingCollection<K>- Specified by:
putAllin interfaceXPuttingEnum<K>- Specified by:
putAllin interfaceXPuttingSequence<K>- Specified by:
putAllin interfaceXPuttingSet<K>- Specified by:
putAllin interfaceXSequence<K>- Specified by:
putAllin interfaceXSet<K>- Specified by:
putAllin interfaceXTable<K,V>- Parameters:
elements- to add- Returns:
- this
-
putAll
Description copied from interface:XMapEnsures the passed key-value-pairs to be contained as entries in the map. Only the elements with indizes from the srcStartIndex to the srcStartIndex+srcLength are put in the collection.
A return value indicates a new entry.- Specified by:
putAllin interfaceXBasicEnum<K>- Specified by:
putAllin interfaceXBasicSequence<K>- Specified by:
putAllin interfaceXBasicTable<K,V>- Specified by:
putAllin interfaceXCollection<K>- Specified by:
putAllin interfaceXEnum<K>- Specified by:
putAllin interfaceXExpandingEnum<K>- Specified by:
putAllin interfaceXExpandingSequence<K>- Specified by:
putAllin interfaceXIncreasingEnum<K>- Specified by:
putAllin interfaceXIncreasingSequence<K>- Specified by:
putAllin interfaceXInputtingEnum<K>- Specified by:
putAllin interfaceXInputtingSequence<K>- Specified by:
putAllin interfaceXMap<K,V>- Specified by:
putAllin interfaceXPutGetCollection<K>- Specified by:
putAllin interfaceXPutGetEnum<K>- Specified by:
putAllin interfaceXPutGetSequence<K>- Specified by:
putAllin interfaceXPutGetSet<K>- Specified by:
putAllin interfaceXPuttingCollection<K>- Specified by:
putAllin interfaceXPuttingEnum<K>- Specified by:
putAllin interfaceXPuttingSequence<K>- Specified by:
putAllin interfaceXPuttingSet<K>- Specified by:
putAllin interfaceXSequence<K>- Specified by:
putAllin interfaceXSet<K>- Specified by:
putAllin interfaceXTable<K,V>- Parameters:
elements- to addsrcIndex- start index of elements-array to add to collectionsrcLength- length of elements-array to add to collection- Returns:
- this
-
putAll
Description copied from interface:XPuttingCollectionAdds the specified elements to this collection if it is not already present (optional operation).- Specified by:
putAllin interfaceXBasicEnum<K>- Specified by:
putAllin interfaceXBasicSequence<K>- Specified by:
putAllin interfaceXBasicTable<K,V>- Specified by:
putAllin interfaceXCollection<K>- Specified by:
putAllin interfaceXEnum<K>- Specified by:
putAllin interfaceXExpandingEnum<K>- Specified by:
putAllin interfaceXExpandingSequence<K>- Specified by:
putAllin interfaceXIncreasingEnum<K>- Specified by:
putAllin interfaceXIncreasingSequence<K>- Specified by:
putAllin interfaceXInputtingEnum<K>- Specified by:
putAllin interfaceXInputtingSequence<K>- Specified by:
putAllin interfaceXPutGetCollection<K>- Specified by:
putAllin interfaceXPutGetEnum<K>- Specified by:
putAllin interfaceXPutGetSequence<K>- Specified by:
putAllin interfaceXPutGetSet<K>- Specified by:
putAllin interfaceXPuttingCollection<K>- Specified by:
putAllin interfaceXPuttingEnum<K>- Specified by:
putAllin interfaceXPuttingSequence<K>- Specified by:
putAllin interfaceXPuttingSet<K>- Specified by:
putAllin interfaceXSequence<K>- Specified by:
putAllin interfaceXSet<K>- Specified by:
putAllin interfaceXTable<K,V>- Parameters:
elements- to add- Returns:
- this
-
remove
- Specified by:
removein interfaceXRemovingCollection<K>
-
nullRemove
public final long nullRemove()- Specified by:
nullRemovein interfaceXRemovingCollection<K>
-
removeBy
- Specified by:
removeByin interfaceXProcessingCollection<K>
-
retainAll
Description copied from interface:XRemovingCollectionRemoving all elements except the ones contained in the given elements-collection.Basically intersect this collection with the given collection and only keeping the resulting elements.
- Specified by:
retainAllin interfaceXRemovingCollection<K>- Parameters:
elements- to retain- Returns:
- Amount of deleted elements
-
process
- Specified by:
processin interfaceProcessable<K>
-
moveTo
public final <C extends Consumer<? super KeyValue<K, V>>> C moveTo(C target, Predicate<? super KeyValue<K,V>> predicate)- Specified by:
moveToin interfaceXProcessingCollection<K>
-
removeAll
- Specified by:
removeAllin interfaceXRemovingCollection<K>
-
removeDuplicates
public final long removeDuplicates()- Specified by:
removeDuplicatesin interfaceXRemovingCollection<K>
-
removeDuplicates
- Specified by:
removeDuplicatesin interfaceXProcessingCollection<K>
-
toReversed
Description copied from interface:XGettingSequenceCreates a newXGettingSequencewith the reversed order of elements.This method creates a new collection and does not change the existing collection.
- Specified by:
toReversedin interfaceXBasicEnum<K>- Specified by:
toReversedin interfaceXBasicSequence<K>- Specified by:
toReversedin interfaceXDecreasingEnum<K>- Specified by:
toReversedin interfaceXDecreasingSequence<K>- Specified by:
toReversedin interfaceXEnum<K>- Specified by:
toReversedin interfaceXGettingEnum<K>- Specified by:
toReversedin interfaceXGettingSequence<K>- Specified by:
toReversedin interfaceXIncreasingEnum<K>- Specified by:
toReversedin interfaceXIncreasingSequence<K>- Specified by:
toReversedin interfaceXProcessingEnum<K>- Specified by:
toReversedin interfaceXProcessingSequence<K>- Specified by:
toReversedin interfaceXPutGetEnum<K>- Specified by:
toReversedin interfaceXPutGetSequence<K>- Specified by:
toReversedin interfaceXSequence<K>- Specified by:
toReversedin interfaceXSettingEnum<K>- Specified by:
toReversedin interfaceXSettingSequence<K>- Specified by:
toReversedin interfaceXSortableEnum<K>- Specified by:
toReversedin interfaceXSortableSequence<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:XGettingSequenceIterates through all the elements of the given indices and calls theConsumer.accept(Object)on the targetConsumer.- Specified by:
copySelectionin interfaceXGettingSequence<K>- Type Parameters:
T- type of the target- Parameters:
target- on which theConsumer.accept(Object)is calledindices- of the elements which are copied- Returns:
- Given target
-
iterateIndexed
Description copied from interface:XIndexIterableIterates over elements with theIndexedAcceptorto use not only the element itself but also its coherent index.- Specified by:
iterateIndexedin interfaceXIndexIterable<K>- Type Parameters:
P- type of procedure- Parameters:
procedure- which is executed when iterating- Returns:
- Given procedure
-
at
- Specified by:
atin interfaceXGettingSequence<K>
-
get
Description copied from interface:XGettingCollectionGets one element from the collection. If the collection is not orderedXGettingSequence, then it is undefined which element is returned. If the collection is ordered, the element at index 0 is returned.- Specified by:
getin interfaceXGettingCollection<K>- Specified by:
getin interfaceXGettingSequence<K>- Returns:
- the first / any element.
- See Also:
XGettingSequence.at(long),XGettingSequence.first(),XGettingSequence.last()
-
first
Description copied from interface:XGettingSequenceGets first element or throwsIndexOutOfBoundsExceptionif the collection is empty.Is an alias for
XGettingSequence.get().- Specified by:
firstin interfaceXGettingSequence<K>- Returns:
- First element
-
last
Description copied from interface:XGettingSequenceGets last element or throwsIndexOutOfBoundsExceptionif the collection is empty.- Specified by:
lastin interfaceXGettingSequence<K>- Returns:
- Last element
-
poll
Description copied from interface:XGettingSequenceGets first element or null if the collection is empty.- Specified by:
pollin interfaceXGettingSequence<K>- Returns:
- First element or null
-
peek
Description copied from interface:XGettingSequenceGets last element or null if the collection is empty.
This behaves like peeking on a stack without pop.- Specified by:
peekin interfaceXGettingSequence<K>- Returns:
- Last element or null
-
indexOf
- Specified by:
indexOfin interfaceXGettingSequence<K>
-
indexBy
Description copied from interface:XGettingSequenceIterates 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:
indexByin interfaceXGettingSequence<K>- Parameters:
predicate- to define a valid element- Returns:
- The index of the first positively tested element.
-
isSorted
Description copied from interface:XGettingSequenceTests if the collection is sorted according to the given comparator.- Specified by:
isSortedin interfaceXGettingSequence<K>- Parameters:
comparator- defines if elements are sorted- Returns:
- true if it sorted, false if not
-
lastIndexOf
- Specified by:
lastIndexOfin interfaceXGettingSequence<K>
-
lastIndexBy
Description copied from interface:XGettingSequenceIterates backwards through the collection and returns the index of the last element that the passedPredicateapplies 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 asXGettingSequence.scan(Predicate), sincescaniterates through all elements.- Specified by:
lastIndexByin interfaceXGettingSequence<K>- Parameters:
predicate- to define a valid element- Returns:
- the index of the last positively tested element.
-
maxIndex
- Specified by:
maxIndexin interfaceXGettingSequence<K>
-
minIndex
- Specified by:
minIndexin interfaceXGettingSequence<K>
-
scan
Description copied from interface:XGettingSequenceIterates through the collection and returns the index of the last element that the passedPredicateapplied to ("scanning").In order to find the last element, this method must iterate over all elements of the collection (opposed to
XGettingSequence.indexBy(Predicate)andXGettingSequence.lastIndexBy(Predicate)).Iteration can be safely canceled with a
ThrowBreak(X.BREAK)- Specified by:
scanin interfaceXGettingSequence<K>- Parameters:
predicate- to define a valid element- Returns:
- the index of the last positively tested element.
-
moveSelection
public final <C extends Consumer<? super KeyValue<K, V>>> C moveSelection(C target, long... indices)- Specified by:
moveSelectionin interfaceXProcessingSequence<K>
-
removeAt
- Specified by:
removeAtin interfaceXProcessingSequence<K>
-
fetch
- Specified by:
fetchin interfaceXProcessingCollection<K>
-
pop
- Specified by:
popin interfaceXProcessingSequence<K>
-
pinch
- Specified by:
pinchin interfaceXProcessingCollection<K>
-
pick
- Specified by:
pickin interfaceXProcessingSequence<K>
-
retrieve
- Specified by:
retrievein interfaceXProcessingCollection<K>
-
retrieveBy
- Specified by:
retrieveByin interfaceXProcessingCollection<K>
-
removeOne
- Specified by:
removeOnein interfaceXRemovingCollection<K>
-
removeRange
- Specified by:
removeRangein interfaceXRemovingSequence<K>
-
retainRange
Description copied from interface:XRemovingSequenceRemoving all elements but the ones from the offset (basically start index) to the offset+length (end index).- Specified by:
retainRangein interfaceXRemovingSequence<K>- Parameters:
startIndex- is the index of the first element to retainlength- is the amount of elements to retain- Returns:
- this
-
removeSelection
public final long removeSelection(long[] indices)- Specified by:
removeSelectionin interfaceXRemovingSequence<K>
-
iterator
-
toArray
Description copied from interface:XGettingCollectionReturns 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:
toArrayin interfaceXGettingCollection<K>- Returns:
- an array containing all of the elements in this collection
-
reverse
Description copied from interface:XSortableSequenceReverses the order of its own elements and returns itself.Unlike the
XSortableSequence.toReversed()method, this method does not create a new collection, but changes the order of its own elements.- Specified by:
reversein interfaceXDecreasingEnum<K>- Specified by:
reversein interfaceXDecreasingSequence<K>- Specified by:
reversein interfaceXEnum<K>- Specified by:
reversein interfaceXIncreasingEnum<K>- Specified by:
reversein interfaceXIncreasingSequence<K>- Specified by:
reversein interfaceXOrderingEnum<K>- Specified by:
reversein interfaceXOrderingSequence<K>- Specified by:
reversein interfaceXSettingEnum<K>- Specified by:
reversein interfaceXSettingSequence<K>- Specified by:
reversein interfaceXSortableEnum<K>- Specified by:
reversein interfaceXSortableSequence<K>- Returns:
- this
-
shiftTo
Description copied from interface:XOrderingSequenceMoves the element from the sourceIndex in the sequence to the targetIndex.
All other elements are possibly moved to create the empty slot for the shifting element.Does not expand or shrink the capacity of the sequence.
Throws a
IndexExceededExceptionif sourceIndex or targetIndex are greater than the size of the sequence.- Specified by:
shiftToin interfaceXOrderingEnum<K>- Specified by:
shiftToin interfaceXOrderingSequence<K>- Specified by:
shiftToin interfaceXSortableEnum<K>- Specified by:
shiftToin interfaceXSortableSequence<K>- Parameters:
sourceIndex- points to the source element; Index of the source elementtargetIndex- points to the target element; Index of the target element- Returns:
- this
-
shiftTo
Description copied from interface:XOrderingSequenceMoves multiple elements from the sourceIndex in the sequence to the targetIndex.
All other elements are possibly moved to create the empty slot for the shifting element.Does not expand or shrink the capacity of the sequence.
Throws a
IndexExceededExceptionif sourceIndex or targetIndex exceed the size of the sequence.- Specified by:
shiftToin interfaceXOrderingEnum<K>- Specified by:
shiftToin interfaceXOrderingSequence<K>- Specified by:
shiftToin interfaceXSortableEnum<K>- Specified by:
shiftToin interfaceXSortableSequence<K>- Parameters:
sourceIndex- points to the source element; Index of the source elementtargetIndex- points to the target element; Index of the target elementlength- Amount of moved elements.- Returns:
- self
-
shiftBy
Description copied from interface:XOrderingSequenceMoves the element from the sourceIndex in the sequence to a higher index position.
All other elements are possibly moved to create the empty slot for the shifting element. ("to the right")Does not expand or shrink the capacity of the sequence.
Throws a
IndexExceededExceptionif sourceIndex or targetIndex (sourceIndex+distance) exceed the size of the sequence.- Specified by:
shiftByin interfaceXOrderingEnum<K>- Specified by:
shiftByin interfaceXOrderingSequence<K>- Specified by:
shiftByin interfaceXSortableEnum<K>- Specified by:
shiftByin interfaceXSortableSequence<K>- Parameters:
sourceIndex- points to the source element; Index of the source elementdistance- of how far the element should be moved. Example: 1 moves the element from position 21 to position 22- Returns:
- self
-
shiftBy
Description copied from interface:XOrderingSequenceMoves multiple elements from the sourceIndex in the sequence to a higher index position.
All other elements are possibly moved to create the empty slot for the shifting elements. ("to the right")Does not expand or shrink the capacity of the sequence.
Throws a
IndexExceededExceptionif sourceIndex or targetIndex (sourceIndex+distance+length) exceed the size of the sequence.- Specified by:
shiftByin interfaceXOrderingEnum<K>- Specified by:
shiftByin interfaceXOrderingSequence<K>- Specified by:
shiftByin interfaceXSortableEnum<K>- Specified by:
shiftByin interfaceXSortableSequence<K>- Parameters:
sourceIndex- points to the source element; Index of the source elementdistance- of how far the element should be moved. Example: 1 moves the element from position 21 to position 22length- Amount of moved elements.- Returns:
- self
-
swap
- Specified by:
swapin interfaceXDecreasingEnum<K>- Specified by:
swapin interfaceXDecreasingSequence<K>- Specified by:
swapin interfaceXEnum<K>- Specified by:
swapin interfaceXIncreasingEnum<K>- Specified by:
swapin interfaceXIncreasingSequence<K>- Specified by:
swapin interfaceXOrderingEnum<K>- Specified by:
swapin interfaceXOrderingSequence<K>- Specified by:
swapin interfaceXSettingEnum<K>- Specified by:
swapin interfaceXSettingSequence<K>- Specified by:
swapin interfaceXSortableEnum<K>- Specified by:
swapin interfaceXSortableSequence<K>
-
swap
- Specified by:
swapin interfaceXDecreasingEnum<K>- Specified by:
swapin interfaceXDecreasingSequence<K>- Specified by:
swapin interfaceXEnum<K>- Specified by:
swapin interfaceXIncreasingEnum<K>- Specified by:
swapin interfaceXIncreasingSequence<K>- Specified by:
swapin interfaceXOrderingEnum<K>- Specified by:
swapin interfaceXOrderingSequence<K>- Specified by:
swapin interfaceXSettingEnum<K>- Specified by:
swapin interfaceXSettingSequence<K>- Specified by:
swapin interfaceXSortableEnum<K>- Specified by:
swapin interfaceXSortableSequence<K>
-
equality
- Specified by:
equalityin interfaceXGettingCollection<K>
-
input
- Specified by:
inputin interfaceXInputtingSequence<K>
-
inputAll
- Specified by:
inputAllin interfaceXInputtingSequence<K>
-
inputAll
- Specified by:
inputAllin interfaceXInputtingSequence<K>
-
inputAll
- Specified by:
inputAllin interfaceXInputtingSequence<K>
-
insert
- Specified by:
insertin interfaceXInsertingSequence<K>
-
insertAll
- Specified by:
insertAllin interfaceXInsertingSequence<K>
-
insertAll
- Specified by:
insertAllin interfaceXInsertingSequence<K>
-
insertAll
- Specified by:
insertAllin interfaceXInsertingSequence<K>
-
prepend
- Specified by:
prependin interfaceXPrependingSequence<K>
-
preput
- Specified by:
preputin interfaceXPreputtingSequence<K>
-
nullInput
public final boolean nullInput(long index)- Specified by:
nullInputin interfaceXInputtingSequence<K>
-
nullInsert
public final boolean nullInsert(long index)- Specified by:
nullInsertin interfaceXInsertingSequence<K>
-
nullPrepend
public final boolean nullPrepend()- Specified by:
nullPrependin interfaceXPrependingSequence<K>
-
prependAll
- Specified by:
prependAllin interfaceXEnum<K>- Specified by:
prependAllin interfaceXExpandingEnum<K>- Specified by:
prependAllin interfaceXExpandingSequence<K>- Specified by:
prependAllin interfaceXExtendingEnum<K>- Specified by:
prependAllin interfaceXExtendingSequence<K>- Specified by:
prependAllin interfaceXIncreasingEnum<K>- Specified by:
prependAllin interfaceXIncreasingSequence<K>- Specified by:
prependAllin interfaceXInputtingEnum<K>- Specified by:
prependAllin interfaceXInputtingSequence<K>- Specified by:
prependAllin interfaceXInsertingEnum<K>- Specified by:
prependAllin interfaceXInsertingSequence<K>- Specified by:
prependAllin interfaceXPrependingEnum<K>- Specified by:
prependAllin interfaceXPrependingSequence<K>- Specified by:
prependAllin interfaceXPreputtingEnum<K>- Specified by:
prependAllin interfaceXPreputtingSequence<K>
-
prependAll
public final HashTable<K,V> prependAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)- Specified by:
prependAllin interfaceXEnum<K>- Specified by:
prependAllin interfaceXExpandingEnum<K>- Specified by:
prependAllin interfaceXExpandingSequence<K>- Specified by:
prependAllin interfaceXExtendingEnum<K>- Specified by:
prependAllin interfaceXExtendingSequence<K>- Specified by:
prependAllin interfaceXIncreasingEnum<K>- Specified by:
prependAllin interfaceXIncreasingSequence<K>- Specified by:
prependAllin interfaceXInputtingEnum<K>- Specified by:
prependAllin interfaceXInputtingSequence<K>- Specified by:
prependAllin interfaceXInsertingEnum<K>- Specified by:
prependAllin interfaceXInsertingSequence<K>- Specified by:
prependAllin interfaceXPrependingEnum<K>- Specified by:
prependAllin interfaceXPrependingSequence<K>- Specified by:
prependAllin interfaceXPreputtingEnum<K>- Specified by:
prependAllin interfaceXPreputtingSequence<K>
-
prependAll
- Specified by:
prependAllin interfaceXEnum<K>- Specified by:
prependAllin interfaceXExpandingEnum<K>- Specified by:
prependAllin interfaceXExpandingSequence<K>- Specified by:
prependAllin interfaceXExtendingEnum<K>- Specified by:
prependAllin interfaceXExtendingSequence<K>- Specified by:
prependAllin interfaceXIncreasingEnum<K>- Specified by:
prependAllin interfaceXIncreasingSequence<K>- Specified by:
prependAllin interfaceXInputtingEnum<K>- Specified by:
prependAllin interfaceXInputtingSequence<K>- Specified by:
prependAllin interfaceXInsertingEnum<K>- Specified by:
prependAllin interfaceXInsertingSequence<K>- Specified by:
prependAllin interfaceXPrependingEnum<K>- Specified by:
prependAllin interfaceXPrependingSequence<K>- Specified by:
prependAllin interfaceXPreputtingEnum<K>- Specified by:
prependAllin interfaceXPreputtingSequence<K>
-
nullPreput
public final boolean nullPreput()- Specified by:
nullPreputin interfaceXPreputtingSequence<K>
-
preputAll
- Specified by:
preputAllin interfaceXEnum<K>- Specified by:
preputAllin interfaceXExpandingEnum<K>- Specified by:
preputAllin interfaceXExpandingSequence<K>- Specified by:
preputAllin interfaceXIncreasingEnum<K>- Specified by:
preputAllin interfaceXIncreasingSequence<K>- Specified by:
preputAllin interfaceXInputtingEnum<K>- Specified by:
preputAllin interfaceXInputtingSequence<K>- Specified by:
preputAllin interfaceXPreputtingEnum<K>- Specified by:
preputAllin interfaceXPreputtingSequence<K>
-
preputAll
- Specified by:
preputAllin interfaceXEnum<K>- Specified by:
preputAllin interfaceXExpandingEnum<K>- Specified by:
preputAllin interfaceXExpandingSequence<K>- Specified by:
preputAllin interfaceXIncreasingEnum<K>- Specified by:
preputAllin interfaceXIncreasingSequence<K>- Specified by:
preputAllin interfaceXInputtingEnum<K>- Specified by:
preputAllin interfaceXInputtingSequence<K>- Specified by:
preputAllin interfaceXPreputtingEnum<K>- Specified by:
preputAllin interfaceXPreputtingSequence<K>
-
preputAll
- Specified by:
preputAllin interfaceXEnum<K>- Specified by:
preputAllin interfaceXExpandingEnum<K>- Specified by:
preputAllin interfaceXExpandingSequence<K>- Specified by:
preputAllin interfaceXIncreasingEnum<K>- Specified by:
preputAllin interfaceXIncreasingSequence<K>- Specified by:
preputAllin interfaceXInputtingEnum<K>- Specified by:
preputAllin interfaceXInputtingSequence<K>- Specified by:
preputAllin interfaceXPreputtingEnum<K>- Specified by:
preputAllin interfaceXPreputtingSequence<K>
-
set
- Specified by:
setin interfaceXSettingSequence<K>
-
setGet
- Specified by:
setGetin interfaceXSettingEnum<K>- Specified by:
setGetin interfaceXSettingSequence<K>
-
setFirst
- Specified by:
setFirstin interfaceXSettingEnum<K>- Specified by:
setFirstin interfaceXSettingSequence<K>
-
setLast
- Specified by:
setLastin interfaceXSettingEnum<K>- Specified by:
setLastin interfaceXSettingSequence<K>
-
setAll
- Specified by:
setAllin interfaceXDecreasingEnum<K>- Specified by:
setAllin interfaceXDecreasingSequence<K>- Specified by:
setAllin interfaceXEnum<K>- Specified by:
setAllin interfaceXSettingEnum<K>- Specified by:
setAllin interfaceXSettingSequence<K>
-
set
- Specified by:
setin interfaceXDecreasingEnum<K>- Specified by:
setin interfaceXDecreasingSequence<K>- Specified by:
setin interfaceXEnum<K>- Specified by:
setin interfaceXSettingEnum<K>- Specified by:
setin interfaceXSettingSequence<K>
-
set
public final HashTable<K,V> set(long index, XGettingSequence<? extends KeyValue<K,V>> elements, long offset, long length)- Specified by:
setin interfaceXDecreasingEnum<K>- Specified by:
setin interfaceXDecreasingSequence<K>- Specified by:
setin interfaceXEnum<K>- Specified by:
setin interfaceXSettingEnum<K>- Specified by:
setin interfaceXSettingSequence<K>
-
substitute
- Specified by:
substitutein interfaceXDecreasingEnum<K>- Specified by:
substitutein interfaceXReplacingCollection<K>
-