mirror of
https://github.com/boostorg/algorithm.git
synced 2025-07-29 12:07:18 +02:00
Cleanup html, dates, grammar, synopsis code. --Herve'
[SVN r23339]
This commit is contained in:
@ -11,28 +11,32 @@
|
||||
|
||||
<center>
|
||||
<h1>
|
||||
Minmax_element</h1></center>
|
||||
Minmax_element complete synopsis</h1></center>
|
||||
|
||||
<h3>
|
||||
Synopsis of <tt>&boost/algorithm/minmax.hpp></tt></h3>
|
||||
Synopsis of <tt><boost/algorithm/minmax.hpp></tt></h3>
|
||||
|
||||
<pre>namespace boost {
|
||||
<pre>#include <boost/tuple/tuple.hpp>
|
||||
|
||||
#include <boost/tuple/tuple.hpp>
|
||||
namespace boost {
|
||||
|
||||
template <class T>
|
||||
std::tuple<T const&, T const&> >
|
||||
tuple<T const&, T const&> >
|
||||
minmax(const T& a, const T& b);
|
||||
|
||||
template <class T, class <a href="http://www.sgi.com/tech/stl/ BinaryPredicate.html">BinaryPredicate</a>>
|
||||
std::tuple<T const&, T const&> >
|
||||
tuple<T const&, T const&> >
|
||||
minmax(const T& a, const T& b, BinaryPredicate comp);
|
||||
|
||||
}
|
||||
</pre>
|
||||
|
||||
<h3>
|
||||
Synopsis of <tt>&boost/algorithm/minmax_element.hpp></tt></h3>
|
||||
Synopsis of <tt><boost/algorithm/minmax_element.hpp></tt></h3>
|
||||
|
||||
<pre>namespace boost {
|
||||
<pre>#include <utility> //for std::pair
|
||||
|
||||
namespace boost {
|
||||
|
||||
template <class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
|
||||
std::pair<ForwardIterator,ForwardIterator>
|
||||
|
Reference in New Issue
Block a user