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. tensortB4 :: Ord a => [Bit a] -> [Bit a]

    tensort Data.Tensort.Tensort

    Sort a list using a Standard Tensort algorithm with a 4-Bit Bytesize

    Examples

    >>> tensortB4 ([16, 23, 4, 8, 15, 42] :: [Int])
    [4,8,15,16,23,42]
    
    >>> tensortB4 ([(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)]
    

  2. tensortBL :: Ord a => [Bit a] -> [Bit a]

    tensort Data.Tensort.Tensort

    Sort a list using a Standard Logarithmic Tensort algorithm Standard Logarithmic Tensort uses a Bytesize that approximates the natural logarithm of the length of the input list and a Bubblesort subalgorithm

    Examples

    >>> tensortBL ([16, 23, 4, 8, 15, 42] :: [Int])
    [4,8,15,16,23,42]
    
    >>> tensortBL ([(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)]
    

  3. tensortBN :: Ord a => Int -> [Bit a] -> [Bit a]

    tensort Data.Tensort.Tensort

    Sort a list using a Standard Tensort algorithm with a custom Bytesize

    Examples

    >>> tensortBN 3 ([16, 23, 4, 8, 15, 42] :: [Int])
    [4,8,15,16,23,42]
    
    >>> tensortBN 3 ([(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)]
    

  4. isSorted :: Ord a => [a] -> Bool

    tensort Data.Tensort.Utils.Check

    Takes a list and returns True if the list is sorted in ascending order and False otherwise.

    Examples

    >>> isSorted ([0, 1, 2, 3, 4] :: [Int])
    True
    
    >>> isSorted ([0, 1, 2, 4, 3] :: [Int])
    False
    

  5. type SupersortProps a = (SortAlg a, SortAlg a, SortAlg a, SupersortStrat a)

    tensort Data.Tensort.Utils.Types

    SupersortProps consist of three sorting algorithms to adjuditcate between and a SupersortStrat that does the adjudication.

  6. type SupersortStrat a = ([a], [a], [a]) -> [a]

    tensort Data.Tensort.Utils.Types

    A SupersortStrat takes three lists and determines which of the three is most likely to be in the correct order.

  7. data TensortProps a

    tensort Data.Tensort.Utils.Types

    TensortProps contains the Bytesize and SubAlgorithm used in a Tensort algorithm.

  8. TensortProps :: Int -> SortAlg a -> TensortProps a

    tensort Data.Tensort.Utils.Types

    No documentation available.

  9. printOptionsSorting :: PrintOptions -> !Maybe (Key -> Key -> Ordering)

    tomland Toml.Type.Printer

    How table keys should be sorted, if at all.

  10. data SuccessorTo n

    type-level-natural-number TypeLevel.NaturalNumber

    No documentation available.

Page 226 of many | Previous | Next