std::ranges::includes
| 定义于头文件 <algorithm> |
||
| 调用签名 (Call signature) |
||
| template< std::input_iterator I1, std::sentinel_for<I1> S1, std::input_iterator I2, std::sentinel_for<I2> S2, |
(1) | (C++20 起) |
| template< ranges::input_range R1, ranges::input_range R2, class Proj1 = std::identity, class Proj2 = std::identity, |
(2) | (C++20 起) |
两个范围都必须用给定的比较函数 comp 排序。子序列不必是连续的。
本页描述的类函数实体是 算法函数对象（非正式地称为 niebloids），即
目录 |
[编辑] 参数
| first1, last1 | - | 定义要检查的已排序范围元素的迭代器-哨兵对 |
| r1 | - | 要检查的已排序元素范围 |
| first2, last2 | - | 定义要搜索的已排序范围元素的迭代器-哨兵对 |
| r2 | - | 要搜索的已排序元素范围 |
| comp | - | 应用于投影元素的比较函数 |
| proj1 | - | 应用于第一个范围中元素的投影 |
| proj2 | - | 应用于第二个范围中元素的投影 |
[编辑] 返回值
如果 [first2, last2) 是 [first1, last1) 的子序列，则返回 true；否则返回 false。
[编辑] 复杂度
最多 2·(N1+N2-1) 次比较，其中 N1 是 ranges::distance(r1)，N2 是 ranges::distance(r2)。
[编辑] 可能实现
struct includes_fn { template<std::input_iterator I1, std::sentinel_for<I1> S1, std::input_iterator I2, std::sentinel_for<I2> S2, class Proj1 = std::identity, class Proj2 = std::identity, std::indirect_strict_weak_order< std::projected<I1, Proj1>, std::projected<I2, Proj2>> Comp = ranges::less> constexpr bool operator()(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) const { for (; first2 != last2; ++first1) { if (first1 == last1 || comp(*first2, *first1)) return false; if (!comp(*first1, *first2)) ++first2; } return true; } template<ranges::input_range R1, ranges::input_range R2, class Proj1 = std::identity, class Proj2 = std::identity, std::indirect_strict_weak_order< std::projected<ranges::iterator_t<R1>, Proj1>, std::projected<ranges::iterator_t<R2>, Proj2>> Comp = ranges::less> constexpr bool operator()(R1&& r1, R2&& r2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) const { return (*this)(ranges::begin(r1), ranges::end(r1), ranges::begin(r2), ranges::end(r2), std::ref(comp), std::ref(proj1), std::ref(proj2)); } }; inline constexpr auto includes = includes_fn {}; |
[编辑] 示例
#include <algorithm> #include <cctype> #include <initializer_list> #include <iomanip> #include <iostream> #include <locale> #include <string> template<class T> std::ostream& operator<<(std::ostream& os, std::initializer_list<T> const& list) { for (os << "{ "; auto const& elem : list) os << elem << ' '; return os << "} "; } struct true_false : std::numpunct<char> { std::string do_truename() const { return "? Yes\n"; } std::string do_falsename() const { return "? No\n"; } }; int main() { std::cout.imbue(std::locale(std::cout.getloc(), new true_false)); auto ignore_case = [](char a, char b) { return std::tolower(a) < std::tolower(b); }; const auto a = {'a', 'b', 'c'}, b = {'a', 'c'}, c = {'a', 'a', 'b'}, d = {'g'}, e = {'a', 'c', 'g'}, f = {'A', 'B', 'C'}, z = {'a', 'b', 'c', 'f', 'h', 'x'}; std::cout << z << "includes\n" << std::boolalpha << a << std::ranges::includes(z.begin(), z.end(), a.begin(), a.end()) << b << std::ranges::includes(z, b) << c << std::ranges::includes(z, c) << d << std::ranges::includes(z, d) << e << std::ranges::includes(z, e) << f << std::ranges::includes(z, f, ignore_case); }
输出
{ a b c f h x } includes
{ a b c } ? Yes
{ a c } ? Yes
{ a a b } ? No
{ g } ? No
{ a c g } ? No
{ A B C } ? Yes[编辑] 参阅
| (C++20) |
计算两个集合的差集 (算法函数对象) |
| (C++20) |
搜索一个范围的元素首次出现的位置 (算法函数对象) |
| (C++23)(C++23) |
检查范围是否包含给定的元素或子范围 (算法函数对象) |
| 如果一个序列是另一个序列的子序列，则返回 true (函数模板) |
