/// \file
// Range v3 library
//
//  Copyright Eric Niebler 2014
//
//  Use, modification and distribution is subject to the
//  Boost Software License, Version 1.0. (See accompanying
//  file LICENSE_1_0.txt or copy at
//  http://www.boost.org/LICENSE_1_0.txt)
//
// Project home: https://github.com/ericniebler/range-v3
//
// Copyright (c) 2009 Alexander Stepanov and Paul McJones
//
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without
// fee, provided that the above copyright notice appear in all copies
// and that both that copyright notice and this permission notice
// appear in supporting documentation. The authors make no
// representations about the suitability of this software for any
// purpose. It is provided "as is" without express or implied
// warranty.
//
// Algorithms from
// Elements of Programming
// by Alexander Stepanov and Paul McJones
// Addison-Wesley Professional, 2009
#ifndef RANGES_V3_ALGORITHM_MERGE_HPP
#define RANGES_V3_ALGORITHM_MERGE_HPP

#include <tuple>
#include <range/v3/range_fwd.hpp>
#include <range/v3/begin_end.hpp>
#include <range/v3/range_concepts.hpp>
#include <range/v3/range_traits.hpp>
#include <range/v3/utility/functional.hpp>
#include <range/v3/utility/iterator_traits.hpp>
#include <range/v3/algorithm/copy.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/utility/tagged_tuple.hpp>
#include <range/v3/algorithm/tagspec.hpp>

namespace ranges
{
    inline namespace v3
    {
        /// \addtogroup group-algorithms
        /// @{
        struct merge_fn
        {
            template<typename I0, typename S0, typename I1, typename S1, typename O,
                typename C = ordered_less, typename P0 = ident, typename P1 = ident,
                CONCEPT_REQUIRES_(
                    Sentinel<S0, I0>() &&
                    Sentinel<S1, I1>() &&
                    Mergeable<I0, I1, O, C, P0, P1>()
                )>
            tagged_tuple<tag::in1(I0), tag::in2(I1), tag::out(O)>
            operator()(I0 begin0, S0 end0, I1 begin1, S1 end1, O out, C pred = C{},
                P0 proj0 = P0{}, P1 proj1 = P1{}) const
            {
                for(; begin0 != end0 && begin1 != end1; ++out)
                {
                    if(invoke(pred, invoke(proj1, *begin1), invoke(proj0, *begin0)))
                    {
                        *out = *begin1;
                        ++begin1;
                    }
                    else
                    {
                        *out = *begin0;
                        ++begin0;
                    }
                }
                auto t0 = copy(begin0, end0, out);
                auto t1 = copy(begin1, end1, t0.second);
                return make_tagged_tuple<tag::in1, tag::in2, tag::out>(t0.first, t1.first, t1.second);
            }

            template<typename Rng0, typename Rng1, typename O, typename C = ordered_less,
                typename P0 = ident, typename P1 = ident,
                typename I0 = iterator_t<Rng0>,
                typename I1 = iterator_t<Rng1>,
                CONCEPT_REQUIRES_(
                    Range<Rng0>() &&
                    Range<Rng1>() &&
                    Mergeable<I0, I1, O, C, P0, P1>()
                )>
            tagged_tuple<tag::in1(safe_iterator_t<Rng0>), tag::in2(safe_iterator_t<Rng1>), tag::out(O)>
            operator()(Rng0 &&rng0, Rng1 &&rng1, O out, C pred = C{}, P0 proj0 = P0{},
                P1 proj1 = P1{}) const
            {
                return (*this)(begin(rng0), end(rng0), begin(rng1), end(rng1), std::move(out),
                    std::move(pred), std::move(proj0), std::move(proj1));
            }
        };

        /// \sa `merge_fn`
        /// \ingroup group-algorithms
        RANGES_INLINE_VARIABLE(with_braced_init_args<merge_fn>, merge)
        /// @}
    } // namespace v3
} // namespace ranges

#endif // include guard
