This is a basic implementation of a map able to forget its values. This map uses internally a ConcurrentHashMap, thus should be save 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.
- the key type
- the value typeConstructor and description |
---|
ManagedConcurrentValueMap
(ReferenceBundle bundle) |
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. |
Returns the value stored for the given key at the point of call.
key
- a non null keySets a new value for a given key. an older value is overwritten.
key
- a non null keyvalue
- the new valueSets a new bundle used for reference creation. Be warned that older entries will not be changed by this
bundle
- - the ReferenceBundleCopyright © 2003-2014 The Codehaus. All rights reserved.