Movatterモバイル変換

[0]ホーム
URL:

cppreference.com
Namespaces
Variants
    Actions

      std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::insert

      From cppreference.com
      <cpp‎ |container‎ |unordered multiset
       
       
       
      std::unordered_multiset
      Member types
      Member functions
      Non-member functions
      Deduction guides(C++17)
       
      iterator insert(const value_type& value);
      		 (1)(since C++11)
      iterator insert( value_type&& value);
      		 (2)(since C++11)
      iterator insert( const_iterator hint,const value_type& value);
      		 (3)(since C++11)
      iterator insert( const_iterator hint, value_type&& value);
      		 (4)(since C++11)
      template<class InputIt>
      void insert( InputIt first, InputIt last);
      		 (5)(since C++11)
      void insert(std::initializer_list<value_type> ilist);
      		 (6)(since C++11)
      iterator insert( node_type&& nh);
      		 (7)(since C++17)
      iterator insert( const_iterator hint, node_type&& nh);
      		 (8)(since C++17)

      Inserts element(s) into the container.

      1,2) Insertsvalue.
      3,4) Insertsvalue, usinghint as a non-binding suggestion to where the search should start.
      5) Inserts elements from range[first, last).
      6) Inserts elements from initializer listilist.
      7) Ifnh is an emptynode handle, does nothing. Otherwise, inserts the element owned bynh into the container and returns an iterator pointing at the inserted element. The behavior is undefined ifnh is not empty andget_allocator()!= nh.get_allocator().
      8) Ifnh is an emptynode handle, does nothing and returns the end iterator. Otherwise, inserts the element owned bynh into the container, and returns the iterator pointing to the element with key equivalent tonh.key().hint is used as a non-binding suggestion to where the search should start. The behavior is undefined ifnh is not empty andget_allocator()!= nh.get_allocator().

      If after the operation the new number of elements is greater than oldmax_load_factor() * bucket_count() a rehashing takes place.
      If rehashing occurs (due to the insertion), all iterators are invalidated. Otherwise (no rehashing), iterators are not invalidated.If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.(since C++17)

      Contents

      [edit]Parameters

      hint - iterator, used as a suggestion as to where to insert the content
      value - element value to insert
      first, last - the pair of iterators defining the sourcerange of elements to insert
      ilist - initializer list to insert the values from
      nh - a compatiblenode handle
      Type requirements
      -
      InputIt must meet the requirements ofLegacyInputIterator.

      [edit]Return value

      1-4) An iterator to the inserted element.
      5,6) (none)
      7,8) End iterator ifnh was empty, iterator pointing to the inserted element otherwise.

      [edit]Exceptions

      1-4) If an exception is thrown by any operation, the insertion has no effect.
      This section is incomplete
      Reason: cases 5,6

      [edit]Complexity

      1-4) Average case:O(1), worst caseO(size()).
      5,6) Average case:O(N), where N is the number of elements to insert. Worst case:O(N * size() + N).
      7,8) Average case:O(1), worst caseO(size()).

      [edit]Example

      This section is incomplete
      Reason: no example

      [edit]See also

      constructs element in-place
      (public member function)[edit]
      constructs elements in-place using a hint
      (public member function)[edit]
      creates astd::insert_iterator of type inferred from the argument
      (function template)[edit]
      Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/unordered_multiset/insert&oldid=180864"
      [8]ページ先頭
      ©2009-2025 Movatter.jp