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/random_shuffle.hpp (3569B)

#include <boost/concept_check.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/concepts.hpp>
#include <algorithm>
#ifdef BOOST_NO_CXX98_RANDOM_SHUFFLE
#include <cstdlib>
#endif

namespace boost
{
    namespace range
    {

namespace detail
        {
#ifdef BOOST_NO_CXX98_RANDOM_SHUFFLE

// wrap std::rand as UniformRandomBitGenerator
struct wrap_rand
{
    typedef unsigned int result_type;

static BOOST_CONSTEXPR result_type (min)()
    {
        return 0;
    }

static BOOST_CONSTEXPR result_type (max)()
    {
        return RAND_MAX;
    }

result_type operator()()
    {
        return std::rand();
    }
};

template< class RandomIt >
inline void random_shuffle(RandomIt first, RandomIt last)
{
    std::shuffle(first, last, wrap_rand());
}

// wrap Generator as UniformRandomBitGenerator
template< class Generator >
struct wrap_generator
{
    typedef unsigned int result_type;
    static const int max_arg = ((0u - 1u) >> 2) + 1;
    Generator& g;

wrap_generator(Generator& gen) : g(gen) {}

static BOOST_CONSTEXPR result_type (min)()
    {
        return 0;
    }

static BOOST_CONSTEXPR result_type (max)()
    {
        return max_arg - 1;
    }

result_type operator()()
    {
        return static_cast<result_type>(g(max_arg));
    }
};

template< class RandomIt, class Generator >
inline void random_shuffle(RandomIt first, RandomIt last, Generator& gen)
{
    std::shuffle(first, last, wrap_generator< Generator >(gen));
}

#else
    
using std::random_shuffle;

#endif  
        } // namespace detail

/// \brief template function random_shuffle
///
/// range-based version of the random_shuffle std algorithm
///
/// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
/// \pre Generator is a model of the UnaryFunctionConcept
template<class RandomAccessRange>
inline RandomAccessRange& random_shuffle(RandomAccessRange& rng)
{
    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
    detail::random_shuffle(boost::begin(rng), boost::end(rng));
    return rng;
}

/// \overload
template<class RandomAccessRange>
inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng)
{
    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
    detail::random_shuffle(boost::begin(rng), boost::end(rng));
    return rng;
}

/// \overload
template<class RandomAccessRange, class Generator>
inline RandomAccessRange& random_shuffle(RandomAccessRange& rng, Generator& gen)
{
    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
    detail::random_shuffle(boost::begin(rng), boost::end(rng), gen);
    return rng;
}

/// \overload
template<class RandomAccessRange, class Generator>
inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng, Generator& gen)
{
    BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
    detail::random_shuffle(boost::begin(rng), boost::end(rng), gen);
    return rng;
}

} // namespace range
    using range::random_shuffle;
} // 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_RANDOM_SHUFFLE_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_RANDOM_SHUFFLE_HPP_INCLUDED #include #include #include #include #include #ifdef BOOST_NO_CXX98_RANDOM_SHUFFLE #include #endif namespace boost { namespace range { namespace detail { #ifdef BOOST_NO_CXX98_RANDOM_SHUFFLE // wrap std::rand as UniformRandomBitGenerator struct wrap_rand { typedef unsigned int result_type; static BOOST_CONSTEXPR result_type (min)() { return 0; } static BOOST_CONSTEXPR result_type (max)() { return RAND_MAX; } result_type operator()() { return std::rand(); } }; template< class RandomIt > inline void random_shuffle(RandomIt first, RandomIt last) { std::shuffle(first, last, wrap_rand()); } // wrap Generator as UniformRandomBitGenerator template< class Generator > struct wrap_generator { typedef unsigned int result_type; static const int max_arg = ((0u - 1u) >> 2) + 1; Generator& g; wrap_generator(Generator& gen) : g(gen) {} static BOOST_CONSTEXPR result_type (min)() { return 0; } static BOOST_CONSTEXPR result_type (max)() { return max_arg - 1; } result_type operator()() { return static_cast(g(max_arg)); } }; template< class RandomIt, class Generator > inline void random_shuffle(RandomIt first, RandomIt last, Generator& gen) { std::shuffle(first, last, wrap_generator< Generator >(gen)); } #else using std::random_shuffle; #endif } // namespace detail /// \brief template function random_shuffle /// /// range-based version of the random_shuffle std algorithm /// /// \pre RandomAccessRange is a model of the RandomAccessRangeConcept /// \pre Generator is a model of the UnaryFunctionConcept template inline RandomAccessRange& random_shuffle(RandomAccessRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept )); detail::random_shuffle(boost::begin(rng), boost::end(rng)); return rng; } /// \overload template inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept )); detail::random_shuffle(boost::begin(rng), boost::end(rng)); return rng; } /// \overload template inline RandomAccessRange& random_shuffle(RandomAccessRange& rng, Generator& gen) { BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept )); detail::random_shuffle(boost::begin(rng), boost::end(rng), gen); return rng; } /// \overload template inline const RandomAccessRange& random_shuffle(const RandomAccessRange& rng, Generator& gen) { BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept )); detail::random_shuffle(boost::begin(rng), boost::end(rng), gen); return rng; } } // namespace range using range::random_shuffle; } // namespace boost #endif // include guard