mirror of
https://github.com/boostorg/algorithm.git
synced 2025-07-29 03:57:17 +02:00
Documentation for the minmax library.
Moved from libs/minmax/ to libs/algorithm/minmax Also changed documentation to reflect use of Boost.tuple and separation into two header files. --Herve' [SVN r23308]
This commit is contained in:
31
minmax/example/minmax_ex.cpp
Normal file
31
minmax/example/minmax_ex.cpp
Normal file
@ -0,0 +1,31 @@
|
||||
#include <list>
|
||||
#include <algorithm>
|
||||
#include <cstdlib>
|
||||
#include <cassert>
|
||||
#include <iostream>
|
||||
|
||||
#include <boost/algorithm/minmax.hpp>
|
||||
#include <boost/algorithm/minmax_element.hpp>
|
||||
|
||||
int main()
|
||||
{
|
||||
using namespace std;
|
||||
|
||||
// Demonstrating minmax()
|
||||
boost::tuple<int const&, int const&> result1 = boost::minmax(1, 0);
|
||||
assert( result1.get<0>() == 0 );
|
||||
assert( result1.get<1>() == 1 );
|
||||
|
||||
|
||||
// Demonstrating minmax_element()
|
||||
list<int> L;
|
||||
typedef list<int>::const_iterator iterator;
|
||||
generate_n(front_inserter(L), 1000, rand);
|
||||
pair< iterator, iterator > result2 = boost::minmax_element(L.begin(), L.end());
|
||||
|
||||
cout << "The smallest element is " << *(result2.first) << endl;
|
||||
cout << "The largest element is " << *(result2.second) << endl;
|
||||
|
||||
assert( result2.first == std::min_element(L.begin(), L.end()) );
|
||||
assert( result2.second == std::max_element(L.begin(), L.end()) );
|
||||
}
|
Reference in New Issue
Block a user