C++

參考

<set>

set

public member function
<set>

std::set::erase

(1)
     void erase (iterator position);
(2)
size_type erase (const value_type& val);
(3)
     void erase (iterator first, iterator last);
(1)
iterator  erase (const_iterator position);
(2)
size_type erase (const value_type& val);
(3)
iterator  erase (const_iterator first, const_iterator last);
Erase elements
Removes from the set container either a single element or a range of elements ([first,last)).

This effectively reduces the container size by the number of elements removed, which are destroyed.

引數

position
Iterator pointing to a single element to be removed from the set.
成員型別iterator和const_iteratorare bidirectional iterator types that point to elements.
val
Value to be removed from the set.
成員型別value_type是容器中元素的型別，在 set 中定義為其第一個模板引數的別名（T).
first, last
Iterators specifying a range within the set container to be removed[first,last). i.e., the range includes all the elements between first and last, including the element pointed by first but not the one pointed by last.
成員型別iterator和const_iteratorare bidirectional iterator types that point to elements.

返回值

For the value-based version (2), the function returns the number of elements erased.

成員型別size_type是一種無符號整型型別。

The other versions return no value.
The other versions return an iterator to the element that follows the last element removed (or set::end, if the last element was removed).

成員型別iterator是指向元素的雙向迭代器型別。

示例

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
 
// erasing from set
#include <iostream>
#include <set>

int main ()
{
  std::set<int> myset;
  std::set<int>::iterator it;

  // insert some values:
  for (int i=1; i<10; i++) myset.insert(i*10);  // 10 20 30 40 50 60 70 80 90

  it = myset.begin();
  ++it;                                         // "it" points now to 20

  myset.erase (it);

  myset.erase (40);

  it = myset.find (60);
  myset.erase (it, myset.end());

  std::cout << "myset contains:";
  for (it=myset.begin(); it!=myset.end(); ++it)
    std::cout << ' ' << *it;
  std::cout << '\n';

  return 0;
}
輸出
myset contains: 10 30 50


複雜度

For the first version (erase(position)), amortized constant.
For the second version (erase(val)), logarithmic in container size.
For the last version (erase(first,last)), linear in the distance between first and last.

迭代器有效性

Iterators, pointers and references referring to elements removed by the function are invalidated.
All other iterators, pointers and references keep their validity.

資料競爭

The container is modified.
The elements removed are modified. Concurrently accessing other elements is safe, although iterating ranges in the container is not.

異常安全

Unless the container's comparison object throws, this function never throws exceptions (no-throw guarantee).
Otherwise, if a single element is to be removed, there are no changes in the container in case of exception (strong guarantee).
Otherwise, the container is guaranteed to end in a valid state (basic guarantee).
If an invalid position or range is specified, it causes undefined behavior.

另見

set::clear
清除內容 (公開成員函式)
set::insert
插入元素 (公開成員函式)
set::find
獲取指向元素的迭代器 (公共成員函式)