Add move_while and move_until new algorithms

doc/algorithm.qbk

@@ -150,6 +150,23 @@ Copy all elements that satisfy the element predicate from the start of the input
 [endsect:Copy]
 
 
+[section:Move Variations on Move]
+[section:variations_on_move]
+
+[section:move_until                move_until                ]
+[*[^[link header.boost.algorithm.cxx11.move_if_hpp                   move_until]                  ] ]
+Move all the elements from the start of the input range to the output range until the predicate is satisfied
+[endsect:move_until]
+
+[section:move_while                move_while                ]
+[*[^[link header.boost.algorithm.cxx11.move_if_hpp                   move_while]                  ] ]
+Move all the elements from the start of the input range to the output range while the predicate is satisfied
+[endsect:move_while]
+
+[endsect:variations_on_move]
+[endsect:Move]
+
+
 [section:Misc Other Algorithms]
 
 [section:misc_inner_algorithms]

include/boost/algorithm/cxx11/move_if.hpp

@@ -0,0 +1,96 @@
+/* 
+   Copyright (c) Denis Mikhailov 2022.
+
+   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)
+*/
+
+/// \file  move_if.hpp
+/// \brief Move a subset of a sequence to a new sequence
+/// \author Denis Mikhailov
+
+#ifndef BOOST_ALGORITHM_MOVE_IF_HPP
+#define BOOST_ALGORITHM_MOVE_IF_HPP
+
+#include <utility>    // for std::pair, std::make_pair, std::move
+
+#include <boost/config.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/end.hpp>
+
+namespace boost { namespace algorithm {
+
+/// \fn move_while ( InputIterator first, InputIterator last, OutputIterator d_first, Predicate p )
+/// \brief Moves all the elements at the start of the range that
+///     satisfy the predicate to the another range.
+/// \return Updated two iterators for the first and the second range
+/// 
+/// \param first    The start of the range to move
+/// \param last     One past the end of the range to move
+/// \param d_first  The start of the destination range
+/// \param p        A predicate for testing the elements of the range
+/// \note           C++11-compatible compiler required.
+template<typename InputIterator, typename OutputIterator, typename Predicate> 
+BOOST_CXX14_CONSTEXPR std::pair<InputIterator, OutputIterator>
+move_while ( InputIterator first, InputIterator last, OutputIterator d_first, Predicate p )
+{
+    while (first != last && p(*first))
+        *d_first++ = std::move(*first++);
+    return std::make_pair(first, d_first);
+}
+
+/// \fn move_while ( const Range &r, OutputIterator d_first, Predicate p )
+/// \brief Moves all the elements at the start of the range that
+///     satisfy the predicate to the another range.
+/// \return Updated two iterators for the first and the second range
+/// 
+/// \param r        The range to move
+/// \param d_first  The start of the destination range
+/// \param p        A predicate for testing the elements of the range
+/// \note           C++11-compatible compiler required.
+template<typename Range, typename OutputIterator, typename Predicate>
+BOOST_CXX14_CONSTEXPR std::pair<typename boost::range_iterator<Range>::type, OutputIterator> 
+move_while ( Range &r, OutputIterator d_first, Predicate p )
+{
+    return boost::algorithm::move_while (boost::begin (r), boost::end(r), d_first, p);
+}
+
+
+/// \fn move_until ( InputIterator first, InputIterator last, OutputIterator d_first, Predicate p )
+/// \brief Moves all the elements at the start of the range that do not
+///     satisfy the predicate to the another range.
+/// \return Updated two iterators for the first and the second range
+/// 
+/// \param first    The start of the range to move
+/// \param last     One past the end of the range to move
+/// \param d_first  The start of the destination range
+/// \param p        A predicate for testing the elements of the range
+/// \note           C++11-compatible compiler required.
+template<typename InputIterator, typename OutputIterator, typename Predicate> 
+BOOST_CXX14_CONSTEXPR std::pair<InputIterator, OutputIterator>
+move_until ( InputIterator first, InputIterator last, OutputIterator d_first, Predicate p )
+{
+    while (first != last && !p(*first))
+        *d_first++ = std::move(*first++);
+    return std::make_pair(first, d_first);
+}
+
+/// \fn move_until ( const Range &r, OutputIterator d_first, Predicate p )
+/// \brief Moves all the elements at the start of the range that do not
+///     satisfy the predicate to the another range.
+/// \return Updated two iterators for the first and the second range
+/// 
+/// \param r        The range to move
+/// \param d_first  The start of the destination range
+/// \param p        A predicate for testing the elements of the range
+/// \note           C++11-compatible compiler required.
+template<typename Range, typename OutputIterator, typename Predicate>
+BOOST_CXX14_CONSTEXPR std::pair<typename boost::range_iterator<Range>::type, OutputIterator> 
+move_until ( Range &r, OutputIterator d_first, Predicate p )
+{
+    return boost::algorithm::move_until (boost::begin (r), boost::end(r), d_first, p);
+}
+
+}} // namespace boost and algorithm
+
+#endif  // BOOST_ALGORITHM_MOVE_IF_HPP

test/Jamfile.v2

@@ -42,6 +42,7 @@ alias unit_test_framework
      [ run ordered_test.cpp unit_test_framework        : : : : ordered_test ]
      [ run find_if_not_test1.cpp unit_test_framework   : : : : find_if_not_test1 ]
      [ run copy_if_test1.cpp unit_test_framework        : : : : copy_if_test1 ]
+     [ run move_if_test1.cpp unit_test_framework        : : : : move_if_test1 ]
      [ run copy_n_test1.cpp unit_test_framework       : : : : copy_n_test1 ]
      [ run iota_test1.cpp unit_test_framework          : : : : iota_test1 ]