discrimination-0.4: Fast generic linear-time sorting, joins and container construction.

Safe Haskell	Safe
Language	Haskell2010

Data.Discrimination.Internal

Synopsis

runs :: Eq a => [(a, b)] -> [[b]]
groupNum :: [[k]] -> [(k, Int)]
bdiscNat :: Int -> ([v] -> v -> [v]) -> [(Int, v)] -> [[v]]
updateBag :: [Int] -> Int -> [Int]
updateSet :: [Int] -> Int -> [Int]
spanEither :: ([a] -> [b] -> c) -> [Either a b] -> c

Documentation

runs :: Eq a => [(a, b)] -> [[b]] Source #

groupNum :: [[k]] -> [(k, Int)] Source #

bdiscNat :: Int -> ([v] -> v -> [v]) -> [(Int, v)] -> [[v]] Source #

updateBag :: [Int] -> Int -> [Int] Source #

updateSet :: [Int] -> Int -> [Int] Source #

spanEither :: ([a] -> [b] -> c) -> [Either a b] -> c Source #

Optimized and CPS'd version of partitionEithers, where all lefts are known to come before all rights