Saf/Algo/Sort/HeapSort.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_SORT_HEAPSORT_H
#define SAF_ALGO_SORT_HEAPSORT_H

#include "../../Type.h"
#include "../Struct/Heap.h"
#include "../Predicate.h"

namespace Saf
{
    namespace Algo
    {        
        namespace Sort
        {
            template <class FwdIter, class Pred>
            void HeapSort(FwdIter begin, FwdIter end, Pred pred)
            {
                Struct::Heap::MakeHeap(begin, end, pred);
                Struct::Heap::SortHeap(begin, end, pred);
            }

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

#endif