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/swap_ranges.hpp (4518B)

//  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_SWAP_RANGES_HPP_INCLUDED
#define BOOST_RANGE_ALGORITHM_SWAP_RANGES_HPP_INCLUDED

#include <boost/assert.hpp>
#include <boost/concept_check.hpp>
#include <boost/iterator/iterator_categories.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/concepts.hpp>
#include <boost/range/iterator.hpp>
#include <algorithm>

namespace boost
{
    namespace range_detail
    {
        template<class Iterator1, class Iterator2>
        void swap_ranges_impl(Iterator1 it1, Iterator1 last1,
                              Iterator2 it2, Iterator2 last2,
                              single_pass_traversal_tag,
                              single_pass_traversal_tag)
        {
            ignore_unused_variable_warning(last2);
            for (; it1 != last1; ++it1, ++it2)
            {
                BOOST_ASSERT( it2 != last2 );
                std::iter_swap(it1, it2);
            }
        }

template<class Iterator1, class Iterator2>
        void swap_ranges_impl(Iterator1 it1, Iterator1 last1,
                              Iterator2 it2, Iterator2 last2,
                              random_access_traversal_tag,
                              random_access_traversal_tag)
        {
            ignore_unused_variable_warning(last2);
            BOOST_ASSERT( last2 - it2 >= last1 - it1 );
            std::swap_ranges(it1, last1, it2);
        }

template<class Iterator1, class Iterator2>
        void swap_ranges_impl(Iterator1 first1, Iterator1 last1,
                              Iterator2 first2, Iterator2 last2)
        {
            swap_ranges_impl(first1, last1, first2, last2,
                BOOST_DEDUCED_TYPENAME iterator_traversal<Iterator1>::type(),
                BOOST_DEDUCED_TYPENAME iterator_traversal<Iterator2>::type());
        }
    } // namespace range_detail

namespace range
    {

/// \brief template function swap_ranges
///
/// range-based version of the swap_ranges std algorithm
///
/// \pre SinglePassRange1 is a model of the SinglePassRangeConcept
/// \pre SinglePassRange2 is a model of the SinglePassRangeConcept
template< class SinglePassRange1, class SinglePassRange2 >
inline SinglePassRange2&
swap_ranges(SinglePassRange1& range1, SinglePassRange2& range2)
{
    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange1>));
    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange2>));

boost::range_detail::swap_ranges_impl(
        boost::begin(range1), boost::end(range1),
        boost::begin(range2), boost::end(range2));

return range2;
}

/// \overload
template< class SinglePassRange1, class SinglePassRange2 >
inline SinglePassRange2&
swap_ranges(const SinglePassRange1& range1, SinglePassRange2& range2)
{
    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange1>));
    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange2>));

boost::range_detail::swap_ranges_impl(
        boost::begin(range1), boost::end(range1),
        boost::begin(range2), boost::end(range2));

return range2;
}

/// \overload
template< class SinglePassRange1, class SinglePassRange2 >
inline const SinglePassRange2&
swap_ranges(SinglePassRange1& range1, const SinglePassRange2& range2)
{
    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange1>));
    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange2>));

boost::range_detail::swap_ranges_impl(
        boost::begin(range1), boost::end(range1),
        boost::begin(range2), boost::end(range2));

return range2;
}

/// \overload
template< class SinglePassRange1, class SinglePassRange2 >
inline const SinglePassRange2&
swap_ranges(const SinglePassRange1& range1, const SinglePassRange2& range2)
{
    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange1>));
    BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange2>));

boost::range_detail::swap_ranges_impl(
        boost::begin(range1), boost::end(range1),
        boost::begin(range2), boost::end(range2));

return range2;
}

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

#endif // include guard

cmd: