minmax.hpp

Go to the documentation of this file.

/*
    Copyright 2005-2007 Adobe Systems Incorporated
    Distributed under the MIT License (see accompanying file LICENSE_1_0_0.txt
    or a copy at http://stlab.adobe.com/licenses.html)
*/

/*************************************************************************************************/

#ifndef ADOBE_ALGORITHM_MINMAX_HPP
#define ADOBE_ALGORITHM_MINMAX_HPP

#include <adobe/config.hpp>

#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/bind.hpp>

#include <algorithm>

/*************************************************************************************************/

namespace adobe {

/*************************************************************************************************/
/*************************************************************************************************/

template <class T>
inline const T& (min)(const T& a, const T& b)
{ return a < b ? a : b; }

template <class T>
inline T& (min)(T& a, T& b)
{ return a < b ? a : b; }

template <class T>
inline const T& (max)(const T& a, const T& b)
{ return b < a ? a : b; }

template <class T>
inline T& (max)(T& a, T& b)
{ return b < a ? a : b; }

template <class T, class Compare>
inline const T& (min)(const T& a, const T& b, Compare comp)
{
    return (std::min)(a, b, boost::bind(comp, _1, _2));
}

template <class T, class Compare>
inline T& (min)(T& a, T& b, Compare comp)
{
    return (std::min)(a, b, boost::bind(comp, _1, _2));
}

template <class T, class Compare>
inline const T& (max)(const T& a, const T& b, Compare comp)
{
    return boost::bind(comp, _1, _2)(b, a) ? a : b;
}

template <class T, class Compare>
inline T& (max)(T& a, T& b, Compare comp)
{
    return boost::bind(comp, _1, _2)(b, a) ? a : b;
}

template <class ForwardRange>
inline typename boost::range_iterator<ForwardRange>::type min_element(ForwardRange& range)
{
    return std::min_element(boost::begin(range), boost::end(range));
}

template <class ForwardRange>
inline typename boost::range_const_iterator<ForwardRange>::type
min_element(const ForwardRange& range)
{
    return std::min_element(boost::begin(range), boost::end(range));
}

template <class ForwardIterator, class Compare>
inline ForwardIterator min_element(ForwardIterator first, ForwardIterator last, Compare comp)
{
    return std::min_element(first, last, boost::bind(comp, _1, _2));
}

template <class ForwardRange, class Compare>
inline typename boost::range_iterator<ForwardRange>::type
min_element(ForwardRange& range, Compare comp)
{
    return adobe::min_element(boost::begin(range), boost::end(range), comp);
}

template <class ForwardRange, class Compare>
inline typename boost::range_const_iterator<ForwardRange>::type
min_element(const ForwardRange& range, Compare comp)
{
    return adobe::min_element(boost::begin(range), boost::end(range), comp);
}

template <class ForwardRange>
inline typename boost::range_iterator<ForwardRange>::type max_element(ForwardRange& range)
{
    return std::max_element(boost::begin(range), boost::end(range));
}

template <class ForwardRange>
inline typename boost::range_const_iterator<ForwardRange>::type
max_element(const ForwardRange& range)
{
    return std::max_element(boost::begin(range), boost::end(range));
}

template <class ForwardIterator, class Compare>
inline ForwardIterator max_element(ForwardIterator first, ForwardIterator last, Compare comp)
{
    return std::max_element(first, last, boost::bind(comp, _1, _2));
}

template <class ForwardRange, class Compare>
inline typename boost::range_iterator<ForwardRange>::type
max_element(ForwardRange& range, Compare comp)
{
    return adobe::max_element(boost::begin(range), boost::end(range), comp);
}

template <class ForwardRange, class Compare>
inline typename boost::range_const_iterator<ForwardRange>::type
max_element(const ForwardRange& range, Compare comp)
{
    return adobe::max_element(boost::begin(range), boost::end(range), comp);
}

/*************************************************************************************************/

} // namespace adobe

/*************************************************************************************************/

#endif

/*************************************************************************************************/