HashSet of TKEY
.
More...
Inherited by apache::geode::client::HashSetOfCacheableKey.
|
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...
|
|
| HashSetT () |
| Creates an empty hash set with hash function hasher<TKEY> and equal to function equal_to<TKEY>. More...
|
|
| HashSetT (int32_t n) |
| Creates an empty hash set with at least n buckets and hash function hasher<TKEY> and equal to function equal_to<TKEY>. More...
|
|
| HashSetT (const HashSetT &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...
|
|
HashSetT & | operator= (const HashSetT &other) |
| Assignment operator. 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...
|
|
| ~HashSetT () |
| Destructor: the destructor of m_set would do required stuff. More...
|
|
template<typename TKEY>
class apache::geode::client::HashSetT< TKEY >
HashSet of TKEY
.
Creates an empty hash set with hash function hasher<TKEY> and equal to function equal_to<TKEY>.
Creates an empty hash set with at least n buckets and hash function hasher<TKEY> and equal to function equal_to<TKEY>.
Destructor: the destructor of m_set would do required stuff.
Get an iterator pointing to the start of hash_set.
Returns the number of buckets used by the hash set.
Erases all of the elements.
Check if a given key k exists in the hash set.
Counts the number of elements whose key is k.
true if the hash set's size is 0.
Get an iterator pointing to the end of hash_set.
Erases the element whose key is k.
Inserts the key k into the hash set, when k does not exist in the hash set.
Returns the largest possible size of the hash set.
Increases the bucket count to at least n.
Returns the size of the hash set.
Swaps the contents of two hash sets.