eedb/share/include/range/v3/algorithm/swap_ranges.hpp
Wieczorek Bartosz f4ef592706 add ranges lib
2017-03-18 08:15:40 +01:00

90 lines
3.3 KiB
C++

/// \file
// Range v3 library
//
// Copyright Eric Niebler 2013-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
//
#ifndef RANGES_V3_ALGORITHM_SWAP_RANGES_HPP
#define RANGES_V3_ALGORITHM_SWAP_RANGES_HPP
#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/iterator_concepts.hpp>
#include <range/v3/utility/iterator_traits.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/utility/tagged_pair.hpp>
#include <range/v3/algorithm/tagspec.hpp>
namespace ranges
{
inline namespace v3
{
/// \addtogroup group-algorithms
/// @{
struct swap_ranges_fn
{
template<typename I1, typename S1, typename I2,
CONCEPT_REQUIRES_(InputIterator<I1>() && Sentinel<S1, I1>() &&
InputIterator<I2>() && IndirectlySwappable<I1, I2>())>
tagged_pair<tag::in1(I1), tag::in2(I2)>
operator()(I1 begin1, S1 end1, I2 begin2) const
{
for(; begin1 != end1; ++begin1, ++begin2)
ranges::iter_swap(begin1, begin2);
return {begin1, begin2};
}
template<typename I1, typename S1, typename I2, typename S2,
CONCEPT_REQUIRES_(InputIterator<I1>() && Sentinel<S1, I1>() &&
InputIterator<I2>() && Sentinel<S2, I2>() &&
IndirectlySwappable<I1, I2>())>
tagged_pair<tag::in1(I1), tag::in2(I2)>
operator()(I1 begin1, S1 end1, I2 begin2, S2 end2) const
{
for(; begin1 != end1 && begin2 != end2; ++begin1, ++begin2)
ranges::iter_swap(begin1, begin2);
return {begin1, begin2};
}
template<typename Rng1, typename I2_,
typename I1 = iterator_t<Rng1>,
typename I2 = uncvref_t<I2_>,
CONCEPT_REQUIRES_(InputRange<Rng1>() && InputIterator<I2>() &&
IndirectlySwappable<I1, I2>())>
tagged_pair<tag::in1(I1), tag::in2(I2)>
operator()(Rng1 && rng1, I2_ && begin2) const
{
return (*this)(begin(rng1), end(rng1), (I2_ &&)begin2);
}
template<typename Rng1, typename Rng2,
typename I1 = iterator_t<Rng1>,
typename I2 = iterator_t<Rng2>,
CONCEPT_REQUIRES_(InputRange<Rng1>() && InputRange<Rng2>() &&
IndirectlySwappable<I1, I2>())>
tagged_pair<
tag::in1(safe_iterator_t<Rng1>),
tag::in2(safe_iterator_t<Rng2>)>
operator()(Rng1 && rng1, Rng2 && rng2) const
{
return (*this)(begin(rng1), end(rng1), begin(rng2), end(rng2));
}
};
/// \sa `swap_ranges_fn`
/// \ingroup group-algorithms
RANGES_INLINE_VARIABLE(with_braced_init_args<swap_ranges_fn>, swap_ranges)
/// @}
} // namespace v3
} // namespace ranges
#endif // include guard