allocator_type begin begin bucket bucket_count bucket_size cbegin cend clear clear const_iterator const_pointer const_reference contains contains count count createDeviceObject createDeviceObject destroyDeviceObject destroyDeviceObject device_range device_range device_range device_range difference_type emplace empty end end erase erase erase find find find find full get_allocator hash_function hasher index_type insert insert insert iterator key_eq key_equal key_type load_factor mapped_type max_load_factor max_size pointer reference size unordered_map valid valid value_type

insert() [3/3] template<typename Key , typename T , typename Hash = hash<Key>, typename KeyEqual = equal_to<Key>, typename Allocator = safe_device_allocator<pair<const Key, T>>> template<typename ValueIterator , STDGPU_DETAIL_OVERLOAD_IF(detail::is_iterator_v< ValueIterator >) > void stdgpu::unordered_map< Key, T, Hash, KeyEqual, Allocator >::insert ( ValueIterator  begin, ValueIterator  end  ) Inserts the given range of elements into the container. Parameters [in] begin The begin of the range [in] end The end of the range