# std::experimental::ranges::Mergeable

> C++ Atlas: `cppatlas.com/w/cpp/experimental/ranges/iterator/Mergeable` | Source: https://en.cppreference.com/w/cpp/experimental/ranges/iterator/Mergeable | Domain: Technical specifications

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).

## Official Specification Summary (cppreference)

```cpp
template< class I1, class I2, class Out, class R = ranges::less<>,
          class P1 = ranges::identity, class P2 = ranges::identity >
concept 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)
```

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`).

---
Attribution: content from https://en.cppreference.com/w/cpp/experimental/ranges/iterator/Mergeable (cppreference.com), licensed under CC-BY-SA 3.0 and GFDL. Modified: converted to markdown, study notes added. Offline snapshot of 9 February 2025.