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 void
accept(KeyValue<K,V> element)
boolean
add(K key, V value)
Adds the passed key and value as an entry if key is not yet contained.boolean
add(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)
boolean
applies(Predicate<? super KeyValue<K,V>> predicate)
void
clear()
Clears all elements from the collection while leaving the capacity as it is.Aggregator<KeyValue<K,V>,? extends XCollection<KeyValue<K,V>>>
collector()
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.boolean
contains(KeyValue<K,V> element)
boolean
containsAll(XGettingCollection<? extends KeyValue<K,V>> elements)
boolean
containsId(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 aPredicate
implementation that checks for object identity.boolean
containsSearched(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)
long
count(KeyValue<K,V> element)
long
countBy(Predicate<? super KeyValue<K,V>> predicate)
long
currentCapacity()
Returns the current amount of elements this instance can hold before a storage rebuild becomes necessary.long
currentFreeCapacity()
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)
V
ensure(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.CapacityExtendable
ensureCapacity(long minimalCapacity)
CapacityExtendable
ensureFreeCapacity(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()
boolean
equals(Object o)
Deprecated.boolean
equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
Returnstrue
if the passed collection is of the same type as this collection andthis.equalsContent(list, equalator)
yieldstrue
.boolean
equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)
Returnstrue
if 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)
void
forEach(Consumer<? super KeyValue<K,V>> action)
KeyValue<K,V>
get()
Gets one element from the collection.V
get(K key)
int
hashCode()
Deprecated.boolean
hasVolatileElements()
Tells if this collection contains volatile elements.
An element is volatile, if it can become no longer reachable by the collection without being removed from the collection.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)
boolean
isEmpty()
boolean
isFull()
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> A
join(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)
long
maximumCapacity()
Returns the maximum amount of elements this carrier instance can contain.
The actual value may be depend on the configuration of the concrete instance or may depend only on the implementation of the carrier (meaning it is constant for all instances of the implementation, e.g.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)
boolean
nullAdd()
boolean
nullAllowed()
boolean
nullContained()
boolean
nullKeyAllowed()
boolean
nullPut()
long
nullRemove()
boolean
nullValuesAllowed()
XMap.EntriesBridge<K,V>
old()
XMap.Bridge<K,V>
oldMap()
long
optimize()
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)
boolean
put(K key, V value)
Ensures the passed key and value to be contained as an entry in the map.boolean
put(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)
long
remainingCapacity()
Returns the amount of elements this carrier instance can collect before reaching its maximimum capacity.long
remove(KeyValue<K,V> element)
long
removeAll(XGettingCollection<? extends KeyValue<K,V>> elements)
long
removeBy(Predicate<? super KeyValue<K,V>> predicate)
long
removeDuplicates()
long
removeDuplicates(Equalator<? super KeyValue<K,V>> equalator)
V
removeFor(K key)
boolean
removeOne(KeyValue<K,V> element)
KeyValue<K,V>
replace(K key, V value)
KeyValue<K,V>
replace(KeyValue<K,V> element)
long
retainAll(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)
V
searchValue(Predicate<? super K> keyPredicate)
KeyValue<K,V>
seek(KeyValue<K,V> sample)
Returns the first contained element matching the passed sample as defined by the collection's equality logic or null, if no fitting element is contained.boolean
set(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.long
size()
Spliterator<KeyValue<K,V>>
spliterator()
KeyValue<K,V>
substitute(K key, V value)
Object[]
toArray()
KeyValue<K,V>[]
toArray(Class<KeyValue<K,V>> type)
void
truncate()
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)
boolean
valuePut(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.V
valuePutGet(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()
boolean
valueSet(K sampleKey, V value)
Sets only the passed value to an existing entry appropriate to the passed sampleKey.V
valueSetGet(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:CapacityCarrying
Returns the maximum amount of elements this carrier instance can contain.
The actual value may be depend on the configuration of the concrete instance or may depend only on the implementation of the carrier (meaning it is constant for all instances of the implementation, e.g.Integer.MAX_VALUE
)- Specified by:
maximumCapacity
in interfaceCapacityCarrying
- Returns:
- the maximum amount of elements this carrier instance can contain.
-
process
- Specified by:
process
in interfaceProcessable<K>
-
clear
public final void clear()Description copied from interface:XRemovingCollection
Clears all elements from the collection while leaving the capacity as it is.- Specified by:
clear
in interfaceClearable
- Specified by:
clear
in interfaceXRemovingCollection<K>
-
join
-
nullAllowed
public final boolean nullAllowed()- Specified by:
nullAllowed
in interfaceExtendedCollection<K>
-
optimize
public final long optimize()Description copied from interface:OptimizableCollection
Optimizes the internal storage of this collection and returns the storage size of the collection after the process is complete.- Specified by:
optimize
in interfaceOptimizableCollection
- Specified by:
optimize
in interfaceXRemovingCollection<K>
- Returns:
- the storage size of the collection after the optimzation.
-
consolidate
public final long consolidate()Description copied from interface:ConsolidatableCollection
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.WeakReference
entries 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:
consolidate
in interfaceConsolidatableCollection
- Specified by:
consolidate
in interfaceXRemovingCollection<K>
- Returns:
- the number of discarded entries.
-
truncate
public final void truncate()Description copied from interface:XRemovingCollection
Clears (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:
truncate
in interfaceTruncateable
- Specified by:
truncate
in interfaceXRemovingCollection<K>
-
removeFor
- Specified by:
removeFor
in interfaceXProcessingMap<K,V>
-
addGet
- Specified by:
addGet
in interfaceXAddGetSet<K>
-
deduplicate
- Specified by:
deduplicate
in interfaceXAddGetSet<K>
-
putGet
- Specified by:
putGet
in interfaceXPutGetSet<K>
-
replace
- Specified by:
replace
in interfaceXPutGetSet<K>
-
addGet
- Specified by:
addGet
in interfaceXAddGetMap<K,V>
-
substitute
- Specified by:
substitute
in interfaceXAddGetMap<K,V>
-
replace
- Specified by:
replace
in interfaceXPutGetMap<K,V>
-
hasVolatileElements
public final boolean hasVolatileElements()Description copied from interface:XGettingCollection
Tells if this collection contains volatile elements.
An element is volatile, if it can become no longer reachable by the collection without being removed from the collection. Examples areWeakReference
ofSoftReference
or implementations of collection entries that remove the element contained in an entry by some means outside the collection.
Note thatWeakReference
instances that are added to a a simple (non-volatile) implementation of a collection do NOT make the collection volatile, as the elements themselves (the reference instances) are still strongly referenced.- Specified by:
hasVolatileElements
in interfaceExtendedCollection<K>
- Specified by:
hasVolatileElements
in interfaceXGettingCollection<K>
- Returns:
true
if the collection contains volatile elements.
-
keys
-
ensure
Description copied from interface:XAddGetMap
Ensures 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:
ensure
in 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:
iterate
in interfaceXGettingSet<K>
- Specified by:
iterate
in interfaceXIterable<K>
- Specified by:
iterate
in interfaceXProcessingCollection<K>
-
collector
- Specified by:
collector
in interfaceXAddingCollection<K>
- Specified by:
collector
in interfaceXCollection<K>
-
putAll
- Specified by:
putAll
in interfaceXCollection<K>
- Specified by:
putAll
in interfaceXPutGetCollection<K>
- Specified by:
putAll
in interfaceXPutGetSet<K>
- Specified by:
putAll
in interfaceXPuttingCollection<K>
- Specified by:
putAll
in interfaceXPuttingSet<K>
- Specified by:
putAll
in interfaceXSet<K>
-
values
-
ensureCapacity
- Specified by:
ensureCapacity
in interfaceCapacityExtendable
-
remainingCapacity
public final long remainingCapacity()Description copied from interface:CapacityCarrying
Returns the amount of elements this carrier instance can collect before reaching its maximimum capacity.- Specified by:
remainingCapacity
in interfaceCapacityCarrying
-
old
-
oldMap
-
ensureFreeCapacity
Description copied from interface:CapacityExtendable
Ensures 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:
ensureFreeCapacity
in interfaceCapacityExtendable
-
copy
Description copied from interface:XGettingCollection
Creates a true copy of this collection which references the same elements as this collection does at the time the method is called. The elements themselves are NOT copied (no deep copying).
The type of the returned set is the same as of this list if possible.- Specified by:
copy
in interfaceCopyable
- Specified by:
copy
in interfaceXAddGetCollection<K>
- Specified by:
copy
in interfaceXAddGetSet<K>
- Specified by:
copy
in interfaceXCollection<K>
- Specified by:
copy
in interfaceXGettingCollection<K>
- Specified by:
copy
in interfaceXGettingMap<K,V>
- Specified by:
copy
in interfaceXGettingSet<K>
- Specified by:
copy
in interfaceXMap<K,V>
- Specified by:
copy
in interfaceXProcessingMap<K,V>
- Specified by:
copy
in interfaceXProcessingSet<K>
- Specified by:
copy
in interfaceXPutGetCollection<K>
- Specified by:
copy
in interfaceXPutGetSet<K>
- Specified by:
copy
in interfaceXSet<K>
- Returns:
- a copy of this list
-
query
- Specified by:
query
in interfaceXGettingMap<K,V>
-
put
- Specified by:
put
in interfaceXPuttingCollection<K>
-
nullKeyAllowed
public final boolean nullKeyAllowed()- Specified by:
nullKeyAllowed
in interfaceXAddingMap<K,V>
- Specified by:
nullKeyAllowed
in interfaceXGettingMap<K,V>
- Specified by:
nullKeyAllowed
in interfaceXMap<K,V>
-
nullPut
public final boolean nullPut()- Specified by:
nullPut
in interfaceXPuttingCollection<K>
-
isFull
public final boolean isFull()Description copied from interface:CapacityCarrying
Returns true if the current capacity cannot be increased any more.- Specified by:
isFull
in interfaceCapacityCarrying
-
nullValuesAllowed
public final boolean nullValuesAllowed()- Specified by:
nullValuesAllowed
in interfaceXAddingMap<K,V>
- Specified by:
nullValuesAllowed
in interfaceXGettingMap<K,V>
- Specified by:
nullValuesAllowed
in interfaceXMap<K,V>
-
currentCapacity
public final long currentCapacity()Description copied from interface:CapacityExtendable
Returns 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:
currentCapacity
in interfaceCapacityExtendable
- Returns:
- the current capacity of this instance before a rebuild is required.
-
get
Description copied from interface:XGettingCollection
Gets 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:
get
in interfaceXGettingCollection<K>
- Returns:
- the first / any element.
-
add
Description copied from interface:XMap
Adds the passed key and value as an entry if key is not yet contained. Return value indicates new entry. -
fetch
- Specified by:
fetch
in interfaceXProcessingCollection<K>
-
view
- Specified by:
view
in interfaceXGettingCollection<K>
- Specified by:
view
in interfaceXGettingMap<K,V>
-
forEach
-
pinch
- Specified by:
pinch
in interfaceXProcessingCollection<K>
-
put
Description copied from interface:XMap
Ensures the passed key and value to be contained as an entry in the map. Return value indicates new entry. -
iterator
-
toArray
- Specified by:
toArray
in interfaceXGettingCollection<K>
-
toArray
- Specified by:
toArray
in interfaceXGettingCollection<K>
-
retrieve
- Specified by:
retrieve
in interfaceXProcessingCollection<K>
-
retrieveBy
- Specified by:
retrieveBy
in interfaceXProcessingCollection<K>
-
currentFreeCapacity
public final long currentFreeCapacity()- Specified by:
currentFreeCapacity
in interfaceCapacityExtendable
-
set
Description copied from interface:XMap
Sets the passed key and value to an appropriate entry if one can be found. Return value indicates entry change. -
removeDuplicates
- Specified by:
removeDuplicates
in interfaceXProcessingCollection<K>
-
accept
-
removeBy
- Specified by:
removeBy
in interfaceXProcessingCollection<K>
-
add
- Specified by:
add
in interfaceXAddingCollection<K>
-
moveTo
public final <C extends Consumer<? super KeyValue<K, V>>> C moveTo(C target, Predicate<? super KeyValue<K,V>> predicate)- Specified by:
moveTo
in interfaceXProcessingCollection<K>
-
nullAdd
public final boolean nullAdd()- Specified by:
nullAdd
in interfaceXAddingCollection<K>
-
putGet
Description copied from interface:XMap
Ensures the passed key and value to be contained as an entry in the map. Returns the old value ornull
. -
setGet
Description copied from interface:XMap
Sets the passed key and value to an appropriate entry if one can be found. Returns the old value. -
spliterator
- Specified by:
spliterator
in interfaceIterable<K>
-
valuePut
Description copied from interface:XMap
Ensures 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:
size
in interfaceSized
- Specified by:
size
in interfaceXGettingCollection<K>
-
isEmpty
public final boolean isEmpty() -
equality
- Specified by:
equality
in interfaceXGettingCollection<K>
-
equals
public final boolean equals(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)Description copied from interface:XGettingCollection
Returnstrue
if the passed collection is of the same type as this collection andthis.equalsContent(list, equalator)
yieldstrue
.- Specified by:
equals
in interfaceXGettingCollection<K>
-
valueSet
Description copied from interface:XMap
Sets only the passed value to an existing entry appropriate to the passed sampleKey. Returns value indicates change. -
nullRemove
public final long nullRemove()- Specified by:
nullRemove
in interfaceXRemovingCollection<K>
-
removeOne
- Specified by:
removeOne
in interfaceXRemovingCollection<K>
-
valuePutGet
Description copied from interface:XMap
Ensures the passed value to be either set to an existing entry appropriate to sampleKey or inserted as a new one.- Specified by:
valuePutGet
in interfaceXMap<K,V>
-
equalsContent
public final boolean equalsContent(XGettingCollection<? extends KeyValue<K,V>> samples, Equalator<? super KeyValue<K,V>> equalator)Description copied from interface:XGettingCollection
Returnstrue
if all elements of this list and the passed list are sequentially equal as defined by the passed equalator.Note that for colletion types that don't have a defined order of elements, this method is hardly usable (as is
XGettingCollection.equals(Object)
for them as defined 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:
equalsContent
in interfaceXGettingCollection<K>
equalator
- the equalator to use to determine the equality of each element- Returns:
true
if this list is equal to the passed list, false otherwise
-
remove
- Specified by:
remove
in interfaceXRemovingCollection<K>
-
removeAll
- Specified by:
removeAll
in interfaceXRemovingCollection<K>
-
valueSetGet
Description copied from interface:XMap
Sets only the passed value to an existing entry appropriate to the passed sampleKey. Returns the old value.- Specified by:
valueSetGet
in interfaceXMap<K,V>
-
retainAll
- Specified by:
retainAll
in interfaceXRemovingCollection<K>
-
removeDuplicates
public final long removeDuplicates()- Specified by:
removeDuplicates
in interfaceXRemovingCollection<K>
-
get
-
lookup
- Specified by:
lookup
in interfaceXGettingMap<K,V>
-
searchValue
- Specified by:
searchValue
in interfaceXGettingMap<K,V>
- Specified by:
searchValue
in interfaceXMap<K,V>
-
immure
Description copied from interface:XGettingMap
Provides an instance of an immutable collection type with equal behavior and data as this instance.If this instance already is of an immutable collection type, it returns itself.
- Specified by:
immure
in interfaceXGettingCollection<K>
- Specified by:
immure
in interfaceXGettingMap<K,V>
- Specified by:
immure
in interfaceXGettingSet<K>
- Specified by:
immure
in interfaceXMap<K,V>
- Specified by:
immure
in interfaceXProcessingSet<K>
- Returns:
- an immutable copy of this collection instance.
-
putAll
- Specified by:
putAll
in interfaceXCollection<K>
- Specified by:
putAll
in interfaceXMap<K,V>
- Specified by:
putAll
in interfaceXPutGetCollection<K>
- Specified by:
putAll
in interfaceXPutGetSet<K>
- Specified by:
putAll
in interfaceXPuttingCollection<K>
- Specified by:
putAll
in interfaceXPuttingSet<K>
- Specified by:
putAll
in interfaceXSet<K>
-
putAll
- Specified by:
putAll
in interfaceXCollection<K>
- Specified by:
putAll
in interfaceXMap<K,V>
- Specified by:
putAll
in interfaceXPutGetCollection<K>
- Specified by:
putAll
in interfaceXPutGetSet<K>
- Specified by:
putAll
in interfaceXPuttingCollection<K>
- Specified by:
putAll
in interfaceXPuttingSet<K>
- Specified by:
putAll
in interfaceXSet<K>
-
addAll
- Specified by:
addAll
in interfaceXAddGetCollection<K>
- Specified by:
addAll
in interfaceXAddGetSet<K>
- Specified by:
addAll
in interfaceXAddingCollection<K>
- Specified by:
addAll
in interfaceXAddingSet<K>
- Specified by:
addAll
in interfaceXCollection<K>
- Specified by:
addAll
in interfaceXMap<K,V>
- Specified by:
addAll
in interfaceXPutGetCollection<K>
- Specified by:
addAll
in interfaceXPutGetSet<K>
- Specified by:
addAll
in interfaceXPuttingSet<K>
- Specified by:
addAll
in interfaceXSet<K>
-
addAll
- Specified by:
addAll
in interfaceXAddGetCollection<K>
- Specified by:
addAll
in interfaceXAddGetSet<K>
- Specified by:
addAll
in interfaceXAddingCollection<K>
- Specified by:
addAll
in interfaceXAddingSet<K>
- Specified by:
addAll
in interfaceXCollection<K>
- Specified by:
addAll
in interfaceXMap<K,V>
- Specified by:
addAll
in interfaceXPutGetCollection<K>
- Specified by:
addAll
in interfaceXPutGetSet<K>
- Specified by:
addAll
in interfaceXPuttingSet<K>
- Specified by:
addAll
in interfaceXSet<K>
-
addAll
- Specified by:
addAll
in interfaceXAddGetCollection<K>
- Specified by:
addAll
in interfaceXAddGetSet<K>
- Specified by:
addAll
in interfaceXAddingCollection<K>
- Specified by:
addAll
in interfaceXAddingSet<K>
- Specified by:
addAll
in interfaceXCollection<K>
- Specified by:
addAll
in interfaceXMap<K,V>
- Specified by:
addAll
in interfaceXPutGetCollection<K>
- Specified by:
addAll
in interfaceXPutGetSet<K>
- Specified by:
addAll
in interfaceXPuttingSet<K>
- Specified by:
addAll
in interfaceXSet<K>
-
nullContained
public final boolean nullContained()- Specified by:
nullContained
in interfaceXGettingCollection<K>
-
containsId
Description copied from interface:XGettingCollection
Special version of contains() that guarantees to use identity comparison (" == ") when searching for the given element regardless of the collection's internal logic.
This method has the same behavior asXGettingCollection.containsSearched(Predicate)
with aPredicate
implementation that checks for object identity. The only difference is a performance and usability advantage- Specified by:
containsId
in 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:
contains
in interfaceXGettingCollection<K>
-
containsSearched
- Specified by:
containsSearched
in interfaceXGettingCollection<K>
-
containsAll
- Specified by:
containsAll
in interfaceXGettingCollection<K>
-
applies
- Specified by:
applies
in interfaceXGettingCollection<K>
-
count
- Specified by:
count
in interfaceXGettingCollection<K>
-
countBy
- Specified by:
countBy
in interfaceXGettingCollection<K>
-
search
- Specified by:
search
in interfaceXGettingCollection<K>
-
seek
Description copied from interface:XGettingCollection
Returns the first contained element matching the passed sample as defined by the collection's equality logic or null, if no fitting element is contained. (For collections using referential equality, this method is basically just a variation 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:
seek
in interfaceXGettingCollection<K>
-
max
- Specified by:
max
in interfaceXGettingCollection<K>
-
min
- Specified by:
min
in interfaceXGettingCollection<K>
-
distinct
- Specified by:
distinct
in interfaceXGettingCollection<K>
-
distinct
public final <T extends Consumer<? super KeyValue<K, V>>> T distinct(T target, Equalator<? super KeyValue<K,V>> equalator)- Specified by:
distinct
in interfaceXGettingCollection<K>
-
copyTo
- Specified by:
copyTo
in interfaceXGettingCollection<K>
-
filterTo
public final <T extends Consumer<? super KeyValue<K, V>>> T filterTo(T target, Predicate<? super KeyValue<K,V>> predicate)- Specified by:
filterTo
in 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:
union
in 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:
intersect
in 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:
except
in interfaceXGettingCollection<K>
-
equals
Deprecated.Description copied from interface:XGettingCollection
Performs 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 asCollection
defines 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:
equals
in interfaceXGettingCollection<K>
- Overrides:
equals
in classObject
-
hashCode
Deprecated.- Specified by:
hashCode
in interfaceXGettingCollection<K>
- Overrides:
hashCode
in classObject
-