_Base _Base_const_iterator _Base_iterator _BucketAllocType _BucketType _BucketVector _ConstLocalTraits _ConstLocalTraits _ConstTraits _ConstTraits _ElemsConstIte _ElemsCont _ElemsIte _Invalidate_iterator _Invalidate_iterators _Iterator_category _M_before_begin _M_bkt_num _M_bkt_num _M_bkt_num_key _M_bkt_num_key _M_buckets _M_copy_from _M_elems _M_enlarge _M_equals _M_find _M_get_key _M_hash _M_initialize_buckets _M_insert _M_insert _M_insert_noresize _M_iter_list _M_max_load_factor _M_non_dbg_impl _M_num_elements _M_reduce _M_rehash _M_resize _NonConstLocalTraits _NonConstLocalTraits _NonConstTraits _NonConstTraits _S_before_begin _Self _Self allocator_type begin begin begin begin begin begin begin begin bucket bucket bucket_count bucket_count clear clear const_iterator const_iterator const_local_iterator const_local_iterator const_pointer const_reference count count difference_type elems_in_bucket elems_in_bucket empty empty end end end end end end end end equal_range equal_range equal_range equal_range erase erase erase erase erase erase find find find find get_allocator get_allocator hash_funct hash_funct hasher hasher hashtable hashtable hashtable hashtable hashtable hashtable hashtable insert_equal insert_equal insert_equal insert_equal insert_equal insert_equal insert_equal_noresize insert_equal_noresize insert_unique insert_unique insert_unique insert_unique insert_unique insert_unique insert_unique_noresize insert_unique_noresize iterator iterator key_eq key_eq key_equal key_equal key_type key_type limit load_factor load_factor local_iterator local_iterator max_bucket_count max_bucket_count max_load_factor max_load_factor max_load_factor max_load_factor max_size max_size operator= operator= pointer reference rehash rehash resize resize size size size size_type swap swap table used value_type ~hashtable

template<class _Val , class _Key , class _HF , class _Traits , class _ExK , class _EqK , class _All > pair< __iterator__, bool > hashtable< _Val, _Key, _HF, _Traits, _ExK, _EqK, _All >::insert_unique_noresize ( const value_type &  __obj ) Definition at line 199 of file _hashtable.c. Referenced by hash_map< _Key, _Tp,,, >::insert_noresize(), hash_set< _Value,,, >::insert_noresize(), and hashtable< _Value, _Value, _HashFcn, _UnorderedMultisetTraits, _STLP_PRIV _Identity< _Value >, _EqualKey, _Alloc >::insert_unique(). { const size_type __n = _M_bkt_num(__obj); _ElemsIte __cur(_M_buckets[__n]); _ElemsIte __last(_M_buckets[__n + 1]); if (__cur != __last) { for (; __cur != __last; ++__cur) { if (_M_equals(_M_get_key(*__cur), _M_get_key(__obj))) { //We check that equivalent keys have equals hash code as otherwise, on resize, //equivalent value might not be in the same bucket _STLP_ASSERT(_M_hash(_M_get_key(*__cur)) == _M_hash(_M_get_key(__obj))) return pair<iterator, bool>(iterator(__cur), false); } } /* Here we do not rely on the _M_insert_noresize method as we know * that we cannot break element orders, elements are unique, and * insertion after the first bucket element is faster than what is * done in _M_insert_noresize. */ __cur = _M_elems.insert_after(_ElemsIte(_M_buckets[__n]), __obj); ++_M_num_elements; return pair<iterator, bool>(iterator(__cur), true); } return pair<iterator, bool>(_M_insert_noresize(__n, __obj), true); }