-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Sort large arrays on your hard drive. Kind of like the unix util sort.
--   
--   Sort arrays too large to fit in ram, by using your hard drive.
@package external-sort
@version 0.2

module Algorithms.ExternalSort
blocksize :: Int
slice :: Int -> [a] -> [[a]]
blockify :: Ord a => Int -> [a] -> [[a]]
dumpBlock :: (Ord a, Binary a) => Handle -> [a] -> IO Integer
externalSort :: (Ord a, Binary a) => [a] -> IO [a]
kMerge :: Ord a => [[a]] -> [a]
kMergeSort :: Ord a => [a] -> [a]
hGetContentsWithCursor :: Handle -> Integer -> IO ByteString
hGetContentsWithCursorN :: Int -> Handle -> Integer -> IO ByteString
defaultChunkSize :: Int