Namespaces
Variants

std::ranges:: set_symmetric_difference, std::ranges:: set_symmetric_difference_result

From cppreference.net
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy , ranges::sort , ...
Execution policies (C++17)
Non-modifying sequence operations
Batch operations
(C++17)
Search operations
Modifying sequence operations
Copy operations
(C++11)
(C++11)
Swap operations
Transformation operations
Generation operations
Removing operations
Order-changing operations
(until C++17) (C++11)
(C++20) (C++20)
Sampling operations
(C++17)

Sorting and related operations
Partitioning operations
Sorting operations
Binary search operations
(on partitioned ranges)
Set operations (on sorted ranges)
Merge operations (on sorted ranges)
Heap operations
Minimum/maximum operations
Lexicographical comparison operations
Permutation operations
C library
Numeric operations
Operations on uninitialized memory
Constrained algorithms
All names in this menu belong to namespace std::ranges
Non-modifying sequence operations
Modifying sequence operations
Partitioning operations
Sorting operations
Binary search operations (on sorted ranges)
Set operations (on sorted ranges)
Heap operations
Minimum/maximum operations
Permutation operations
Fold operations
Operations on uninitialized storage
Return types
定义于头文件 <algorithm>
调用签名
template < std:: input_iterator I1, std:: sentinel_for < I1 > S1,

std:: input_iterator I2, std:: sentinel_for < I2 > S2,
std:: weakly_incrementable O, class Comp = ranges:: less ,
class Proj1 = std:: identity , class Proj2 = std:: identity >
requires std:: mergeable < I1, I2, O, Comp, Proj1, Proj2 >
constexpr set_symmetric_difference_result < I1, I2, O >
set_symmetric_difference ( I1 first1, S1 last1, I2 first2, S2 last2,
O result, Comp comp = { } ,

Proj1 proj1 = { } , Proj2 proj2 = { } ) ;
(1) (C++20 起)
template < ranges:: input_range R1, ranges:: input_range R2,

std:: weakly_incrementable O, class Comp = ranges:: less ,
class Proj1 = std:: identity , class Proj2 = std:: identity >
requires std:: mergeable < ranges:: iterator_t < R1 > , ranges:: iterator_t < R2 > ,
O, Comp, Proj1, Proj2 >
constexpr set_symmetric_difference_result < ranges:: borrowed_iterator_t < R1 > ,
ranges:: borrowed_iterator_t < R2 > , O >
set_symmetric_difference ( R1 && r1, R2 && r2, O result, Comp comp = { } ,

Proj1 proj1 = { } , Proj2 proj2 = { } ) ;
(2) (C++20 起)
辅助类型
template < class I1, class I2, class O >
using set_symmetric_difference_result = ranges:: in_in_out_result < I1, I2, O > ;
(3) (C++20 起)

计算两个已排序范围的对称差:将存在于任一范围但不同时存在于两个范围中的元素复制到始于 result 的范围。结果范围同样保持有序。

如果某个元素在 [ first1 , last1 ) 中出现 m 次,在 [ first2 , last2 ) 中出现 n 次,则该元素将被复制到 result 中恰好 │m - n│ 次。若 m > n ,则从 [ first1 , last1 ) 复制最后 m - n 个该元素;否则从 [ first2 , last2 ) 复制最后 n - m 个该元素。结果范围不能与任一输入范围重叠。

如果出现以下情况,则行为未定义:

  • 输入范围未分别相对于 comp proj1 proj2 进行排序,或
  • 结果范围与任一输入范围存在重叠。
1) 使用给定的二元比较函数 comp 对元素进行比较。
2) (1) 相同,但使用 r1 作为第一范围, r2 作为第二范围,如同使用 ranges:: begin ( r1 ) 作为 first1 ranges:: end ( r1 ) 作为 last1 ranges:: begin ( r2 ) 作为 first2 ,以及 ranges:: end ( r2 ) 作为 last2

本页面描述的函数式实体是 算法函数对象 (非正式称为 niebloids ),即:

目录

参数

first1, last1 - 定义第一个输入有序 范围 元素的迭代器-哨位对
first2, last2 - 定义第二个输入有序 范围 元素的迭代器-哨位对
r1 - 第一个有序输入范围
r2 - 第二个有序输入范围
result - 输出范围的起始位置
comp - 应用于投影元素的比较器
proj1 - 应用于第一个范围元素的投影器
proj2 - 应用于第二个范围元素的投影器

返回值

{ last1, last2, result_last } ,其中 result_last 表示已构造范围的末端。

复杂度

最多进行 2·(N 1 +N 2 )-1 次比较和每次投影的应用,其中 N 1 N 2 分别是 ranges:: distance ( first1, last1 ) ranges:: distance ( first2, last2 )

可能的实现

struct set_symmetric_difference_fn
{
    template<std::input_iterator I1, std::sentinel_for<I1> S1,
             std::input_iterator I2, std::sentinel_for<I2> S2,
             std::weakly_incrementable O, class Comp = ranges::less,
             class Proj1 = std::identity, class Proj2 = std::identity>
    requires std::mergeable<I1, I2, O, Comp, Proj1, Proj2>
    constexpr ranges::set_symmetric_difference_result<I1, I2, O>
        operator()(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
                   Proj1 proj1 = {}, Proj2 proj2 = {}) const
    {
        while (!(first1 == last1 or first2 == last2))
        {
            if (std::invoke(comp, std::invoke(proj1, *first1), std::invoke(proj2, *first2)))
            {
                *result = *first1;
                ++first1;
                ++result;
            }
            else if (std::invoke(comp, std::invoke(proj2, *first2),
                                       std::invoke(proj1, *first1)))
            {
                *result = *first2;
                ++first2;
                ++result;
            }
            else
            {
                ++first1;
                ++first2;
            }
        }
        auto res1 {ranges::copy(std::move(first1), std::move(last1), std::move(result))};
        auto res2 {ranges::copy(std::move(first2), std::move(last2), std::move(res1.out))};
        return {std::move(res1.in), std::move(res2.in), std::move(res2.out)};
    }
    template<ranges::input_range R1, ranges::input_range R2,
             std::weakly_incrementable O, class Comp = ranges::less,
             class Proj1 = std::identity, class Proj2 = std::identity>
    requires std::mergeable<ranges::iterator_t<R1>, ranges::iterator_t<R2>,
                            O, Comp, Proj1, Proj2>
    constexpr ranges::set_symmetric_difference_result<
        ranges::borrowed_iterator_t<R1>, ranges::borrowed_iterator_t<R2>, O>
        operator()(R1&& r1, R2&& r2, O result, Comp comp = {},
                   Proj1 proj1 = {}, Proj2 proj2 = {}) const
    {
        return (*this)(ranges::begin(r1), ranges::end(r1),
                       ranges::begin(r2), ranges::end(r2),
                       std::move(result), std::move(comp),
                       std::move(proj1), std::move(proj2));
    }
};
inline constexpr set_symmetric_difference_fn set_symmetric_difference {};

示例

#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
void visualize_this(const auto& v, int min = 1, int max = 9)
{
    for (auto i {min}; i <= max; ++i)
    {
        std::ranges::binary_search(v, i) ? std::cout << i : std::cout << '.';
        std::cout << ' ';
    }
    std::cout << '\n';
}
int main()
{
    const auto in1 = {1, 3, 4,    6, 7, 9};
    const auto in2 = {1,    4, 5, 6,    9};
    std::vector<int> out {};
    std::ranges::set_symmetric_difference(in1, in2, std::back_inserter(out));
    visualize_this(in1);
    visualize_this(in2);
    visualize_this(out);
}

输出:

1 . 3 4 . 6 7 . 9
1 . . 4 5 6 . . 9
. . 3 . 5 . 7 . .

参见

计算两个集合的并集
(算法函数对象)
计算两个集合的差集
(算法函数对象)
计算两个集合的交集
(算法函数对象)
若一个序列是另一个序列的子序列则返回 true
(算法函数对象)
计算两个集合的对称差
(函数模板)