Program Listing for File ExternalSorting.h
↰ Return to documentation for file (ADS/external/ExternalSorting.h)
/*--------------------------------------------------------------------------*/
/*------------------------ File ExternalSorting.h --------------------------*/
/*--------------------------------------------------------------------------*/
/*--------------------------------------------------------------------------*/
/*----------------------------- DEFINITIONS --------------------------------*/
/*--------------------------------------------------------------------------*/
#ifndef __ADS_ExternalSorting
#define __ADS_ExternalSorting
/* self-identification: #endif constant */
/*--------------------------------------------------------------------------*/
/*------------------------------ INCLUDES ----------------------------------*/
/*--------------------------------------------------------------------------*/
#include "ADS/Contract.h"
#include "ADS/external/TwoLevelMemory.h"
#include "ADS/numeric/RandomNumbers.h"
#include "ADS/priority/DaryHeap.h"
#include "ADS/priority/LoserTree.h"
#include "ADS/search/BinarySearch.h"
#include "ADS/sort/ExternalSort.h"
#include "ADS/sort/Sort.h"
#include "ADS/sort/Sorted.h"
#include <algorithm>
#include <cmath>
#include <cstddef>
#include <cstdint>
#include <functional>
#include <memory>
#include <optional>
#include <utility>
#include <vector>
/*--------------------------------------------------------------------------*/
/*--------------------------- NAMESPACE ------------------------------------*/
/*--------------------------------------------------------------------------*/
namespace ADS {
[[nodiscard]] inline std::uint64_t mergeSortIOs( std::size_t n ,
std::size_t M ,
std::size_t B ,
std::size_t k );
[[nodiscard]] inline std::uint64_t sortingLowerBound( std::size_t n ,
std::size_t M ,
std::size_t B );
[[nodiscard]] inline std::uint64_t permutingLowerBound( std::size_t n ,
std::size_t M ,
std::size_t B );
template< class T , class C = std::less<> >
void binaryMergeSort( const DiskFile< T > & in , DiskFile< T > & out ,
C less = C() );
template< class T , class C = std::less<> , class Sel = LoserTree< T , C > >
void multiwayMergeSort( const DiskFile< T > & in , DiskFile< T > & out ,
C less = C() , bool snowPlow = false );
template< class T , class R , class C = std::less<> >
void distributionSort( const DiskFile< T > & in , DiskFile< T > & out ,
R & g , C less = C() );
template< class T >
void permuteBySorting( const DiskFile< T > & in ,
const DiskFile< std::size_t > & pi ,
DiskFile< T > & out );
template< class T >
void permuteDirect( const DiskFile< T > & in ,
const DiskFile< std::size_t > & pi ,
DiskFile< T > & out );
/*--------------------------------------------------------------------------*/
} // end( namespace ADS )
/*--------------------------------------------------------------------------*/
/*-------------------------- IMPLEMENTATION --------------------------------*/
/*--------------------------------------------------------------------------*/
#include "ADS/external/impl/ExternalSorting.tpp"
/*--------------------------------------------------------------------------*/
#endif /* ExternalSorting.h included */
/*--------------------------------------------------------------------------*/
/*----------------------- End File ExternalSorting.h -----------------------*/
/*--------------------------------------------------------------------------*/