|
| hvec_set (const hvec_set &)=default |
|
| hvec_set (hvec_set &&)=default |
|
template<class ITER > |
| hvec_set (ITER begin, ITER end, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type()) |
|
| hvec_set (size_t icap=0, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type()) |
|
| hvec_set (std::initializer_list< value_type > il, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type()) |
|
value_type & | back () const |
|
iterator | begin () |
|
const_iterator | begin () const |
|
const_iterator | cbegin () const |
|
const_iterator | cend () const |
|
void | clear () |
|
size_t | count (const KEY &k) const |
|
template<typename... KK> |
std::pair< iterator, bool > | emplace (KK &&...k) |
|
bool | empty () const |
|
iterator | end () |
|
const_iterator | end () const |
|
template<class HVM , class VT > |
_iter< HVM, VT > | erase (_iter< HVM, VT > it) |
|
size_t | erase (const KEY &k) |
|
iterator | find (const KEY &k) |
|
const_iterator | find (const KEY &k) const |
|
value_type & | front () const |
|
std::pair< iterator, bool > | insert (const value_type &v) |
|
template<typename InputIterator > |
void | insert (InputIterator first, InputIterator last) |
|
void | insert (std::initializer_list< value_type > vl) |
|
std::pair< iterator, bool > | insert (value_type &&v) |
|
size_t | max_size () const |
|
bool | operator!= (const hvec_set &a) const |
|
hvec_set & | operator= (const hvec_set &that) |
|
hvec_set & | operator= (hvec_set &&)=default |
|
bool | operator== (const hvec_set &a) const |
|
size_t | size () const |
|