Query: std::__profile::unordered_set
OS: debian
Section: 3
Format: Original Unix Latex Style Formatted with HTML and a Horizontal Scroll Bar
std::__profile::unordered_set< _Key, _Hash, _Pred, _Alloc >(3cxx) std::__profile::unordered_set< _Key, _Hash, _Pred, _Alloc >(3cxx)NAMEstd::__profile::unordered_set< _Key, _Hash, _Pred, _Alloc > -SYNOPSISInherits unordered_set< _Key, _Hash, _Pred, _Alloc >. Public Types typedef _Base::allocator_type allocator_type typedef _Base::const_iterator const_iterator typedef _Base::const_reference const_reference typedef _Base::difference_type difference_type typedef _Base::hasher hasher typedef _Base::iterator iterator typedef _Base::key_equal key_equal typedef _Base::key_type key_type typedef _Base::reference reference typedef _Base::size_type size_type typedef _Base::value_type value_type Public Member Functions unordered_set (size_type __n=10, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) template<typename _InputIterator > unordered_set (_InputIterator __f, _InputIterator __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) unordered_set (const _Base &__x) unordered_set (unordered_set &&__x) unordered_set (initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) void clear () void insert (std::initializer_list< value_type > __l) std::pair< iterator, bool > insert (const value_type &__obj) iterator insert (const_iterator __iter, const value_type &__v) std::pair< iterator, bool > insert (value_type &&__obj) iterator insert (const_iterator __iter, value_type &&__v) template<typename _InputIter > void insert (_InputIter __first, _InputIter __last) void insert (const value_type *__first, const value_type *__last) unordered_set & operator= (const unordered_set &__x) unordered_set & operator= (unordered_set &&__x) unordered_set & operator= (initializer_list< value_type > __l) void rehash (size_type __n) void swap (unordered_set &__x) Detailed Description template<typename _Key, typename _Hash = std::hash<_Key>, typename _Pred = std::equal_to<_Key>, typename _Alloc = std::allocator<_Key>>class std::__profile::unordered_set< _Key, _Hash, _Pred, _Alloc > Unordered_set wrapper with performance instrumentation. Definition at line 50 of file profile/unordered_set. Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Nov 27 2012std::__profile::unordered_set< _Key, _Hash, _Pred, _Alloc >(3cxx)
Similar Topics in the Unix Linux Community |
---|
hasher 1.3.6 (Default branch) |