sl@0: //  (C) Copyright Herve Bronnimann 2004.
sl@0: //  Use, modification and distribution are subject to the
sl@0: //  Boost Software License, Version 1.0. (See accompanying file
sl@0: //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
sl@0: 
sl@0: /*
sl@0:  Revision history:
sl@0:    1 July 2004
sl@0:       Split the code into two headers to lessen dependence on
sl@0:       Boost.tuple. (Herve)
sl@0:    26 June 2004
sl@0:       Added the code for the boost minmax library. (Herve)
sl@0: */
sl@0: 
sl@0: #ifndef BOOST_ALGORITHM_MINMAX_HPP
sl@0: #define BOOST_ALGORITHM_MINMAX_HPP
sl@0: 
sl@0: /* PROPOSED STANDARD EXTENSIONS:
sl@0:  *
sl@0:  * minmax(a, b)
sl@0:  * Effect: (b<a) ? std::make_pair(b,a) : std::make_pair(a,b);
sl@0:  *
sl@0:  * minmax(a, b, comp)
sl@0:  * Effect: comp(b,a) ? std::make_pair(b,a) : std::make_pair(a,b);
sl@0:  *
sl@0:  */
sl@0: 
sl@0: #include <boost/tuple/tuple.hpp> // for using pairs with boost::cref
sl@0: #include <boost/ref.hpp>
sl@0: 
sl@0: namespace boost {
sl@0: 
sl@0:   template <typename T>
sl@0:   tuple< T const&, T const& >
sl@0:   minmax(T const& a, T const& b) {
sl@0:     return (b<a) ? make_tuple(cref(b),cref(a)) : make_tuple(cref(a),cref(b));
sl@0:   }
sl@0: 
sl@0:   template <typename T, class BinaryPredicate>
sl@0:   tuple< T const&, T const& >
sl@0:   minmax(T const& a, T const& b, BinaryPredicate comp) {
sl@0:     return comp(b,a) ? make_tuple(cref(b),cref(a)) : make_tuple(cref(a),cref(b));
sl@0:   }
sl@0: 
sl@0: } // namespace boost
sl@0: 
sl@0: #endif // BOOST_ALGORITHM_MINMAX_HPP