...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
boost::compute::is_permutation — Permutation checking algorithm.
// In header: <boost/compute/algorithm/is_permutation.hpp> template<typename InputIterator1, typename InputIterator2> bool is_permutation(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, command_queue & queue = system::default_queue());
Checks if the range [first1, last1) can be permuted into the range [first2, last2)
Space complexity: \Omega(distance(first1
, last1
) + distance(first2
, last2
))
Parameters: 


Returns: 
True, if it can be permuted. False, otherwise. 