std::mergeable
From cppreference.com
Defined in header <iterator> | ||
template<class I1, class I2, class Out, class Comp =ranges::less, class Proj1 =std::identity, class Proj2 =std::identity> | (since C++20) | |
The mergeable
concept specifies the requirements for algorithms that merge two input ranges into a single output range according to the strict weak ordering imposed by Comp
.
[edit]Semantic requirements
mergeable
is modeled only if all concepts it subsumes are modeled.
[edit]See also
(C++20) | merges two sorted ranges (algorithm function object) |
(C++20) | computes the union of two sets (algorithm function object) |
(C++20) | computes the intersection of two sets (algorithm function object) |
(C++20) | computes the difference between two sets (algorithm function object) |
computes the symmetric difference between two sets (algorithm function object) |