Class LockedMap<K,V>
- All Implemented Interfaces:
Iterable<KeyValue<K,V>>,Consumer<KeyValue<K,V>>,CapacityCarrying,CapacityExtendable,ConsolidatableCollection,ExtendedCollection<KeyValue<K,V>>,ExtendedMap<K,V>,OptimizableCollection,ReleasingCollection<KeyValue<K,V>>,Sized,Truncateable,XAddGetCollection<KeyValue<K,V>>,XAddGetMap<K,V>,XAddGetSet<KeyValue<K,V>>,XAddingCollection<KeyValue<K,V>>,XAddingMap<K,V>,XAddingSet<KeyValue<K,V>>,XCollection<KeyValue<K,V>>,XGettingCollection<KeyValue<K,V>>,XGettingMap<K,V>,XGettingSet<KeyValue<K,V>>,XIterable<KeyValue<K,V>>,XJoinable<KeyValue<K,V>>,XMap<K,V>,XProcessingCollection<KeyValue<K,V>>,XProcessingMap<K,V>,XProcessingSet<KeyValue<K,V>>,XPutGetCollection<KeyValue<K,V>>,XPutGetMap<K,V>,XPutGetSet<KeyValue<K,V>>,XPuttingCollection<KeyValue<K,V>>,XPuttingMap<K,V>,XPuttingSet<KeyValue<K,V>>,XRemovingCollection<KeyValue<K,V>>,XRemovingMap<K,V>,XRemovingSet<KeyValue<K,V>>,XSet<KeyValue<K,V>>,Synchronized,ThreadSafe,Processable<KeyValue<K,V>>,Clearable,Copyable
public final class LockedMap<K,V> extends Object implements XMap<K,V>, Synchronized
-
Nested Class Summary
Nested classes/interfaces inherited from interface one.microstream.collections.types.XIterable
XIterable.Executor<E>Nested classes/interfaces inherited from interface one.microstream.collections.types.XMap
XMap.Bridge<K,V>, XMap.Creator<K,V>, XMap.EntriesBridge<K,V>, XMap.Keys<K,V>, XMap.Satellite<K,V>, XMap.Values<K,V>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> -
Constructor Summary
Constructors Constructor Description LockedMap() -
Method Summary
Modifier and Type Method Description voidaccept(KeyValue<K,V> element)booleanadd(K key, V value)Adds the passed key and value as an entry if key is not yet contained.booleanadd(KeyValue<K,V> element)XMap<K,V>addAll(XGettingCollection<? extends KeyValue<K,V>> elements)XMap<K,V>addAll(KeyValue<K,V>... elements)XMap<K,V>addAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)KeyValue<K,V>addGet(K key, V value)KeyValue<K,V>addGet(KeyValue<K,V> element)booleanapplies(Predicate<? super KeyValue<K,V>> predicate)voidclear()Clears all elements from the collection while leaving the capacity as it is.Aggregator<KeyValue<K,V>,? extends XCollection<KeyValue<K,V>>>collector()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> element)booleancontainsAll(XGettingCollection<? extends KeyValue<K,V>> elements)booleancontainsId(KeyValue<K,V> element)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)XMap<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>>>
TcopyTo(T target)longcount(KeyValue<K,V> element)longcountBy(Predicate<? super KeyValue<K,V>> predicate)longcurrentCapacity()Returns the current amount of elements this instance can hold before a storage rebuild becomes necessary.longcurrentFreeCapacity()KeyValue<K,V>deduplicate(KeyValue<K,V> element)<T extends Consumer<? super KeyValue<K, V>>>
Tdistinct(T target)<T extends Consumer<? super KeyValue<K, V>>>
Tdistinct(T target, Equalator<? super KeyValue<K,V>> equalator)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 minimalFreeCapacity)Ensures that the next minimalFreeCapacity elements can be actually added in a fast way, meaning for example no internal storage rebuild will be necessary.Equalator<? super KeyValue<K,V>>equality()booleanequals(Object o)Deprecated.booleanequals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)Returnstrueif the passed collection is of the same type as this collection andthis.equalsContent(list, equalator)yieldstrue.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.<T extends Consumer<? super KeyValue<K, V>>>
Texcept(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)KeyValue<K,V>fetch()<T extends Consumer<? super KeyValue<K, V>>>
TfilterTo(T target, Predicate<? super KeyValue<K,V>> predicate)voidforEach(Consumer<? super KeyValue<K,V>> action)KeyValue<K,V>get()Gets one element from the collection.Vget(K key)inthashCode()Deprecated.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.XImmutableMap<K,V>immure()Provides an instance of an immutable collection type with equal behavior and data as this instance.<T extends Consumer<? super KeyValue<K, V>>>
Tintersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)booleanisEmpty()booleanisFull()Returns true if the current capacity cannot be increased any more.<P extends Consumer<? super KeyValue<K, V>>>
Piterate(P procedure)Iterator<KeyValue<K,V>>iterator()<A> Ajoin(BiConsumer<? super KeyValue<K,V>,? super A> joiner, A aggregate)XMap.Keys<K,V>keys()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.KeyValue<K,V>min(Comparator<? super KeyValue<K,V>> comparator)<C extends Consumer<? super KeyValue<K, V>>>
CmoveTo(C target, Predicate<? super KeyValue<K,V>> predicate)static <K, V> LockedMap<K,V>New(XMap<K,V> subject)static <K, V> LockedMap<K,V>New(XMap<K,V> subject, Object lock)booleannullAdd()booleannullAllowed()booleannullContained()booleannullKeyAllowed()booleannullPut()longnullRemove()booleannullValuesAllowed()XMap.EntriesBridge<K,V>old()XMap.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>pinch()<P extends Consumer<? super KeyValue<K, V>>>
Pprocess(P processor)booleanput(K key, V value)Ensures the passed key and value to be contained as an entry in the map.booleanput(KeyValue<K,V> element)XSet<KeyValue<K,V>>putAll(XGettingCollection<? extends KeyValue<K,V>> elements)XMap<K,V>putAll(KeyValue<K,V>... elements)XMap<K,V>putAll(KeyValue<K,V>[] elements, int srcStartIndex, int srcLength)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> element)<C extends Consumer<? super V>>
Cquery(XIterable<? extends K> keys, C collector)longremainingCapacity()Returns the amount of elements this carrier instance can collect before reaching its maximimum capacity.longremove(KeyValue<K,V> element)longremoveAll(XGettingCollection<? extends KeyValue<K,V>> elements)longremoveBy(Predicate<? super KeyValue<K,V>> predicate)longremoveDuplicates()longremoveDuplicates(Equalator<? super KeyValue<K,V>> equalator)VremoveFor(K key)booleanremoveOne(KeyValue<K,V> element)KeyValue<K,V>replace(K key, V value)KeyValue<K,V>replace(KeyValue<K,V> element)longretainAll(XGettingCollection<? extends KeyValue<K,V>> elements)KeyValue<K,V>retrieve(KeyValue<K,V> element)KeyValue<K,V>retrieveBy(Predicate<? super KeyValue<K,V>> predicate)KeyValue<K,V>search(Predicate<? super KeyValue<K,V>> 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.booleanset(K key, V value)Sets the passed key and value to an appropriate entry if one can be found.KeyValue<K,V>setGet(K key, V value)Sets the passed key and value to an appropriate entry if one can be found.longsize()Spliterator<KeyValue<K,V>>spliterator()KeyValue<K,V>substitute(K key, V value)Object[]toArray()KeyValue<K,V>[]toArray(Class<KeyValue<K,V>> type)voidtruncate()Clears (and reinitializes if needed) this collection in the fastest possible way, i.e.<T extends Consumer<? super KeyValue<K, V>>>
Tunion(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)booleanvaluePut(K sampleKey, V value)Ensures the passed value to be either set to an existing entry appropriate to sampleKey or inserted as a new one.VvaluePutGet(K sampleKey, V value)Ensures the passed value to be either set to an existing entry appropriate to sampleKey or inserted as a new one.XMap.Values<K,V>values()booleanvalueSet(K sampleKey, V value)Sets only the passed value to an existing entry appropriate to the passed sampleKey.VvalueSetGet(K sampleKey, V value)Sets only the passed value to an existing entry appropriate to the passed sampleKey.XGettingMap<K,V>view()
-
Constructor Details
-
LockedMap
public LockedMap()
-
-
Method Details
-
New
-
New
-
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.
-
process
- Specified by:
processin interfaceProcessable<K>
-
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>
-
join
-
nullAllowed
public final boolean nullAllowed()- Specified by:
nullAllowedin interfaceExtendedCollection<K>
-
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.
-
consolidate
public final long consolidate()Description copied from interface:ConsolidatableCollectionConsolidates 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).If this is not possible or not needed in the concrete implementation, this method does nothing and returns 0.
- Specified by:
consolidatein interfaceConsolidatableCollection- Specified by:
consolidatein interfaceXRemovingCollection<K>- Returns:
- the number of discarded entries.
-
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>
-
removeFor
- Specified by:
removeForin interfaceXProcessingMap<K,V>
-
addGet
- Specified by:
addGetin interfaceXAddGetSet<K>
-
deduplicate
- Specified by:
deduplicatein interfaceXAddGetSet<K>
-
putGet
- Specified by:
putGetin interfaceXPutGetSet<K>
-
replace
- Specified by:
replacein interfaceXPutGetSet<K>
-
addGet
- Specified by:
addGetin interfaceXAddGetMap<K,V>
-
substitute
- Specified by:
substitutein interfaceXAddGetMap<K,V>
-
replace
- Specified by:
replacein interfaceXPutGetMap<K,V>
-
hasVolatileElements
public final boolean hasVolatileElements()Description copied from interface:XGettingCollectionTells 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.
-
keys
-
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.
-
iterate
- Specified by:
iteratein interfaceXGettingSet<K>- Specified by:
iteratein interfaceXIterable<K>- Specified by:
iteratein interfaceXProcessingCollection<K>
-
collector
- Specified by:
collectorin interfaceXAddingCollection<K>- Specified by:
collectorin interfaceXCollection<K>
-
putAll
- Specified by:
putAllin interfaceXCollection<K>- Specified by:
putAllin interfaceXPutGetCollection<K>- Specified by:
putAllin interfaceXPutGetSet<K>- Specified by:
putAllin interfaceXPuttingCollection<K>- Specified by:
putAllin interfaceXPuttingSet<K>- Specified by:
putAllin interfaceXSet<K>
-
values
-
ensureCapacity
- Specified by:
ensureCapacityin interfaceCapacityExtendable
-
remainingCapacity
public final long remainingCapacity()Description copied from interface:CapacityCarryingReturns the amount of elements this carrier instance can collect before reaching its maximimum capacity.- Specified by:
remainingCapacityin interfaceCapacityCarrying
-
old
-
oldMap
-
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
-
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 interfaceXCollection<K>- Specified by:
copyin interfaceXGettingCollection<K>- Specified by:
copyin interfaceXGettingMap<K,V>- Specified by:
copyin interfaceXGettingSet<K>- Specified by:
copyin interfaceXMap<K,V>- Specified by:
copyin interfaceXProcessingMap<K,V>- Specified by:
copyin interfaceXProcessingSet<K>- Specified by:
copyin interfaceXPutGetCollection<K>- Specified by:
copyin interfaceXPutGetSet<K>- Specified by:
copyin interfaceXSet<K>- Returns:
- a copy of this list
-
query
- Specified by:
queryin interfaceXGettingMap<K,V>
-
put
- Specified by:
putin interfaceXPuttingCollection<K>
-
nullKeyAllowed
public final boolean nullKeyAllowed()- Specified by:
nullKeyAllowedin interfaceXAddingMap<K,V>- Specified by:
nullKeyAllowedin interfaceXGettingMap<K,V>- Specified by:
nullKeyAllowedin interfaceXMap<K,V>
-
nullPut
public final boolean nullPut()- Specified by:
nullPutin interfaceXPuttingCollection<K>
-
isFull
public final boolean isFull()Description copied from interface:CapacityCarryingReturns true if the current capacity cannot be increased any more.- Specified by:
isFullin interfaceCapacityCarrying
-
nullValuesAllowed
public final boolean nullValuesAllowed()- Specified by:
nullValuesAllowedin interfaceXAddingMap<K,V>- Specified by:
nullValuesAllowedin interfaceXGettingMap<K,V>- Specified by:
nullValuesAllowedin interfaceXMap<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.
-
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>- Returns:
- the first / any element.
-
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. -
fetch
- Specified by:
fetchin interfaceXProcessingCollection<K>
-
view
- Specified by:
viewin interfaceXGettingCollection<K>- Specified by:
viewin interfaceXGettingMap<K,V>
-
forEach
-
pinch
- Specified by:
pinchin interfaceXProcessingCollection<K>
-
put
Description copied from interface:XMapEnsures the passed key and value to be contained as an entry in the map. Return value indicates new entry. -
iterator
-
toArray
- Specified by:
toArrayin interfaceXGettingCollection<K>
-
toArray
- Specified by:
toArrayin interfaceXGettingCollection<K>
-
retrieve
- Specified by:
retrievein interfaceXProcessingCollection<K>
-
retrieveBy
- Specified by:
retrieveByin interfaceXProcessingCollection<K>
-
currentFreeCapacity
public final long currentFreeCapacity()- Specified by:
currentFreeCapacityin interfaceCapacityExtendable
-
set
Description copied from interface:XMapSets the passed key and value to an appropriate entry if one can be found. Return value indicates entry change. -
removeDuplicates
- Specified by:
removeDuplicatesin interfaceXProcessingCollection<K>
-
accept
-
removeBy
- Specified by:
removeByin interfaceXProcessingCollection<K>
-
add
- Specified by:
addin interfaceXAddingCollection<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>
-
nullAdd
public final boolean nullAdd()- Specified by:
nullAddin interfaceXAddingCollection<K>
-
putGet
Description copied from interface:XMapEnsures the passed key and value to be contained as an entry in the map. Returns the old value ornull. -
setGet
Description copied from interface:XMapSets the passed key and value to an appropriate entry if one can be found. Returns the old value. -
spliterator
- Specified by:
spliteratorin interfaceIterable<K>
-
valuePut
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. -
size
public final long size()- Specified by:
sizein interfaceSized- Specified by:
sizein interfaceXGettingCollection<K>
-
isEmpty
public final boolean isEmpty() -
equality
- Specified by:
equalityin interfaceXGettingCollection<K>
-
equals
public final boolean equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)Description copied from interface:XGettingCollectionReturnstrueif the passed collection is of the same type as this collection andthis.equalsContent(list, equalator)yieldstrue.- Specified by:
equalsin interfaceXGettingCollection<K>
-
valueSet
Description copied from interface:XMapSets only the passed value to an existing entry appropriate to the passed sampleKey. Returns value indicates change. -
nullRemove
public final long nullRemove()- Specified by:
nullRemovein interfaceXRemovingCollection<K>
-
removeOne
- Specified by:
removeOnein interfaceXRemovingCollection<K>
-
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>
-
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>equalator- the equalator to use to determine the equality of each element- Returns:
trueif this list is equal to the passed list, false otherwise
-
remove
- Specified by:
removein interfaceXRemovingCollection<K>
-
removeAll
- Specified by:
removeAllin interfaceXRemovingCollection<K>
-
valueSetGet
Description copied from interface:XMapSets only the passed value to an existing entry appropriate to the passed sampleKey. Returns the old value.- Specified by:
valueSetGetin interfaceXMap<K,V>
-
retainAll
- Specified by:
retainAllin interfaceXRemovingCollection<K>
-
removeDuplicates
public final long removeDuplicates()- Specified by:
removeDuplicatesin interfaceXRemovingCollection<K>
-
get
-
lookup
- Specified by:
lookupin interfaceXGettingMap<K,V>
-
searchValue
- Specified by:
searchValuein interfaceXGettingMap<K,V>- Specified by:
searchValuein interfaceXMap<K,V>
-
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 interfaceXGettingCollection<K>- Specified by:
immurein interfaceXGettingMap<K,V>- Specified by:
immurein interfaceXGettingSet<K>- Specified by:
immurein interfaceXMap<K,V>- Specified by:
immurein interfaceXProcessingSet<K>- Returns:
- an immutable copy of this collection instance.
-
putAll
- Specified by:
putAllin interfaceXCollection<K>- Specified by:
putAllin interfaceXMap<K,V>- Specified by:
putAllin interfaceXPutGetCollection<K>- Specified by:
putAllin interfaceXPutGetSet<K>- Specified by:
putAllin interfaceXPuttingCollection<K>- Specified by:
putAllin interfaceXPuttingSet<K>- Specified by:
putAllin interfaceXSet<K>
-
putAll
- Specified by:
putAllin interfaceXCollection<K>- Specified by:
putAllin interfaceXMap<K,V>- Specified by:
putAllin interfaceXPutGetCollection<K>- Specified by:
putAllin interfaceXPutGetSet<K>- Specified by:
putAllin interfaceXPuttingCollection<K>- Specified by:
putAllin interfaceXPuttingSet<K>- Specified by:
putAllin interfaceXSet<K>
-
addAll
- Specified by:
addAllin interfaceXAddGetCollection<K>- Specified by:
addAllin interfaceXAddGetSet<K>- Specified by:
addAllin interfaceXAddingCollection<K>- Specified by:
addAllin interfaceXAddingSet<K>- Specified by:
addAllin interfaceXCollection<K>- Specified by:
addAllin interfaceXMap<K,V>- Specified by:
addAllin interfaceXPutGetCollection<K>- Specified by:
addAllin interfaceXPutGetSet<K>- Specified by:
addAllin interfaceXPuttingSet<K>- Specified by:
addAllin interfaceXSet<K>
-
addAll
- Specified by:
addAllin interfaceXAddGetCollection<K>- Specified by:
addAllin interfaceXAddGetSet<K>- Specified by:
addAllin interfaceXAddingCollection<K>- Specified by:
addAllin interfaceXAddingSet<K>- Specified by:
addAllin interfaceXCollection<K>- Specified by:
addAllin interfaceXMap<K,V>- Specified by:
addAllin interfaceXPutGetCollection<K>- Specified by:
addAllin interfaceXPutGetSet<K>- Specified by:
addAllin interfaceXPuttingSet<K>- Specified by:
addAllin interfaceXSet<K>
-
addAll
- Specified by:
addAllin interfaceXAddGetCollection<K>- Specified by:
addAllin interfaceXAddGetSet<K>- Specified by:
addAllin interfaceXAddingCollection<K>- Specified by:
addAllin interfaceXAddingSet<K>- Specified by:
addAllin interfaceXCollection<K>- Specified by:
addAllin interfaceXMap<K,V>- Specified by:
addAllin interfaceXPutGetCollection<K>- Specified by:
addAllin interfaceXPutGetSet<K>- Specified by:
addAllin interfaceXPuttingSet<K>- Specified by:
addAllin interfaceXSet<K>
-
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:
element- the element to be searched in the collection by identity.- Returns:
- whether this collection contains exactely the given element.
-
contains
- Specified by:
containsin interfaceXGettingCollection<K>
-
containsSearched
- Specified by:
containsSearchedin interfaceXGettingCollection<K>
-
containsAll
- Specified by:
containsAllin interfaceXGettingCollection<K>
-
applies
- Specified by:
appliesin interfaceXGettingCollection<K>
-
count
- Specified by:
countin interfaceXGettingCollection<K>
-
countBy
- Specified by:
countByin interfaceXGettingCollection<K>
-
search
- Specified by:
searchin interfaceXGettingCollection<K>
-
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>
-
max
- Specified by:
maxin interfaceXGettingCollection<K>
-
min
- Specified by:
minin interfaceXGettingCollection<K>
-
distinct
- Specified by:
distinctin interfaceXGettingCollection<K>
-
distinct
public final <T extends Consumer<? super KeyValue<K, V>>> T distinct(T target, Equalator<? super KeyValue<K,V>> equalator)- Specified by:
distinctin interfaceXGettingCollection<K>
-
copyTo
- Specified by:
copyToin interfaceXGettingCollection<K>
-
filterTo
public final <T extends Consumer<? super KeyValue<K, V>>> T filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)- Specified by:
filterToin interfaceXGettingCollection<K>
-
union
public final <T extends Consumer<? super KeyValue<K, V>>> T union(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)- Specified by:
unionin interfaceXGettingCollection<K>
-
intersect
public final <T extends Consumer<? super KeyValue<K, V>>> T intersect(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)- Specified by:
intersectin interfaceXGettingCollection<K>
-
except
public final <T extends Consumer<? super KeyValue<K, V>>> T except(XGettingCollection<? extends KeyValue<K,V>> other, Equalator<? super KeyValue<K,V>> equalator, T target)- Specified by:
exceptin interfaceXGettingCollection<K>
-
equals
Deprecated.Description copied from interface:XGettingCollectionPerforms an equality comparison according to the specification inCollection.Note that it is this interface's author opinion that the whole concept of equals() in standard Java, especially in the collection implementations, is flawed.
The reason is because all different kinds of comparison types that actually depend on the situation have to be mixed up in a harcoded fashion in one method, from identity comparison over data indentity comparison to content comparison.
In order to get the right behavior in every situation, one has to distinct between different types of equality
This means several things:
1.) You can't just say for example an ArrayList is the "same" as a LinkedList just because they contain the same content.
There are different implementations for a good reason, so you have to distinct them when comparing. There are simple code examples which create massive misbehavior that will catastrophically ruin the runtime behavior of a programm due to this error in Java / JDK / Sun / whatever.
2.) You can't always determine equality of two collections by determining equality of each element asCollectiondefines it.As a conclusion: don't use this method!
Be clear what type of comparison you really need, then use one of the following methods and proper comparators:
XGettingCollection.equals(XGettingCollection,Equalator)
XGettingCollection.equalsContent(XGettingCollection,Equalator)
- Specified by:
equalsin interfaceXGettingCollection<K>- Overrides:
equalsin classObject
-
hashCode
Deprecated.- Specified by:
hashCodein interfaceXGettingCollection<K>- Overrides:
hashCodein classObject
-