std::erase, std::erase_if(std::inplace_vector)
| 定义于头文件 <inplace_vector>
|
||
template< class T, std::size_t N, class U = T >
constexpr typename std::inplace_vector<T, N>::size_type
erase( std::inplace_vector<T, N>& c, const U& value );
|
(1) | (从C++26起) |
template< class T, std::size_t N, class Pred >
constexpr typename std::inplace_vector<T, N>::size_type
erase_if( std::inplace_vector<T, N>& c, Pred pred );
|
(2) | (从C++26起) |
value 比较相等的元素。等价于
auto it = std::remove(c.begin(), c.end(), value);
auto r = std::distance(it, c.end());
c.erase(it, c.end());
return r;
pred 的元素。等价于
auto it = std::remove_if(c.begin(), c.end(), pred);
auto r = std::distance(it, c.end());
c.erase(it, c.end());
return r;
参数
| c | - | 要执行擦除操作的容器 |
| value | - | 待移除的数值 |
| pred | - |
一元谓词,当元素应被擦除时返回
true
。
表达式
pred
(
v
)
必须可转换为
bool
,其中参数
|
返回值
被擦除的元素数量。
复杂度
线性。
示例
#include <algorithm>
#include <cassert>
#include <complex>
#include <inplace_vector>
#include <numeric>
#include <print>
#include <vector>
int main()
{
std::inplace_vector<int, 10> v(10, 0);
std::ranges::iota(v, 0);
std::println("Initially, v = {}", v);
auto erased = std::erase(v, 3);
std::println("After erase(v, 3), v = {}", v);
assert(erased == 1);
erased = std::erase_if(v, [](int x) { return x % 2 == 0; });
std::println("After erasing all even numbers, v = {}", v);
std::println("Erased even numbers: {}", erased);
std::inplace_vector<std::complex<double>, 4> nums{{2, 2}, {4, 2}, {4, 8}, {4, 2}};
std::erase(nums, {4, 2}); // since U = T, the value type can be omitted
assert(std::ranges::equal(nums, std::vector<std::complex<double>>({{2, 2}, {4, 8}})));
}
输出:
Initially, v = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
After erase(v, 3), v = [0, 1, 2, 4, 5, 6, 7, 8, 9]
After erasing all even numbers, v = [1, 5, 7, 9]
Erased even numbers: 5
另见
| 擦除元素 (公开成员函数) | |
| 移除满足特定条件的元素 (函数模板 & 算法函数对象) | |
(C++20)(C++20) |
|
(C++20)(C++20) |
移除满足特定条件的元素 (算法函数对象) |