[Java] Class ManagedConcurrentValueMap<K, V>

  • org.codehaus.groovy.util.ManagedConcurrentValueMap

This is a basic implementation of a map able to forget its values. This map uses internally a ConcurrentHashMap, thus should be safe for concurrency. hashcode and equals are used to find the entries and should thus be implemented properly for the keys. This map does not support null keys.

Parameters:
- the key type
- the value type

Constructor Summary

Constructors
Constructor and description
ManagedConcurrentValueMap (ReferenceBundle bundle)

Methods Summary

Methods
Type Params Return Type Name and description
V get(K key)
Returns the value stored for the given key at the point of call.
void put(K key, V value)
Sets a new value for a given key. an older value is overwritten.
void setBundle(ReferenceBundle bundle)
Sets a new bundle used for reference creation.

Inherited Methods Summary

Inherited Methods
Methods inherited from class Name
class Object wait, wait, wait, equals, toString, hashCode, getClass, notify, notifyAll

Constructor Detail

public ManagedConcurrentValueMap(ReferenceBundle bundle)

Method Detail

public V get(K key)

Returns the value stored for the given key at the point of call.

Parameters:
key - a non null key
Returns:
the value stored in the map for the given key

public void put(K key, V value)

Sets a new value for a given key. an older value is overwritten.

Parameters:
key - a non null key
value - the new value

public void setBundle(ReferenceBundle bundle)

Sets a new bundle used for reference creation. Be warned that older entries will not be changed by this

Parameters:
bundle - - the ReferenceBundle

© 2003-2020 The Apache Software Foundation
Licensed under the Apache license.
https://docs.groovy-lang.org/2.5.14/html/gapi/org/codehaus/groovy/util/ManagedConcurrentValueMap.html