|
| hasher | hash_funct () const |
| |
| key_equal | key_eq () const |
| |
| allocator_type | get_allocator () const |
| |
| | hash_multimap () |
| |
| | hash_multimap (size_type __n) |
| |
| | hash_multimap (size_type __n, const hasher &__hf) |
| |
| | hash_multimap (const allocator_type &__a) |
| |
| | hash_multimap (size_type __n, const allocator_type &__a) |
| |
| | hash_multimap (size_type __n, const hasher &__hf, const allocator_type &__a) |
| |
| | hash_multimap (size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type()) |
| |
| template<class _InputIterator > |
| | hash_multimap (_InputIterator __f, _InputIterator __l) |
| |
| template<class _InputIterator > |
| | hash_multimap (_InputIterator __f, _InputIterator __l, size_type __n) |
| |
| template<class _InputIterator > |
| | hash_multimap (_InputIterator __f, _InputIterator __l, size_type __n, const hasher &__hf) |
| |
| template<class _InputIterator > |
| | hash_multimap (_InputIterator __f, _InputIterator __l, const allocator_type &__a) |
| |
| template<class _InputIterator > |
| | hash_multimap (_InputIterator __f, _InputIterator __l, size_type __n, const allocator_type &__a) |
| |
| template<class _InputIterator > |
| | hash_multimap (_InputIterator __f, _InputIterator __l, size_type __n, const hasher &__hf, const allocator_type &__a) |
| |
| template<class _InputIterator > |
| | hash_multimap (_InputIterator __f, _InputIterator __l, size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type()) |
| |
| | hash_multimap (const _Self &__x, const allocator_type &__a) |
| |
| 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 |
| |
| iterator | insert (const value_type &__obj) |
| |
| template<class _InputIterator > |
| void | insert (_InputIterator __f, _InputIterator __l) |
| |
| iterator | insert_noresize (const value_type &__obj) |
| |
| iterator | find (const key_type &__key) |
| |
| const_iterator | find (const key_type &__key) const |
| |
| size_type | count (const key_type &__key) const |
| |
| pair< iterator, iterator > | equal_range (const key_type &__key) |
| |
| pair< const_iterator, const_iterator > | equal_range (const key_type &__key) const |
| |
| size_type | erase (const key_type &__key) |
| |
| void | erase (iterator __it) |
| |
| void | erase (iterator __f, iterator __l) |
| |
| void | clear () |
| |
| void | resize (size_type __hint) |
| |
| size_type | bucket_count () const |
| |
| size_type | max_bucket_count () const |
| |
| size_type | elems_in_bucket (size_type __n) const |
| |
template<class _Key , class _Tp , class _HashFcn = typename ::BloombergLP::bslstp::HashSelector<_Key>::Type, class _EqualKey = typename bsl::ComparatorSelector<_Key>::Type, class _Alloc = bsl::allocator< pair < const _Key, _Tp> >>
template<class _InputIterator >
| bsl::hash_multimap< _Key, _Tp, _HashFcn, _EqualKey, _Alloc >::hash_multimap |
( |
_InputIterator |
__f, |
|
|
_InputIterator |
__l |
|
) |
| |
|
inline |
template<class _Key , class _Tp , class _HashFcn = typename ::BloombergLP::bslstp::HashSelector<_Key>::Type, class _EqualKey = typename bsl::ComparatorSelector<_Key>::Type, class _Alloc = bsl::allocator< pair < const _Key, _Tp> >>
template<class _InputIterator >
template<class _Key , class _Tp , class _HashFcn = typename ::BloombergLP::bslstp::HashSelector<_Key>::Type, class _EqualKey = typename bsl::ComparatorSelector<_Key>::Type, class _Alloc = bsl::allocator< pair < const _Key, _Tp> >>
template<class _InputIterator >
| void bsl::hash_multimap< _Key, _Tp, _HashFcn, _EqualKey, _Alloc >::insert |
( |
_InputIterator |
__f, |
|
|
_InputIterator |
__l |
|
) |
| |
|
inline |