Saf/Algo/Selection/Range/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_RANGE_MINMAX_H
#define SAF_ALGO_SELECTION_RANGE_MINMAX_H

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

namespace Saf
{
    namespace Algo
    {
        namespace Selection
        {
            namespace Range
            {
                template <class FwdIter, class Comp>
                inline FwdIter Min(FwdIter begin, FwdIter end, Comp comp)
                {
                    FwdIter vmin = begin;

                    if (begin != end)
                    {
                        while (++begin != end)
                        {
                            if (comp(*begin, *vmin))
                            {
                                vmin = begin;
                            }
                        }
                    }

                    return vmin;
                }

                template <class FwdIter>
                inline FwdIter Min(FwdIter begin, FwdIter end)
                {
                    Predicate::Less<typename Type::IteratorTraits<FwdIter>::ValType> pred;
                    return Min(begin, end, pred);
                }

                template <class FwdIter, class Comp>
                inline FwdIter Max(FwdIter begin, FwdIter end, Comp comp)
                {
                    FwdIter vmax = begin;

                    if (begin != end)
                    {
                        while (++begin != end)
                        {
                            if (comp(*vmax, *begin))
                            {
                                vmax = begin;
                            }
                        }
                    }

                    return vmax;
                }

                template <class FwdIter>
                inline FwdIter Max(FwdIter begin, FwdIter end)
                {
                    Predicate::Less<typename Type::IteratorTraits<FwdIter>::ValType> pred;
                    return Max(begin, end, pred);
                }

                template <class FwdIter, class Comp>
                inline Collection::Pair<FwdIter,FwdIter> MinMax(FwdIter begin, FwdIter end, Comp comp)
                {
                    Collection::Pair<FwdIter,FwdIter> mm(begin, begin);

                    if (begin != end)
                    {
                        while (++begin != end)
                        {
                            if (comp(*begin, *mm.m_first)
                            {
                                mm.m_first = begin;
                            }
                            else if (comp(*mm.m_second, *begin))
                            {
                                mm.m_second = begin;
                            }
                        }
                    }

                    return mm;
                }

                template <class FwdIter>
                inline Collection::Pair<FwdIter,FwdIter> MinMax(FwdIter begin, FwdIter end)
                {
                    Predicate::Less<typename Type::IteratorTraits<FwdIter>::ValType> pred;
                    return MinMax(begin, end, pred);
                }
            }
        }
    }
}

#endif