Safe Haskell	Safe

LSC.BinarySearch

Documentation

newtype Distinct a b Source #

Constructors

Distinct
Fields unDistinct :: (a, b)

Instances

Instances details

Functor (Distinct a) Source #
Instance details Defined in LSC.BinarySearch Methods fmap :: (a0 -> b) -> Distinct a a0 -> Distinct a b (<$) :: a0 -> Distinct a b -> Distinct a a0
Foldable (Distinct a) Source #
Instance details Defined in LSC.BinarySearch Methods fold :: Monoid m => Distinct a m -> m foldMap :: Monoid m => (a0 -> m) -> Distinct a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Distinct a a0 -> m foldr :: (a0 -> b -> b) -> b -> Distinct a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Distinct a a0 -> b foldl :: (b -> a0 -> b) -> b -> Distinct a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Distinct a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Distinct a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Distinct a a0 -> a0 toList :: Distinct a a0 -> [a0] null :: Distinct a a0 -> Bool length :: Distinct a a0 -> Int elem :: Eq a0 => a0 -> Distinct a a0 -> Bool maximum :: Ord a0 => Distinct a a0 -> a0 minimum :: Ord a0 => Distinct a a0 -> a0 sum :: Num a0 => Distinct a a0 -> a0 product :: Num a0 => Distinct a a0 -> a0
Eq a => Eq (Distinct a b) Source #
Instance details Defined in LSC.BinarySearch Methods (==) :: Distinct a b -> Distinct a b -> Bool (/=) :: Distinct a b -> Distinct a b -> Bool
Ord a => Ord (Distinct a b) Source #
Instance details Defined in LSC.BinarySearch Methods compare :: Distinct a b -> Distinct a b -> Ordering (<) :: Distinct a b -> Distinct a b -> Bool (<=) :: Distinct a b -> Distinct a b -> Bool (>) :: Distinct a b -> Distinct a b -> Bool (>=) :: Distinct a b -> Distinct a b -> Bool max :: Distinct a b -> Distinct a b -> Distinct a b min :: Distinct a b -> Distinct a b -> Distinct a b
(Show a, Show b) => Show (Distinct a b) Source #
Instance details Defined in LSC.BinarySearch Methods showsPrec :: Int -> Distinct a b -> ShowS show :: Distinct a b -> String showList :: [Distinct a b] -> ShowS

distinct :: a -> b -> Distinct a b Source #

getDistinct :: Distinct a b -> b Source #

binarySearch :: Ord a => [a] -> [a] Source #

unstableUnique :: Ord a => [a] -> [a] Source #

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

distinctPairs :: [a] -> [(a, a)] Source #

median :: Integral a => [a] -> a Source #

medianElements :: [a] -> [a] Source #