permutation.hpp File Reference

#include <meta/meta.hpp>
#include <range/v3/range_fwd.hpp>
#include <range/v3/algorithm/mismatch.hpp>
#include <range/v3/algorithm/reverse.hpp>
#include <range/v3/functional/comparisons.hpp>
#include <range/v3/functional/identity.hpp>
#include <range/v3/functional/invoke.hpp>
#include <range/v3/iterator/concepts.hpp>
#include <range/v3/iterator/operations.hpp>
#include <range/v3/iterator/traits.hpp>
#include <range/v3/range/access.hpp>
#include <range/v3/range/concepts.hpp>
#include <range/v3/range/traits.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/utility/swap.hpp>
#include <range/v3/detail/prologue.hpp>
#include <range/v3/detail/epilogue.hpp>

Go to the source code of this file.

Functions
	ranges::template (typename I1, typename S1, typename I2, typename C=equal_to, typename P1=identity, typename P2=identity)(AND sentinel_for< S1
	function template mismatch More...
I1 AND forward_iterator< I2 > AND indirectly_comparable< I1, I2, C, P1, P2 >	ranges::RANGES_DEPRECATED ("Use the variant of ranges::is_permutation that takes an upper bound " "for both sequences") bool RANGES_FUNC(is_permutation)(I1 begin1

Variables
I1 AND forward_iterator< I2 > AND indirectly_comparable< I1, I2, C, P1, P2 > S1	ranges::end1
I1 AND forward_iterator< I2 > AND indirectly_comparable< I1, I2, C, P1, P2 > S1 I2	ranges::begin2
I1 AND forward_iterator< I2 > AND indirectly_comparable< I1, I2, C, P1, P2 > S1 I2 C P1	ranges::proj1 = P1{}