COMBINATORIAL_BLAS  1.6
sort.h
Go to the documentation of this file.
1 // The Funnelsort Project - Cache oblivious sorting algorithm implementation
2 // Copyright (C) 2005 Kristoffer Vinther
3 //
4 // This program is free software; you can redistribute it and/or modify
5 // it under the terms of the GNU General Public License as published by
6 // the Free Software Foundation; either version 2 of the License, or
7 // (at your option) any later version.
8 //
9 // This program is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
13 //
14 // You should have received a copy of the GNU General Public License
15 // along with this program; if not, write to the Free Software
16 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
17 
18 #ifndef SORT_H_INCLUDED__
19 #define SORT_H_INCLUDED__
20 
21 namespace iosort
22 {
23 
24 template<class Merger, class Splitter, class It, class OutIt>
25 inline void merge_sort(It begin, It end, OutIt dest, const typename Merger::allocator& alloc/* = typename Merger::allocator()*/);
26 
27 template<class Merger, class Splitter, class It, class OutIt>
28 inline void merge_sort(It begin, It end, OutIt dest)
29 {
30  merge_sort<Merger, Splitter>(begin, end, dest, typename Merger::allocator());
31 }
32 
33 } // namespace iosort
34 
35 #include "sort.timpl.h"
36 #endif // SORT_H_INCLUDED__
Definition: funnel.h:29
void merge_sort(It begin, It end, OutIt dest, const typename Merger::allocator &alloc)
Definition: sort.timpl.h:356