Espaços nominais
Variantes
    Ações

      std::unordered_set::insert

      De cppreference.com

      This page has been machine-translated from the English version of the wiki using Google Translate.

      The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here.

      Click here for the English version of this page

      <metanoindex/>

       
      C++
       
      Recipientes biblioteca
       
      std :: unordered_set
      Funções de membro
      Original:
      Member functions
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_set::unordered_set
      unordered_set::~unordered_set
      unordered_set::operator=
      unordered_set::get_allocator
      Iteradores
      Original:
      Iterators
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_set::begin
      unordered_set::cbegin
      unordered_set::end
      unordered_set::cend
      Capacidade
      Original:
      Capacity
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_set::erase
      unordered_set::size
      unordered_set::max_size
      Modificadores
      Original:
      Modifiers
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_set::clear
      unordered_set::insert
      unordered_set::emplace
      unordered_set::emplace_hint
      unordered_set::erase
      unordered_set::swap
      Pesquisa
      Original:
      Lookup
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_set::count
      unordered_set::find
      unordered_set::equal_range
      Interface de balde
      Original:
      Bucket interface
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_set::begin2
      unordered_set::end2
      unordered_set::bucket_count
      unordered_set::max_bucket_count
      unordered_set::bucket_size
      unordered_set::bucket
      Política de hash
      Original:
      Hash policy
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_set::load_factor
      unordered_set::max_load_factor
      unordered_set::rehash
      unordered_set::reserve
      Observadores
      Original:
      Observers
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      unordered_set::hash_function
      unordered_set::key_eq
       
      <tbody> </tbody>
      std::pair<iterator,bool> insert( const value_type& value );
      		 (1) (desde C++11)
      std::pair<iterator, bool> insert( value_type&& value );
      		 (2) (desde C++11)
      iterator insert( const_iterator hint, const value_type& value );
      		 (3) (desde C++11)
      iterator insert( const_iterator hint, value_type&& value );
      		 (4) (desde C++11)
      template< class InputIt > void insert( InputIt first, InputIt last );
      		 (5) (desde C++11)
      void insert( std::initializer_list<value_type> ilist );
      		 (6) (desde C++11)

      Inserts element(s) to the container, if the container doesn't already contain an element with equivalent key.

      1-2)

      insere value.
      Original:
      inserts