|
hasher | hash_function () const |
|
key_equal | key_eq () const |
|
allocator_type | get_allocator () const |
|
| unordered_set (size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) |
|
| unordered_set (__move_source< _Self > src) |
|
| unordered_set (const value_type *__f, const value_type *__l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) |
|
| unordered_set (const_iterator __f, const_iterator __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) |
|
_Self & | operator= (const _Self &__other) |
|
size_type | size () const |
|
size_type | max_size () const |
|
bool | empty () const |
|
void | swap (_Self &__hs) |
|
iterator | begin () |
|
iterator | end () |
|
const_iterator | begin () const |
|
const_iterator | end () const |
|
pair< iterator, bool > | insert (const value_type &__obj) |
|
iterator | insert (const_iterator, const value_type &__obj) |
|
void | insert (const_iterator __f, const_iterator __l) |
|
void | insert (const value_type *__f, const value_type *__l) |
|
_STLP_TEMPLATE_FOR_CONT_EXT iterator | find (const _KT &__key) |
|
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator | find (const _KT &__key) const |
|
_STLP_TEMPLATE_FOR_CONT_EXT size_type | count (const _KT &__key) const |
|
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator > | equal_range (const _KT &__key) |
|
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator > | equal_range (const _KT &__key) const |
|
size_type | erase (const key_type &__key) |
|
void | erase (const_iterator __it) |
|
void | erase (const_iterator __f, const_iterator __l) |
|
void | clear () |
|
size_type | bucket_count () const |
|
size_type | max_bucket_count () const |
|
size_type | bucket_size (size_type __n) const |
|
_STLP_TEMPLATE_FOR_CONT_EXT size_type | bucket (const _KT &__k) const |
|
local_iterator | begin (size_type __n) |
|
local_iterator | end (size_type __n) |
|
const_local_iterator | begin (size_type __n) const |
|
const_local_iterator | end (size_type __n) const |
|
float | load_factor () const |
|
float | max_load_factor () const |
|
void | max_load_factor (float __val) |
|
void | rehash (size_type __hint) |
|
template<class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >), _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >), _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >)>
class unordered_set< _Value,,, >
Definition at line 37 of file _unordered_set.h.
template<class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >) , _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 73 of file _unordered_set.h.
Referenced by unordered_set< _Value,,, >::begin(), unordered_set< _Value,,, >::bucket(), unordered_set< _Value,,, >::bucket_count(), unordered_set< _Value,,, >::bucket_size(), unordered_set< _Value,,, >::clear(), unordered_set< _Value,,, >::count(), unordered_set< _Value,,, >::empty(), unordered_set< _Value,,, >::end(), unordered_set< _Value,,, >::equal_range(), unordered_set< _Value,,, >::erase(), unordered_set< _Value,,, >::find(), unordered_set< _Value,,, >::get_allocator(), unordered_set< _Value,,, >::hash_function(), unordered_set< _Value,,, >::insert(), unordered_set< _Value,,, >::key_eq(), unordered_set< _Value,,, >::load_factor(), unordered_set< _Value,,, >::max_bucket_count(), unordered_set< _Value,,, >::max_load_factor(), unordered_set< _Value,,, >::max_size(), unordered_set< _Value,,, >::operator=(), unordered_set< _Value,,, >::rehash(), unordered_set< _Value,,, >::size(), unordered_set< _Value,,, >::swap(), and unordered_set< _Value,,, >::unordered_set().