[alg.req.mergeable] (original) (raw)

The mergeable concept specifies the requirements of algorithms that merge sorted sequences into an output sequence by copying elements.

template<class I1, class I2, class Out, class R = ranges::less,class P1 = identity, class P2 = identity> concept mergeable = input_­iterator<I1> && input_­iterator<I2> && weakly_­incrementable<Out> && indirectly_­copyable<I1, Out> && indirectly_­copyable<I2, Out> && indirect_­strict_­weak_­order<R, projected<I1, P1>, projected<I2, P2>>;