    hi(is_permutation)
    itemization(
        it() Header file: tt(<algorithm>)
        it() Function prototypes:
        itemization(
            itt(bool is_permutation(ForwardIterator first1,
                ForwardIterator last1, ForwardIterator first2);)
            itt(bool is_permutation(ForwardIterator first1,
                ForwardIterator last1, ForwardIterator first2,
                ForwardIterator last2);)
            itt(bool is_permutation(ForwardIterator first1,
                ForwardIterator last1, ForwardIterator firs2,
                BinaryPred pred);)
            itt(bool is_permutation(ForwardIterator first1,
                ForwardIterator last1, ForwardIterator first2,
                ForwardIterator last2, BinaryPred pred);)
        )
        it() Description:
        itemization(
            it() The first prototype: returns tt(true) if the elements in the
iterator range rangett(first1, last1), are a permutation of the elements in
the identically sized range starting at tt(first2).
            it() The second prototype: like the first prototype but the ending
iterator of the second range is provided as the fourth argument.
            it() The third prototype: like the first prototype but using the
result of tt(pred) to determine whether two elements are equal.
            it() The fourth prototype: like the second prototype but using the
result of tt(pred) to determine whether two elements are equal.
        )
        it() Example:
        verbinclude(-a examples/ispermutation.cc)
    )


