Movatterモバイル変換


[0]ホーム

URL:


cppreference.com
Namespaces
Variants
    Actions

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

      From cppreference.com
      <cpp‎ |container‎ |flat multimap

      [edit template]
       
       
       
      std::flat_multimap
      Member types
      Member functions
      Non-member functions
      Helper classes
      Tags
      Deduction guides
       
      iterator erase( iterator pos);
      (1)(since C++23)
      (constexpr since C++26)
      iterator erase( const_iterator pos);
      (2)(since C++23)
      (constexpr since C++26)
      iterator erase( const_iterator first, const_iterator last);
      (3)(since C++23)
      (constexpr since C++26)
      size_type erase(const Key& key);
      (4)(since C++23)
      (constexpr since C++26)
      template<class K>
      size_type erase( K&& x);
      (5)(since C++23)
      (constexpr since C++26)

      Removes specified elements from the container.The order of the remaining equivalent elements is preserved.

      1,2) Removes the element atpos.
      3) Removes the elements in the range[firstlast), which must be a valid range in*this.
      4) Removes all elements with the key equivalent tokey.
      5) Removes all elements with key that compares equivalent to the valuex.
      This overload participates in overload resolution only ifCompare istransparent, and neitheriterator norconst_iterator is implicitly convertible fromK. It allows calling this function without constructing an instance ofKey.
      Information on iterator invalidation is copied fromhere

      The iteratorpos must be dereferenceable. Thus theend() iterator (which is valid, but is not dereferenceable) cannot be used as a value forpos.

      Contents

      [edit]Parameters

      pos - iterator to the element to remove
      first, last - the pair of iterators defining therange of elements to remove
      key - key value of the elements to remove
      x - a value of any type that can be transparently compared with a key denoting the elements to remove

      [edit]Return value

      1-3) Iterator following the last removed element.
      4) Number of elements removed.
      5) Number of elements removed.

      [edit]Exceptions

      1-3) Throws nothing.
      4,5) Any exceptions thrown by theCompare object.

      [edit]Complexity

      Depends on underlying containers. Typically linear.
      This section is incomplete
      Reason: revision required

      [edit]Example

      Run this code
      #include <flat_map>#include <iostream> int main(){std::flat_multimap<int,std::string> c={{1,"one"},{2,"two"},{3,"three"},{4,"four"},{5,"five"},{6,"six"}}; // erase all odd numbers from cfor(auto it= c.begin(); it!= c.end();){if(it->first%2!=0)            it= c.erase(it);else++it;} for(auto& p: c)std::cout<< p.second<<' ';std::cout<<'\n';}

      Output:

      two four six

      [edit]See also

      clears the contents
      (public member function)[edit]
      Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/flat_multimap/erase&oldid=169186"

      [8]ページ先頭

      ©2009-2025 Movatter.jp