std::erase, std::erase_if(std::inplace_vector)
来自 cppreference.com
定义在头文件 <inplace_vector> 中 |
||
template< class T, std::size_t N, class U = T > constexpr typename std::inplace_vector<T, N>::size_type |
(1) | (自 C++26 起) |
template< class T, std::size_t N, class Pred > constexpr typename std::inplace_vector<T, N>::size_type |
(2) | (自 C++26 起) |
1) 从容器中删除所有与 value 相等的元素。等效于
auto it = std::remove(c.begin(), c.end(), value); auto r = std::distance(it, c.end()); c.erase(it, c.end()); return r;
2) 从容器中删除所有满足谓词 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,以用于类型为 (可能为 const) |
[编辑] 返回值
删除的元素数。
[编辑] 复杂度
线性。
[编辑] 示例
运行此代码
#include <cassert> #include <complex> #include <inplace_vector> #include <numeric> #include <print> 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>> nums{{2, 2}, {4, 2}, {4, 8}, {4, 2}}; std::erase(nums, {4, 2}); // since U = T, the value type can be ommited std::println("After erase {4, 2}, nums = {}", nums); }
输出
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 After erase {4, 2}, nums = [(2,2), (4,8)]
[编辑] 参见
删除满足特定条件的元素 (函数模板) | |
(C++20)(C++20) |
删除满足特定条件的元素 (niebloid) |