FM / cxx11

/usr/include/boost/algorithm/cxx11

Name	Size	Mode	Actions
all_of.hpp	2821	0644	edit dl rm
any_of.hpp	2812	0644	edit dl rm
copy_if.hpp	5474	0644	edit dl rm
copy_n.hpp	1274	0644	edit dl rm
find_if_not.hpp	1920	0644	edit dl rm
iota.hpp	2135	0644	edit dl rm
is_partitioned.hpp	2147	0644	edit dl rm
is_permutation.hpp	8096	0644	edit dl rm
is_sorted.hpp	11072	0644	edit dl rm
none_of.hpp	2799	0644	edit dl rm
one_of.hpp	2910	0644	edit dl rm
partition_copy.hpp	2967	0644	edit dl rm
partition_point.hpp	2095	0644	edit dl rm

Edit: /usr/include/boost/algorithm/cxx11/partition_point.hpp (2095B)

/* 
   Copyright (c) Marshall Clow 2011-2012.

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  partition_point.hpp
/// \brief Find the partition point in a sequence
/// \author Marshall Clow

#ifndef BOOST_ALGORITHM_PARTITION_POINT_HPP
#define BOOST_ALGORITHM_PARTITION_POINT_HPP

#include <iterator>    // for std::distance, advance

#include <boost/config.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>

namespace boost { namespace algorithm {

/// \fn partition_point ( ForwardIterator first, ForwardIterator last, Predicate p )
/// \brief Given a partitioned range, returns the partition point, i.e, the first element 
///     that does not satisfy p
/// 
/// \param first    The start of the input sequence
/// \param last     One past the end of the input sequence
/// \param p        The predicate to test the values with
/// \note           This function is part of the C++2011 standard library.
template <typename ForwardIterator, typename Predicate>
ForwardIterator partition_point ( ForwardIterator first, ForwardIterator last, Predicate p )
{
    std::size_t dist = std::distance ( first, last );
    while ( first != last ) {
        std::size_t d2 = dist / 2;
        ForwardIterator ret_val = first;
        std::advance (ret_val, d2);
        if (p (*ret_val)) {
            first = ++ret_val;
            dist -= d2 + 1;
            }
        else {
            last = ret_val;
            dist = d2;
            }
        }
    return first;
}

/// \fn partition_point ( Range &r, Predicate p )
/// \brief Given a partitioned range, returns the partition point
/// 
/// \param r        The input range
/// \param p        The predicate to test the values with
///
template <typename Range, typename Predicate>
typename boost::range_iterator<Range>::type partition_point ( Range &r, Predicate p )
{
    return boost::algorithm::partition_point (boost::begin(r), boost::end(r), p);
}

}}

#endif  // BOOST_ALGORITHM_PARTITION_POINT_HPP

/* Copyright (c) Marshall Clow 2011-2012. 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 partition_point.hpp /// \brief Find the partition point in a sequence /// \author Marshall Clow #ifndef BOOST_ALGORITHM_PARTITION_POINT_HPP #define BOOST_ALGORITHM_PARTITION_POINT_HPP #include // for std::distance, advance #include #include #include namespace boost { namespace algorithm { /// \fn partition_point ( ForwardIterator first, ForwardIterator last, Predicate p ) /// \brief Given a partitioned range, returns the partition point, i.e, the first element /// that does not satisfy p /// /// \param first The start of the input sequence /// \param last One past the end of the input sequence /// \param p The predicate to test the values with /// \note This function is part of the C++2011 standard library. template ForwardIterator partition_point ( ForwardIterator first, ForwardIterator last, Predicate p ) { std::size_t dist = std::distance ( first, last ); while ( first != last ) { std::size_t d2 = dist / 2; ForwardIterator ret_val = first; std::advance (ret_val, d2); if (p (*ret_val)) { first = ++ret_val; dist -= d2 + 1; } else { last = ret_val; dist = d2; } } return first; } /// \fn partition_point ( Range &r, Predicate p ) /// \brief Given a partitioned range, returns the partition point /// /// \param r The input range /// \param p The predicate to test the values with /// template typename boost::range_iterator::type partition_point ( Range &r, Predicate p ) { return boost::algorithm::partition_point (boost::begin(r), boost::end(r), p); } }} #endif // BOOST_ALGORITHM_PARTITION_POINT_HPP