Copyright	(c) Andrey Mulik 2019
License	BSD-style
Maintainer	work.a.mulik@gmail.com
Portability	non-portable (requires non-portable modules)
Safe Haskell	Safe
Language	Haskell2010

SDP.SortM.Tim

Contents

TimSort

Description

SDP.SortM.Tim provides InsertionSort and TimSort algorithms.

Synopsis

timSort :: (LinearM m v e, BorderedM m v i, Ord e) => v -> m ()
timSortBy :: (LinearM m v e, BorderedM m v i) => Compare e -> v -> m ()
timSortOn :: (LinearM m v e, BorderedM m v i, Ord o) => (e -> o) -> v -> m ()
minrunTS :: Int -> Int

TimSort

timSort :: (LinearM m v e, BorderedM m v i, Ord e) => v -> m () Source #

timSort is just synonym for timSortBy compare.

timSortBy :: (LinearM m v e, BorderedM m v i) => Compare e -> v -> m () Source #

timSortBy is a sorting procedure for mutable random access data structures using any comparison function and having O(nlogn) complexity in the worst case.

timSortOn :: (LinearM m v e, BorderedM m v i, Ord o) => (e -> o) -> v -> m () Source #

timSortOn is a version of timSortBy that uses a conversion function to compare elements.

minrunTS :: Int -> Int Source #

minrunTS returns TimSort chunk size by given length.