_Ht _M_ht _Self _UnorderedMapTraits allocator_type begin begin begin begin bucket bucket_count bucket_size clear const_iterator const_local_iterator const_pointer const_reference count data_type difference_type empty end end end end equal_range equal_range erase erase erase find find get_allocator hash_function hasher insert insert insert insert iterator key_eq key_equal key_type load_factor local_iterator mapped_type max_bucket_count max_load_factor max_load_factor max_size operator= operator[] pointer reference rehash size size_type swap unordered_map unordered_map unordered_map unordered_map value_type

template<class _Key, class _Tp, _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Key >) , _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Key >) , _STLP_DEFAULT_PAIR_ALLOCATOR_SELECT(_STLP_CONST _Key, _Tp) > iterator unordered_map< _Key, _Tp,,, >::insert ( const_iterator  , const value_type &  __obj  ) [inline] Definition at line 135 of file _unordered_map.h. { return _M_ht.insert_unique(__obj); }