Namespaces
Variants

    std::experimental::ranges:: Mergeable

    From de.cppreference.net
    C++
    Experimental
    Ranges
    Iterators library
    Iterator concepts
    Indirect callable concepts
    Common algorithm requirements
    Concept utilities
    Iterator utilities and operations
    Iterator traits
    Iterator adaptors
    Stream iterators
    template < class I1, class I2, class Out, class R = ranges:: less <> ,

    class P1 = ranges:: identity , class P2 = ranges:: identity >
    Konzept bool Mergeable =
    InputIterator < I1 > &&
    InputIterator < I2 > &&
    WeaklyIncrementable < Out > &&
    IndirectlyCopyable < I1, Out > &&
    IndirectlyCopyable < I2, Out > &&

    IndirectStrictWeakOrder < R, ranges :: projected < I1, P1 > , ranges :: projected < I2, P2 >> ;
    		(ranges TS)

    Das Mergeable -Konzept spezifiziert die allgemeinen Anforderungen von Algorithmen, die sortierte Sequenzen durch Kopieren der Elemente in eine Ausgabesequenz zusammenführen (zum Beispiel ranges::merge ).