VMware GemFire Native Client Cache Reference
9.0.6
|
A hash set of CacheableKey
objects that also extends SharedBase
for smart pointers.
More...
Inherits gemfire::HashSetT< TKEY >, and gemfire::SharedBase.
Public Types | |
typedef _HashSetOfCacheableKey::Iterator | Iterator |
Iterator class for the hash set. More... | |
Public Member Functions | |
Iterator | begin () const |
Get an iterator pointing to the start of hash_set. More... | |
int32_t | bucket_count () const |
Returns the number of buckets used by the hash set. More... | |
void | clear () |
Erases all of the elements. More... | |
bool | contains (const TKEY &k) const |
Check if a given key k exists in the hash set. More... | |
int32_t | count (const TKEY &k) const |
Counts the number of elements whose key is k. More... | |
bool | empty () const |
true if the hash set's size is 0. More... | |
Iterator | end () const |
Get an iterator pointing to the end of hash_set. More... | |
int32_t | erase (const TKEY &k) |
Erases the element whose key is k. More... | |
HashSetOfCacheableKey () | |
Create an empty HashSet. More... | |
HashSetOfCacheableKey (int32_t n) | |
Creates an empty hash set with at least n buckets. More... | |
HashSetOfCacheableKey (const HashSetOfCacheableKey &other) | |
Copy constructor. More... | |
bool | insert (const TKEY &k) |
Inserts the key k into the hash set, when k does not exist in the hash set. More... | |
int32_t | max_size () const |
Returns the largest possible size of the hash set. More... | |
void | preserveSB () const |
Atomically increment reference count. More... | |
int32_t | refCount () |
void | releaseSB () const |
Atomically decrement reference count, the SharedBase object is automatically deleted when its reference count goes to zero. More... | |
void | resize (int32_t n) |
Increases the bucket count to at least n. More... | |
int32_t | size () const |
Returns the size of the hash set. More... | |
void | swap (HashSetT &other) |
Swaps the contents of two hash sets. More... | |
A hash set of CacheableKey
objects that also extends SharedBase
for smart pointers.
Iterator class for the hash set.
|
inline |
Create an empty HashSet.
|
inline |
Creates an empty hash set with at least n buckets.
|
inline |
Copy constructor.
|
inlineinherited |
Get an iterator pointing to the start of hash_set.
|
inlineinherited |
Returns the number of buckets used by the hash set.
|
inlineinherited |
Erases all of the elements.
|
inlineinherited |
Check if a given key k exists in the hash set.
|
inlineinherited |
Counts the number of elements whose key is k.
|
inlineinherited |
true if the hash set's size is 0.
|
inlineinherited |
Get an iterator pointing to the end of hash_set.
|
inlineinherited |
Erases the element whose key is k.
|
inlineinherited |
Inserts the key k into the hash set, when k does not exist in the hash set.
|
inlineinherited |
Returns the largest possible size of the hash set.
|
inherited |
Atomically increment reference count.
|
inlineinherited |
|
inherited |
Atomically decrement reference count, the SharedBase object is automatically deleted when its reference count goes to zero.
|
inlineinherited |
Increases the bucket count to at least n.
|
inlineinherited |
Returns the size of the hash set.
|
inlineinherited |
Swaps the contents of two hash sets.