FM / algorithm

/usr/include/boost/range/algorithm

Name	Size	Mode	Actions
adjacent_find.hpp	4388	0644	edit dl rm
binary_search.hpp	1570	0644	edit dl rm
copy.hpp	1230	0644	edit dl rm
copy_backward.hpp	1485	0644	edit dl rm
count.hpp	1542	0644	edit dl rm
count_if.hpp	1673	0644	edit dl rm
equal.hpp	9018	0644	edit dl rm
equal_range.hpp	2765	0644	edit dl rm
fill.hpp	1361	0644	edit dl rm
fill_n.hpp	1692	0644	edit dl rm
find.hpp	2549	0644	edit dl rm
find_end.hpp	5780	0644	edit dl rm
find_first_of.hpp	6128	0644	edit dl rm
find_if.hpp	2723	0644	edit dl rm
for_each.hpp	3737	0644	edit dl rm
generate.hpp	1479	0644	edit dl rm
heap_algorithm.hpp	6408	0644	edit dl rm
inplace_merge.hpp	2578	0644	edit dl rm
lexicographical_compare.hpp	2105	0644	edit dl rm
lower_bound.hpp	4390	0644	edit dl rm
max_element.hpp	4405	0644	edit dl rm
merge.hpp	2208	0644	edit dl rm
min_element.hpp	4405	0644	edit dl rm
mismatch.hpp	7983	0644	edit dl rm
nth_element.hpp	2501	0644	edit dl rm
partial_sort.hpp	2586	0644	edit dl rm
partial_sort_copy.hpp	2899	0644	edit dl rm
partition.hpp	2445	0644	edit dl rm
permutation.hpp	3753	0644	edit dl rm
random_shuffle.hpp	3569	0644	edit dl rm
remove.hpp	2344	0644	edit dl rm
remove_copy.hpp	1448	0644	edit dl rm
remove_copy_if.hpp	1450	0644	edit dl rm
remove_if.hpp	2517	0644	edit dl rm
replace.hpp	1498	0644	edit dl rm
replace_copy.hpp	1259	0644	edit dl rm
replace_copy_if.hpp	1516	0644	edit dl rm
replace_if.hpp	1634	0644	edit dl rm
reverse.hpp	1450	0644	edit dl rm
reverse_copy.hpp	1246	0644	edit dl rm
rotate.hpp	1480	0644	edit dl rm
rotate_copy.hpp	1440	0644	edit dl rm
search.hpp	5425	0644	edit dl rm
search_n.hpp	13554	0644	edit dl rm
set_algorithm.hpp	8661	0644	edit dl rm
sort.hpp	2062	0644	edit dl rm
stable_partition.hpp	2711	0644	edit dl rm
stable_sort.hpp	2173	0644	edit dl rm
swap_ranges.hpp	4518	0644	edit dl rm
transform.hpp	3484	0644	edit dl rm
unique.hpp	3810	0644	edit dl rm
unique_copy.hpp	1694	0644	edit dl rm
upper_bound.hpp	4403	0644	edit dl rm

Edit: /usr/include/boost/range/algorithm/adjacent_find.hpp (4388B)

#include <boost/concept_check.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/concepts.hpp>
#include <boost/range/value_type.hpp>
#include <boost/range/detail/range_return.hpp>
#include <algorithm>

namespace boost
{
    namespace range
    {

/// \brief template function adjacent_find
///
/// range-based version of the adjacent_find std algorithm
///
/// \pre ForwardRange is a model of the ForwardRangeConcept
/// \pre BinaryPredicate is a model of the BinaryPredicateConcept
template< typename ForwardRange >
inline typename range_iterator<ForwardRange>::type
adjacent_find(ForwardRange & rng)
{
    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
    return std::adjacent_find(boost::begin(rng),boost::end(rng));
}

/// \overload
template< typename ForwardRange >
inline typename range_iterator<const ForwardRange>::type
adjacent_find(const ForwardRange& rng)
{
    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
    return std::adjacent_find(boost::begin(rng),boost::end(rng));
}

/// \overload
template< typename ForwardRange, typename BinaryPredicate >
inline typename range_iterator<ForwardRange>::type
adjacent_find(ForwardRange & rng, BinaryPredicate pred)
{
    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
    BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
        typename range_value<ForwardRange>::type,
        typename range_value<ForwardRange>::type>));
    return std::adjacent_find(boost::begin(rng),boost::end(rng),pred);
}

/// \overload
template< typename ForwardRange, typename BinaryPredicate >
inline typename range_iterator<const ForwardRange>::type
adjacent_find(const ForwardRange& rng, BinaryPredicate pred)
{
    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
    BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
        typename range_value<const ForwardRange>::type,
        typename range_value<const ForwardRange>::type>));
    return std::adjacent_find(boost::begin(rng),boost::end(rng),pred);
}

//  range_return overloads

/// \overload
template< range_return_value re, typename ForwardRange >
inline typename range_return<ForwardRange,re>::type
adjacent_find(ForwardRange & rng)
{
    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
    return range_return<ForwardRange,re>::
        pack(std::adjacent_find(boost::begin(rng),boost::end(rng)),
             rng);
}

/// \overload
template< range_return_value re, typename ForwardRange >
inline typename range_return<const ForwardRange,re>::type
adjacent_find(const ForwardRange& rng)
{
    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
    return range_return<const ForwardRange,re>::
        pack(std::adjacent_find(boost::begin(rng),boost::end(rng)),
             rng);
}

/// \overload
template< range_return_value re, typename ForwardRange, typename BinaryPredicate >
inline typename range_return<ForwardRange,re>::type
adjacent_find(ForwardRange& rng, BinaryPredicate pred)
{
    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
    BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
        typename range_value<ForwardRange>::type,
        typename range_value<ForwardRange>::type>));
    return range_return<ForwardRange,re>::
        pack(std::adjacent_find(boost::begin(rng),boost::end(rng),pred),
             rng);
}

/// \overload
template< range_return_value re, typename ForwardRange, typename BinaryPredicate >
inline typename range_return<const ForwardRange,re>::type
adjacent_find(const ForwardRange& rng, BinaryPredicate pred)
{
    BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept<ForwardRange>));
    return range_return<const ForwardRange,re>::
        pack(std::adjacent_find(boost::begin(rng),boost::end(rng),pred),
             rng);
}

} // namespace range
    using range::adjacent_find;
} // namespace boost

#endif // include guard

// Copyright Neil Groves 2009. 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) // // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_ALGORITHM_ADJACENT_FIND_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_ADJACENT_FIND_HPP_INCLUDED #include #include #include #include #include #include #include namespace boost { namespace range { /// \brief template function adjacent_find /// /// range-based version of the adjacent_find std algorithm /// /// \pre ForwardRange is a model of the ForwardRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template< typename ForwardRange > inline typename range_iterator::type adjacent_find(ForwardRange & rng) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); return std::adjacent_find(boost::begin(rng),boost::end(rng)); } /// \overload template< typename ForwardRange > inline typename range_iterator::type adjacent_find(const ForwardRange& rng) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); return std::adjacent_find(boost::begin(rng),boost::end(rng)); } /// \overload template< typename ForwardRange, typename BinaryPredicate > inline typename range_iterator::type adjacent_find(ForwardRange & rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept::type, typename range_value::type>)); return std::adjacent_find(boost::begin(rng),boost::end(rng),pred); } /// \overload template< typename ForwardRange, typename BinaryPredicate > inline typename range_iterator::type adjacent_find(const ForwardRange& rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept::type, typename range_value::type>)); return std::adjacent_find(boost::begin(rng),boost::end(rng),pred); } // range_return overloads /// \overload template< range_return_value re, typename ForwardRange > inline typename range_return::type adjacent_find(ForwardRange & rng) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); return range_return:: pack(std::adjacent_find(boost::begin(rng),boost::end(rng)), rng); } /// \overload template< range_return_value re, typename ForwardRange > inline typename range_return::type adjacent_find(const ForwardRange& rng) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); return range_return:: pack(std::adjacent_find(boost::begin(rng),boost::end(rng)), rng); } /// \overload template< range_return_value re, typename ForwardRange, typename BinaryPredicate > inline typename range_return::type adjacent_find(ForwardRange& rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept::type, typename range_value::type>)); return range_return:: pack(std::adjacent_find(boost::begin(rng),boost::end(rng),pred), rng); } /// \overload template< range_return_value re, typename ForwardRange, typename BinaryPredicate > inline typename range_return::type adjacent_find(const ForwardRange& rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); return range_return:: pack(std::adjacent_find(boost::begin(rng),boost::end(rng),pred), rng); } } // namespace range using range::adjacent_find; } // namespace boost #endif // include guard