Standard C++ Library Reference ISO/IEC (VERSION3)

OutIt set_symmetric_difference(InIt1 first1,
InIt1 last1, InIt2 first2, InIt2 last2, OutIt dest,
Pr pred);
template<class RanIt>
void push_heap(RanIt first, RanIt last);
template<class RanIt, class Pr>
void push_heap(RanIt first, RanIt last, Pr pred);
template<class RanIt>
void pop_heap(RanIt first, RanIt last);
template<class RanIt, class Pr>
void pop_heap(RanIt first, RanIt last, Pr pred);
template<class RanIt>
void make_heap(RanIt first, RanIt last);
template<class RanIt, class Pr>
void make_heap(RanIt first, RanIt last, Pr pred);
template<class RanIt>
void sort_heap(RanIt first, RanIt last);
template<class RanIt, class Pr>
void sort_heap(RanIt first, RanIt last, Pr pred);
template<class Ty>
const Ty& max(const Ty& left, const Ty& right);
template<class Ty, class Pr>
const Ty& max(const Ty& left, const Ty& right, Pr pred);
template<class Ty>
const Ty& min(const Ty& left, const Ty& right);
template<class Ty, class Pr>
const Ty& min(const Ty& left, const Ty& right, Pr pred);
template<class FwdIt>
FwdIt max_element(FwdIt first, FwdIt last);
template<class FwdIt, class Pr>
FwdIt max_element(FwdIt first, FwdIt last, Pr pred);
template<class FwdIt>
FwdIt min_element(FwdIt first, FwdIt last);
template<class FwdIt, class Pr>
FwdIt min_element(FwdIt first, FwdIt last, Pr pred);
template<class InIt1, class InIt2>
bool lexicographical_compare(InIt1 first1,
InIt1 last1, InIt2 first2, InIt2 last2);
template<class InIt1, class InIt2, class Pr>
bool lexicographical_compare(InIt1 first1,
InIt1 last1, InIt2 first2, InIt2 last2, Pr pred);
template<class BidIt>
bool next_permutation(BidIt first, BidIt last);