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
.
Semantic requirements
mergeable
is modeled only if all concepts it subsumes are modeled.
See also
(C++20) |
merges two sorted ranges (niebloid) |
(C++20) |
computes the union of two sets (niebloid) |
(C++20) |
computes the intersection of two sets (niebloid) |
(C++20) |
computes the difference between two sets (niebloid) |
computes the symmetric difference between two sets (niebloid) |