C++ multiset erase()

2024年8月30日 | 5分钟阅读

C++ Multimultiset erase() 函数用于从 multiset 容器中移除与给定键相关联的单个元素或范围内的元素 ([first, last))。因此，大小将减少被移除元素的数量。

语法

void erase (iterator position);                       	  //until C++ 11
size_type erase (const value_type& val);    		  //until C++ 11
void erase (iterator first, iterator last);  		  //until C++ 11
iterator  erase (const_iterator position);		  //since C++ 11
size_type erase (const value_type& val);		  //since C++ 11	
iterator  erase (const_iterator first, const_iterator last); //since C++ 11

参数

position: 指向要从容器中移除的元素的迭代器。

val: 要从 multiset 中移除的值。

first: 要擦除范围的起始。

last: 要擦除范围的结束。

返回值

erase() 函数返回一个指向已删除元素的下一个元素的迭代器，或者返回已删除元素的数量。

复杂度

erase(position): 摊销常数时间。

erase (val): 对容器大小取对数时间。

erase(first,last): 在容器中 first 和 last 之间的距离上是线性的。

迭代器有效性

指向被函数移除的元素的迭代器、引用和指针会失效。所有其他迭代器、指针和引用保持有效。

数据竞争

容器被修改。

被移除的元素被修改。在容器中迭代范围是不安全的，尽管并发访问其他元素是安全的。

异常安全

此函数不会抛出异常。

如果指定了无效范围或位置，则会导致未定义行为。

示例 1

让我们看一个使用迭代器擦除元素的简单示例。

#include <iostream>
#include <set>

using namespace std;

int main ()
{
  multiset<int> mymultiset;
  multiset<int>::iterator it;

  mymultiset = {10,20,30,20};
  
  cout<<"Before erasing the element: \n";
   for (it=mymultiset.begin(); it!=mymultiset.end(); ++it)
    cout << *it << '\n';

  it=mymultiset.find('b');
  mymultiset.erase (*it);                   // erasing by iterator

  cout<<"\nAfter erasing the element: \n";
  for (it=mymultiset.begin(); it!=mymultiset.end(); ++it)
    cout << *it << '\n';
    
  return 0;
}

输出

Before erasing the element: 
10
20
20
30

After erasing the element: 
10
20
20
30

在上面的示例中，元素通过迭代器 'it' 擦除。

示例 2

让我们看一个简单的例子来擦除给定键值的 multiset 元素

#include <iostream>
#include <set>

using namespace std;

int main ()
{
  multiset<int> mymultiset;
  multiset<int>::iterator it;

  mymultiset = {10, 20, 30, 40, 10, 30};
  
  cout<<"Before erasing the element: \n";
   for (it=mymultiset.begin(); it!=mymultiset.end(); ++it)
    cout << *it<< '\n';

   mymultiset.erase (30);                  // erasing by value

  cout<<"\nAfter erasing the element: \n";
  for (it=mymultiset.begin(); it!=mymultiset.end(); ++it)
    cout << *it<< '\n';
  return 0;
}

输出

Before erasing the element: 
10
10
20
30
30
40

After erasing the element: 
10
10
20
40

在上面的示例中，erase(value) 函数从 multiset 中使用值 30。

示例 3

让我们看一个使用给定范围擦除元素的简单示例

#include <iostream>
#include <set>

using namespace std;

int main ()
{
  multiset<int> mymultiset;
  multiset<int>::iterator it;

  mymultiset = {10, 20, 30, 20};
  
  cout<<"Before erasing the element are: \n";
   cout<<"Size is: "<<mymultiset.size()<<'\n';
   for (it=mymultiset.begin(); it!=mymultiset.end(); ++it)
   cout << *it << '\n';

   mymultiset.erase ( mymultiset.begin () ,  mymultiset.end () );   // erasing by range

  cout<<"\nAfter erasing the element are: \n";
  cout<<"Size is: "<<mymultiset.size();
  for (it=mymultiset.begin(); it!=mymultiset.end(); ++it)
  cout << *it << '\n';
  return 0;
}

输出

Before erasing the element are: 
Size is: 3
10
20
30

After erasing the element are: 
Size is: 0

在上面的示例中，erase(first, last) 函数用于擦除给定范围（即从头到尾）的元素。

示例 4

让我们看一个简单的例子来擦除 multiset 中的所有奇数

#include <set>
#include <iostream>

using namespace std;

int main()
{
    multiset<int> m = {1,2,3,4,5,6,7,8,9,10,11,12,11,10,4};
                          
    // erase all odd numbers from m
    cout<<"After erasing odd numbers,elements are:\n ";
    for(auto it = m.begin(); it != m.end(); )
        if(*it % 2 == 1)
            it = m.erase(it);
        else
            ++it;
    for(auto& p : m)
        cout << p << ", ";
}

输出

After erasing odd numbers, elements are:
 2, 4, 4, 6, 8, 10, 10, 12,

在上面的示例中，所有奇数都被擦除，并显示偶数。

示例 5

让我们看另一个例子

#include <set>  
#include <string>  
#include <iostream>  
#include <iterator> // next() and prev() helper functions  
  
using namespace std;  
  
using mymultiset = multiset<string>;  
  
void printmultiset(const mymultiset& s) {  
    for (const auto& iter : s) {  
        cout << " [" << iter << "]";  
    }  
    cout << endl << "size() == " << s.size() << endl << endl;  
}  
  
int main()  
{  
    mymultiset s1;  
  
    // Fill in some data to test with, one at a time  
    s1.insert("Bob");  
    s1.insert("Robert");  
    s1.insert("Rob");  
    s1.insert("Rob");  
    s1.insert("Bob");  
  
    cout << "Starting data of multiset s1 is:" << endl;  
    printmultiset(s1);  
    // The 1st member function removes an element at a given position  
    s1.erase(next(s1.begin()));  
    cout << "After the 2nd element is deleted, the multiset s1 is:" << endl;  
    printmultiset(s1);  
  
    // Fill in some data to test with, one at a time, using an intializer list  
    mymultiset s2{ "meow", "nikita", "nikita", "growl", "yellow" };  
  
    cout << "Starting data of multiset s2 is:" << endl;  
    printmultiset(s2);  
    // The 2nd member function removes elements  
    // in the range [First, Last)  
    s2.erase(next(s2.begin()), prev(s2.end()));  
    cout << "After the middle elements are deleted, the multiset s2 is:" << endl;  
    printmultiset(s2);  
  
    mymultiset s3;  
  
    // Fill in some data to test with, one at a time, using emplace  
    s3.emplace("C");  
    s3.emplace("C#");  
    s3.emplace("D");  
    s3.emplace("D#");  
    s3.emplace("E");  
    s3.emplace("E#");  
    s3.emplace("F");  
    s3.emplace("F#");  
    s3.emplace("G");  
    s3.emplace("G#");  
    s3.emplace("E");  
    s3.emplace("E#");  
    s3.emplace("B");  
  
    cout << "Starting data of multiset s3 is:" << endl;  
    printmultiset(s3);  
    // The 3rd member function removes elements with a given Key  
    mymultiset::size_type count = s3.erase("E#");  
    // The 3rd member function also returns the number of elements removed  
    cout << "The number of elements removed from s3 is: " << count << "." << endl;  
    cout << "After the element with a key of \"E#\" is deleted, the multiset s3 is:" << endl;  
    printmultiset(s3);  
}  

输出

Starting data of multiset s1 is:
 [Bob] [Bob] [Rob] [Rob] [Robert]
size() == 5

After the 2nd element is deleted, the multiset s1 is:
 [Bob] [Rob] [Rob] [Robert]
size() == 4

Starting data of multiset s2 is:
 [growl] [meow] [nikita] [nikita] [yellow]
size() == 5

After the middle elements are deleted, the multiset s2 is:
 [growl] [yellow]
size() == 2

Starting data of multiset s3 is:
 [B] [C] [C#] [D] [D#] [E] [E] [E#] [E#] [F] [F#] [G] [G#]
size() == 13

The number of elements removed from s3 is: 2.
After the element with a key of "E#" is deleted, the multiset s3 is:
 [B] [C] [C#] [D] [D#] [E] [E] [F] [F#] [G] [G#]
size() == 11

下一个主题C++ multiset

← 上一个下一个 →

C++ multiset erase()

语法

参数

返回值

复杂度

迭代器有效性

数据竞争

异常安全

示例 1

示例 2

示例 3

示例 4

示例 5

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

C++ 教程

C++ 控制语句

C++ 函数

C++ 数组

C++ 类和对象

C++ 构造函数

C++ 继承

C++ 多态

C++ 抽象

C++ 命名空间

C++ 模板

C++ 字符串

C++ 指针

信号处理

C++ 异常

C++ 文件与流

C++ STL 教程

面试题

选择题

C++ 程序

C++ STL Stack

C++ STL Bitset

C++ STL Deque

C++ STL List

C++ STL Map

C++ STL Math

C++ STL priority_queue

C++ STL Queue

C++ STL Multiset

C++ STL Multimap

C++ STL Set

C++ STD Strings

C++ STL Vector

C++ 操纵符

C++ STL Algorithms

C++ Algorithm

C++ Iterators

C++ 杂项

C++ multiset erase()

语法

参数

返回值

复杂度

迭代器有效性

数据竞争

异常安全

示例 1

示例 2

示例 3

示例 4

示例 5

相关帖子

multiset rend() 函数

multiset key_comp() 函数

multiset operator==

multiset operator>

multiset max_size() 函数

multiset size() 函数

multiset value_comp() 函数

multiset cend() 函数