/*============================================================================= Copyright (c) 2011-2019 Bolero MURAKAMI https://github.com/bolero-MURAKAMI/Sprout Distributed under 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) =============================================================================*/ #ifndef SPROUT_ALGORITHM_CXX14_SET_UNION_HPP #define SPROUT_ALGORITHM_CXX14_SET_UNION_HPP #include #include #include #include #include namespace sprout { // // 25.4.5.2 set_union // template< typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare, typename sprout::enabler_if::value>::type = sprout::enabler > inline SPROUT_CXX14_CONSTEXPR OutputIterator set_union(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp) { while (true) { if (first1 == last1) { return std::copy(first2, last2, result); } if (first2 == last2) { return std::copy(first1, last1, result); } if (comp(*first1, *first2)) { *result = *first1; ++first1; } else if (comp(*first2, *first1)) { *result = *first2; ++first2; } else { *result = *first1; ++first1; ++first2; } ++result; } } template< typename InputIterator1, typename InputIterator2, typename OutputIterator, typename sprout::enabler_if::value>::type = sprout::enabler > inline SPROUT_CXX14_CONSTEXPR OutputIterator set_union(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result) { return sprout::set_union( first1, last1, first2, last2, result, sprout::less<>() ); } } // namespace sprout #endif // #ifndef SPROUT_ALGORITHM_CXX14_SET_UNION_HPP