#include <coherence/util/WeakHashMap.hpp>
The Map.entrySet
method returns a collection-view of the map, whose elements are of this class.
The stored key is always a WeakReference to the user supplied key.
Public Types | |
typedef spec::Handle | Handle |
Entry Handle definition. | |
typedef spec::View | View |
Entry View definition. | |
typedef spec::Holder | Holder |
Entry Holder definition. | |
Public Member Functions | |
virtual bool | isValid () const |
Return true the entry references a key which is still valid, i.e. | |
virtual Object::View | getKey () const |
Protected Member Functions | |
Entry (Object::View vKey, Object::Holder ohValue, size32_t nHash) | |
Construct a thread-safe weak hash map using the specified settings. | |
Entry (const Entry &that) | |
Copy constructor. | |
Entry (Entry::View vThat) | |
Copy an Entry. | |
virtual bool | isKeyEqual (Object::View vKey) const |
Entry | ( | Object::View | vKey, | |
Object::Holder | ohValue, | |||
size32_t | nHash | |||
) | [protected] |
Construct a thread-safe weak hash map using the specified settings.
cInitialBuckets | the initial number of hash buckets, 0 < n | |
flLoadFactor | the acceptable load factor before resizing occurs, 0 < n, such that a load factor of 1.0 causes resizing when the number of entries exceeds the number of buckets | |
flGrowthRate | the rate of bucket growth when a resize occurs, 0 < n, such that a growth rate of 1.0 will double the number of buckets: bucketcount = bucketcount * (1 + growthrate) |
Entry | ( | Entry::View | vThat | ) | [protected] |
virtual bool isValid | ( | ) | const [virtual] |
Return true the entry references a key which is still valid, i.e.
has not been reclaimed.