Namespaces
Variants
Views
Actions

std::experimental::ranges::Mergeable

From cppreference.com
< cpp‎ | experimental‎ | ranges
 
 
Technical specifications
Filesystem library (filesystem TS)
Library fundamentals (library fundamentals TS)
Library fundamentals 2 (library fundamentals 2 TS)
Extensions for parallelism (parallelism TS)
Extensions for concurrency (concurrency TS)
Concepts (concepts TS)
Ranges (ranges TS)
Special mathematical functions (special math TR)
 
 
Iterators library
Iterator concepts
Indirect callable concepts
                                                  
                                                  
                                                  
Common algorithm requirements
                                                  
Mergeable
Range concepts
Concept utilities
Iterator utilities and operations
Iterator traits
Iterator adaptors
Stream iterators
Range access
Range primitives
 
template < class I1, class I2, class Out, class R = ranges::less<>,

           class P1 = ranges::identity, class P2 = ranges::identity >
concept bool Mergeable() {
    return ranges::InputIterator<I1>() && ranges::InputIterator<I2>() &&
           ranges::WeaklyIncrementable<Out>() &&
           ranges::IndirectlyCopyable<I1, Out>() &&
           ranges::IndirectlyCopyable<I2, Out>() &&
           ranges::IndirectStrictWeakOrder<R, ranges::projected<I1, P1>,
                                              ranges::projected<I2, P2>>();

}
(ranges TS)

The Mergeable concept specifies the common requirements of algorithms that merge sorted sequences into an output sequence by copying the elements (for example, ranges::merge).