45                                 ForwardIterator2 first2, ForwardIterator2 last2,  in is_permutation_inner()  argument
54                     std::size_t dest_count = std::count_if ( first2, last2, pred );  in is_permutation_inner()
65                           ForwardIterator2 first2, ForwardIterator2 last2,   in is_permutation_tag()  argument
70         while ( first1 != last1 && first2 != last2 && p ( *first1, *first2 )) {  in is_permutation_tag()
72             ++first2;  in is_permutation_tag()
74         if ( first1 != last1 && first2 != last2 )  in is_permutation_tag()
75             return boost::algorithm::detail::is_permutation_inner ( first1, last1, first2, last2,  in is_permutation_tag()
77         return first1 == last1 && first2 == last2;  in is_permutation_tag()
82                           RandomAccessIterator2 first2, RandomAccessIterator2 last2,   in is_permutation_tag()  argument
86         if ( std::distance ( first1, last1 ) != std::distance ( first2, last2 ))  in is_permutation_tag()
89         while ( first1 != last1 && first2 != last2 && p ( *first1, *first2 )) {  in is_permutation_tag()
91             ++first2;  in is_permutation_tag()
94         if ( first1 != last1 && first2 != last2 )  in is_permutation_tag()
95             return is_permutation_inner (first1, last1, first2, last2, p);  in is_permutation_tag()
96         return first1 == last1 && first2 == last2;  in is_permutation_tag()
113                       ForwardIterator2 first2, BinaryPredicate p )  in is_permutation()  argument
116     std::pair<ForwardIterator1, ForwardIterator2> eq = std::mismatch (first1, last1, first2, p);  in is_permutation()
118     first2 = eq.second;  in is_permutation()
121         ForwardIterator2 last2 = first2;  in is_permutation()
123         return boost::algorithm::detail::is_permutation_inner ( first1, last1, first2, last2, p );  in is_permutation()
137 bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2 )  in is_permutation()  argument
142     std::pair<ForwardIterator1, ForwardIterator2> eq = std::mismatch (first1, last1, first2 );  in is_permutation()
144     first2 = eq.second;  in is_permutation()
147         ForwardIterator2 last2 = first2;  in is_permutation()
149         return boost::algorithm::detail::is_permutation_inner ( first1, last1, first2, last2,  in is_permutation()
162 bool is_permutation ( const Range &r, ForwardIterator first2 )  in is_permutation()  argument
164     return boost::algorithm::is_permutation (boost::begin (r), boost::end (r), first2 );  in is_permutation()
178 is_permutation ( const Range &r, ForwardIterator first2, BinaryPredicate pred )  in is_permutation()  argument
180     return boost::algorithm::is_permutation (boost::begin (r), boost::end (r), first2, pred );  in is_permutation()