Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. robustsortB :: Ord a => [a] -> [a]

    tensort Data.Robustsort

    Takes a list of Bits and returns a sorted list of Bits using a Basic Mundane Robustsort algorithm with a Bogosort adjudicator This is a convenience function that wraps the robustsortB function

    Examples

    >>> robustsortB ([16, 23, 4, 8, 15, 42] :: [Int])
    [4,8,15,16,23,42]
    

  2. robustsortM :: Ord a => [a] -> [a]

    tensort Data.Robustsort

    Takes a list of Bits and returns a sorted list of Bits using a Basic Magic Robustsort algorithm This is a convenience function that wraps the robustsortM function

    Examples

    >>> robustsortM ([16, 23, 4, 8, 15, 42] :: [Int])
    [4,8,15,16,23,42]
    

  3. robustsortP :: Ord a => [a] -> [a]

    tensort Data.Robustsort

    Takes a list of Bits and returns a sorted list of Bits using a Basic Mundane Robustsort algorithm with a Permutationsort adjudicator This is a convenience function that wraps the robustsortP function

    Examples

    >>> robustsortP ([16, 23, 4, 8, 15, 42] :: [Int])
    [4,8,15,16,23,42]
    

  4. robustsortRB :: Ord a => [a] -> [a]

    tensort Data.Robustsort

    Takes a list of Bits and returns a sorted list of Bits using a Recursive Mundane Robustsort algorithm with a Bogosort adjudicator This is a convenience function that wraps the robustsortRB function

  5. robustsortRM :: Ord a => [a] -> [a]

    tensort Data.Robustsort

    Takes a list of Bits and returns a sorted list of Bits using a Recursive Magic Robustsort algorithm This is a convenience function that wraps the robustsortRM function

  6. robustsortRP :: Ord a => [a] -> [a]

    tensort Data.Robustsort

    Takes a list of Bits and returns a sorted list of Bits using a Recursive Mundane Robustsort algorithm with a Permutationsort adjudicator This is a convenience function that wraps the robustsortRP function

    Examples

    >>> robustsortRP ([16, 23, 4, 8, 15, 42] :: [Int])
    [4,8,15,16,23,42]
    

  7. module Data.Tensort

    This module provides common Tensort functions defined without reference to Bits

  8. tensort :: Ord a => [a] -> [a]

    tensort Data.Tensort

    Takes a list of Bits and returns a sorted list of Bits using a Standard Logarithmic Tensort algorithm This is a convenience function that wraps the tensortBL function

    Examples

    >>> tensort ([16, 23, 4, 8, 15, 42] :: [Int])
    [4,8,15,16,23,42]
    

  9. module Data.Tensort.OtherSorts.Mergesort

    This module provides an implementation of the mergesort algorithm.

  10. mergesort :: Ord a => [a] -> [a]

    tensort Data.Tensort.OtherSorts.Mergesort

    Takes a list and returns a sorted list using a Mergesort algorithm.

    Examples

    >>> mergesort ([16, 23, 4, 8, 15, 42] :: [Int])
    [4,8,15,16,23,42]
    
    >>> mergesort ([(1, 16), (5, 23), (2, 4) ,(3, 8), (0, 15) , (4, 42)] :: [(Int, Int)])
    [(0,15),(1,16),(2,4),(3,8),(4,42),(5,23)]
    

Page 222 of many | Previous | Next