|
symbolic
|
#include <hash_set.h>
Classes | |
| class | const_iterator |
| class | iterator |
Public Member Functions | |
| HashSet (std::initializer_list< T > l) | |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| bool | empty () const |
| size_t | size () const |
| size_t | bucket_count () const |
| template<typename T_query > | |
| bool | contains (const T_query &element) const |
| template<typename T_query > | |
| bool | insert (const T_query &element) |
| bool | insert (T &&element) |
| template<typename T_query > | |
| bool | erase (const T_query &element) |
Friends | |
| bool | operator== (const HashSet< T > &lhs, const HashSet< T > &rhs) |
| bool | operator!= (const HashSet< T > &lhs, const HashSet< T > &rhs) |
| bool | operator< (const HashSet< T > &lhs, const HashSet< T > &rhs) |
Hash set implemented as a vector of unique sorted vectors.
1.8.17