Saf/Algo/Selection/MinMax.h

Go to the documentation of this file.

/*
    This file is part of Simple Application Framework (Saf) library.
    Copyright (C) 2010 - 2012 Ondrej Danek <ondrej.danek@gmail.com>

    This library is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published 
    by the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    Saf is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with Simple Application Framework library. If not, 
    see <http://www.gnu.org/licenses/>.
*/

#ifndef SAF_ALGO_SELECTION_MINMAX_H
#define SAF_ALGO_SELECTION_MINMAX_H

#include "../../Collection/Pair.h"
#include "../Predicate.h"

namespace Saf
{
    namespace Algo
    {
        namespace Selection
        {
            template <class T> 
            inline T Max(const T& x, const T& y)
            {
                return x < y ? y : x;
            }

            template <class T, class Pred>
            inline T Max(const T& x, const T& y, Pred pred)
            {
                return pred(x, y) ? y : x;
            }

            template <class T> 
            inline T Max(const T& x, const T& y, const T& z)
            {
                return (x < y) ? Max(y, z) : Max(x, z);
            }

            template <class T, class Pred>
            inline T Max(const T& x, const T& y, const T& z, Pred pred)
            {
                return pred(x, y) ? Max(y, z, pred) : Max(x, z, pred);
            }

            template <class T> 
            inline T Min(const T& x, const T& y)
            {
                return x < y ? x : y;
            }

            template <class T, class Pred>
            inline T Min(const T& x, const T& y, Pred pred)
            {
                return pred(x, y) ? x : y;
            }

            template <class T> 
            inline T Min(const T& x, const T& y, const T& z)
            {
                return (x < y) ? Min(x, z) : Min(y, z);
            }

            template <class T, class Pred>
            inline T Min(const T& x, const T& y, const T& z, Pred pred)
            {
                return pred(x, y) ? Min(x, z, pred) : Min(y, z, pred);
            }

            template <class T, class Pred>
            inline Collection::Pair<T,T> MinMax(const T& x, const T& y, Pred pred)
            {
                Collection::Pair<T,T> mm;

                if (pred(x, y))
                {
                    mm.m_first = x;
                    mm.m_first = y;
                }
                else
                {
                    mm.m_first = y;
                    mm.m_first = x;
                }

                return mm;
            }

            template <class T>
            inline Collection::Pair<T,T> MinMax(const T& x, const T& y)
            {
                Predicate::Less<T> pred;
                return MinMax(x, y, pred);
            }

            template <class T, class Pred>
            inline Collection::Pair<T,T> MinMax(const T& x, const T& y, const T& z, Pred pred)
            {
                Collection::Pair<T,T> mm(x, x);

                if (pred(y, x))
                {
                    mm.m_first = y;
                }
                else
                {
                    mm.m_second = y;
                }

                if (pred(z, mm.m_first))
                {
                    mm.m_first = z;
                }
                else if (pred(mm.m_second, z))
                {
                    mm.m_second = z;
                }

                return mm;
            }

            template <class T>
            inline Collection::Pair<T,T> MinMax(const T& x, const T& y, const T& z)
            {
                Predicate::Less<T> pred;
                return MinMax(x, y, z, pred);
            }
        }
    }
}

#endif