TKEY.
Public Member Functions | |
| Iterator | begin () const |
| Get an iterator pointing to the start of hash_set. | |
| int32_t | bucket_count () const |
| Returns the number of buckets used by the hash set. | |
| void | clear () |
| Erases all of the elements. | |
| bool | contains (const TKEY &k) const |
| Check if a given key k exists in the hash set. | |
| int32_t | count (const TKEY &k) const |
| Counts the number of elements whose key is k. | |
| bool | empty () const |
| true if the hash set's size is 0. | |
| Iterator | end () const |
| Get an iterator pointing to the end of hash_set. | |
| int32_t | erase (const TKEY &k) |
| Erases the element whose key is k. | |
| HashSetT (const HashSetT &other) | |
| Copy constructor. | |
| 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>. | |
| HashSetT () | |
| Creates an empty hash set with hash function hasher<TKEY> and equal to function equal_to<TKEY>. | |
| bool | insert (const TKEY &k) |
| Inserts the key k into the hash set, when k does not exist in the hash set. | |
| int32_t | max_size () const |
| Returns the largest possible size of the hash set. | |
| HashSetT & | operator= (const HashSetT &other) |
| Assignment operator. | |
| void | resize (int32_t n) |
| Increases the bucket count to at least n. | |
| int32_t | size () const |
| Returns the size of the hash set. | |
| void | swap (HashSetT &other) |
| Swaps the contents of two hash sets. | |
| ~HashSetT () | |
| Destructor: the destructor of m_set would do required stuff. | |
Data Structures | |
| class | Iterator |
Interface of an iterator for HashSetT. More... | |
| gemfire::HashSetT< TKEY >::HashSetT | ( | ) | [inline] |
Creates an empty hash set with hash function hasher<TKEY> and equal to function equal_to<TKEY>.
| gemfire::HashSetT< TKEY >::HashSetT | ( | int32_t | n | ) | [inline] |
Creates an empty hash set with at least n buckets and hash function hasher<TKEY> and equal to function equal_to<TKEY>.
| gemfire::HashSetT< TKEY >::HashSetT | ( | const HashSetT< TKEY > & | other | ) | [inline] |
Copy constructor.
| gemfire::HashSetT< TKEY >::~HashSetT | ( | ) | [inline] |
Destructor: the destructor of m_set would do required stuff.
| Iterator gemfire::HashSetT< TKEY >::begin | ( | ) | const [inline] |
Get an iterator pointing to the start of hash_set.
| int32_t gemfire::HashSetT< TKEY >::bucket_count | ( | ) | const [inline] |
Returns the number of buckets used by the hash set.
| void gemfire::HashSetT< TKEY >::clear | ( | ) | [inline] |
Erases all of the elements.
| bool gemfire::HashSetT< TKEY >::contains | ( | const TKEY & | k | ) | const [inline] |
Check if a given key k exists in the hash set.
| int32_t gemfire::HashSetT< TKEY >::count | ( | const TKEY & | k | ) | const [inline] |
Counts the number of elements whose key is k.
| bool gemfire::HashSetT< TKEY >::empty | ( | ) | const [inline] |
true if the hash set's size is 0.
| Iterator gemfire::HashSetT< TKEY >::end | ( | ) | const [inline] |
Get an iterator pointing to the end of hash_set.
| int32_t gemfire::HashSetT< TKEY >::erase | ( | const TKEY & | k | ) | [inline] |
Erases the element whose key is k.
| bool gemfire::HashSetT< TKEY >::insert | ( | const TKEY & | k | ) | [inline] |
Inserts the key k into the hash set, when k does not exist in the hash set.
| int32_t gemfire::HashSetT< TKEY >::max_size | ( | ) | const [inline] |
Returns the largest possible size of the hash set.
| HashSetT& gemfire::HashSetT< TKEY >::operator= | ( | const HashSetT< TKEY > & | other | ) | [inline] |
Assignment operator.
| void gemfire::HashSetT< TKEY >::resize | ( | int32_t | n | ) | [inline] |
Increases the bucket count to at least n.
| int32_t gemfire::HashSetT< TKEY >::size | ( | ) | const [inline] |
Returns the size of the hash set.
| void gemfire::HashSetT< TKEY >::swap | ( | HashSetT< TKEY > & | other | ) | [inline] |
Swaps the contents of two hash sets.