Movatterモバイル変換

[0]ホーム
URL:

cppreference.com
Namespaces
Variants
    Actions

      std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>::insert

      From cppreference.com
      <cpp‎ |container‎ |flat multimap
       
       
       
      std::flat_multimap
      Member types
      Member functions
      Non-member functions
      Helper classes
      Tags
      Deduction guides
       
      iterator insert(const value_type& value);
      		 (1)(since C++23)
      iterator insert( value_type&& value);
      		 (2)(since C++23)
      iterator insert( const_iterator pos,const value_type& value);
      		 (3)(since C++23)
      iterator insert( const_iterator pos, value_type&& value);
      		 (4)(since C++23)
      template<class P>
      iterator insert( P&& x);
      		 (5)(since C++23)
      template<class P>
      iterator insert( const_iterator pos, P&& x);
      		 (6)(since C++23)
      template<class InputIt>
      void insert( InputIt first, InputIt last);
      		 (7)(since C++23)
      template<class InputIt>
      void insert(std::sorted_equivalent_t, InputIt first, InputIt last);
      		 (8)(since C++23)
      void insert(std::initializer_list<key_type> ilist);
      		 (9)(since C++23)
      void insert(std::sorted_equivalent_t s,std::initializer_list<key_type> ilist);
      		 (10)(since C++23)

      Inserts element(s) into the container.

      1) Insertsvalue. Equivalent toreturn emplace(value);.
      2) Insertsvalue. Equivalent toreturn emplace(std::move(value));.
      3) Insertsvalue in the position as close as possible to the position just prior topos. Equivalent toreturn emplace_hint(pos, value);.
      4) Insertsvalue in the position as close as possible to the position just prior topos. Equivalent toreturn emplace_hint(pos, std::move(value));.
      5) Insertsx into*this as if byemplace(std::forward<P>(x));. This overload participates in overload resolution only ifstd::is_constructible_v<pair<key_type, mapped_type>, P> istrue.
      6) Insertsx into*this in the position as close as possible to the position just prior topos. Equivalent toreturn emplace_hint(position,std::forward<P>(x));. This overload participates in overload resolution only ifstd::is_constructible_v<pair<key_type, mapped_type>, P> istrue.
      7) Inserts elements from range[first, last) as if performing the following operations sequentially:
      1. Adds elements toc as if by
        for(; first!= last;++first)
        {
            value_type value=*first;
            c.keys.insert(c.keys.end(), std::move(value.first));
            c.values.insert(c.values.end(), std::move(value.second));
        }
      2. Sorts the range of newly inserted elements with respect tovalue_comp.
      3. Merges the resulting sorted range and the sorted range of pre-existing elements into a single sorted range.
      May allocate memory during the in-place merge operation.
      8) Inserts elements from range[first, last) as if performing the following operations sequentially:
      1. Adds elements toc as if by
        for(; first!= last;++first)
        {
            value_type value=*first;
            c.keys.insert(c.keys.end(), std::move(value.first));
            c.values.insert(c.values.end(), std::move(value.second));
        }
      2. Merges the sorted range of newly added elements and the sorted range of pre-existing elements into a single sorted range.
      May allocate memory during the in-place merge operation.
      9) Inserts elements from initializer listilist. Equivalent toinsert(ilist.begin(), ilist.end());.
      10) Inserts elements from initializer listilist. Equivalent toinsert(s, ilist.begin(), ilist.end());.
      Information on iterator invalidation is copied fromhere

      Contents

      [edit]Parameters

      pos - an iterator to the position before which the new element will be inserted
      value - an element value to insert
      first, last - the pair of iterators defining the sourcerange of elements to insert
      ilist - an initializer list to insert the values from
      x - a value of any type that can be transparently compared with a key
      s - a disambiguation tag indicating that the input sequence is sorted (with respect tovalue_comp())
      Type requirements
      -
      InputIt must meet the requirements ofLegacyInputIterator.

      [edit]Return value

      1-6) An iterator to the inserted element.
      7-10) (none)

      [edit]Exceptions

      1-6) If an exception is thrown by any operation, the insertion has no effect.
      7-10) No exception safety guarantee. (?)
      This section is incomplete
      Reason: double check cases 7-10

      [edit]Complexity

      1-6) Linear insize().
      7)N+ M·log(M), whereN is thesize() before the operation andM isstd::distance(first, last).
      8) Linear insize().
      9)N+ M·log(M), whereN is thesize() before the operation andM isilist.size().
      10) Linear inN, whereN issize() after the operation.

      [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/flat_multimap/insert&oldid=180886"
      [8]ページ先頭
      ©2009-2025 Movatter.jp