FM / algorithm

/usr/include/boost/algorithm

Name	Size	Mode	Actions
cxx11/	-	0755	rm
cxx14/	-	0755	rm
cxx17/	-	0755	rm
searching/	-	0755	rm
string/	-	0755	rm
algorithm.hpp	2421	0644	edit dl rm
apply_permutation.hpp	4512	0644	edit dl rm
clamp.hpp	7917	0644	edit dl rm
find_backward.hpp	2523	0644	edit dl rm
find_not.hpp	986	0644	edit dl rm
gather.hpp	4164	0644	edit dl rm
hex.hpp	13122	0644	edit dl rm
is_palindrome.hpp	4279	0644	edit dl rm
is_partitioned_until.hpp	2576	0644	edit dl rm
minmax.hpp	1281	0644	edit dl rm
minmax_element.hpp	17488	0644	edit dl rm
sort_subrange.hpp	3611	0644	edit dl rm
string.hpp	1061	0644	edit dl rm
string_regex.hpp	730	0644	edit dl rm

Edit: /usr/include/boost/algorithm/minmax.hpp (1281B)

//  (C) Copyright Herve Bronnimann 2004.
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

/*
 Revision history:
   1 July 2004
      Split the code into two headers to lessen dependence on
      Boost.tuple. (Herve)
   26 June 2004
      Added the code for the boost minmax library. (Herve)
*/

#ifndef BOOST_ALGORITHM_MINMAX_HPP
#define BOOST_ALGORITHM_MINMAX_HPP

/* PROPOSED STANDARD EXTENSIONS:
 *
 * minmax(a, b)
 * Effect: (b<a) ? std::make_pair(b,a) : std::make_pair(a,b);
 *
 * minmax(a, b, comp)
 * Effect: comp(b,a) ? std::make_pair(b,a) : std::make_pair(a,b);
 *
 */

#include <boost/config.hpp>
#include <boost/tuple/tuple.hpp> // for using pairs with boost::cref
#include <boost/ref.hpp>

namespace boost {

template <typename T>
  tuple< T const&, T const& >
  minmax(T const& a, T const& b) {
    return (b<a) ? make_tuple(cref(b),cref(a)) : make_tuple(cref(a),cref(b));
  }

template <typename T, class BinaryPredicate>
  tuple< T const&, T const& >
  minmax(T const& a, T const& b, BinaryPredicate comp) {
    return comp(b,a) ? make_tuple(cref(b),cref(a)) : make_tuple(cref(a),cref(b));
  }

} // namespace boost

#endif // BOOST_ALGORITHM_MINMAX_HPP

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