select.hpp

Go to the documentation of this file.

/*
    Copyright 2005-2008 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_SELECT_HPP
#define ADOBE_ALGORITHM_SELECT_HPP

#include <adobe/algorithm/minmax.hpp>

namespace adobe {

/**************************************************************************************************/
/**************************************************************************************************/
template <typename T, typename R>
inline const T& select_1_ac(const T& a, const T& b, const T& c, R r)
{
    assert(!r(c, a) && "WARNING (sparent) : a and c must be non-decreasing");
    return r(b, a) ? a : (adobe::min)(b, c, r);
}

template <typename T, typename R>
inline T& select_1_ac(T& a, T& b, T& c, R r)
{
    assert(!r(c, a) && "WARNING (sparent) : a and c must be non-decreasing");
    return r(b, a) ? a : (adobe::min)(b, c, r);
}

template <typename T, typename R>
inline const T& select_1_ab(const T& a, const T& b, const T& c, R r)
{
    assert(!r(b, a) && "WARNING (sparent) : a and b must be non-decreasing");
    return r(c, b) ? (adobe::max)(a, c, r) : b;
}

template <typename T, typename R>
inline T& select_1_ab(T& a, T& b, T& c, R r)
{
    assert(!r(b, a) && "WARNING (sparent) : a and b must be non-decreasing");
    return r(c, b) ? (adobe::max)(a, c, r) : b;
}

template <typename T, typename R>
inline const T& select_1(const T& a, const T& b, const T& c, R r)
{ return r(b, a) ? select_1_ab(b, a, c, r) : select_1_ab(a, b, c, r); }

template <typename T, typename R>
inline T& select_1(T& a, T& b, T& c, R r)
{ return r(b, a) ? select_1_ab(b, a, c, r) : select_1_ab(a, b, c, r); }

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

} // namespace adobe

#endif