iota-0.1.0.0

Safe Haskell	Safe-Inferred
Language	GHC2021

Algorithm.BinarySearch

Synopsis

lowerBoundM :: Monad m => Int -> Int -> (Int -> m Bool) -> m Int
upperBoundM :: Monad m => Int -> Int -> (Int -> m Bool) -> m Int
lowerBound :: Int -> Int -> (Int -> Bool) -> Int
upperBound :: Int -> Int -> (Int -> Bool) -> Int
lowerBoundInteger :: Integer -> Integer -> (Integer -> Bool) -> Integer
upperBoundInteger :: Integer -> Integer -> (Integer -> Bool) -> Integer
lowerBoundIntegerM :: Monad m => Integer -> Integer -> (Integer -> m Bool) -> m Integer
upperBoundIntegerM :: Monad m => Integer -> Integer -> (Integer -> m Bool) -> m Integer
lowerBoundDouble :: Double -> Double -> (Double -> Bool) -> Double
upperBoundDouble :: Double -> Double -> (Double -> Bool) -> Double

Documentation

lowerBoundM :: Monad m => Int -> Int -> (Int -> m Bool) -> m Int Source #

assert (p high)

upperBoundM :: Monad m => Int -> Int -> (Int -> m Bool) -> m Int Source #

assert (p low)

lowerBound :: Int -> Int -> (Int -> Bool) -> Int Source #

assert (p high)

upperBound :: Int -> Int -> (Int -> Bool) -> Int Source #

assert (p low)

lowerBoundInteger :: Integer -> Integer -> (Integer -> Bool) -> Integer Source #

upperBoundInteger :: Integer -> Integer -> (Integer -> Bool) -> Integer Source #

lowerBoundIntegerM :: Monad m => Integer -> Integer -> (Integer -> m Bool) -> m Integer Source #

upperBoundIntegerM :: Monad m => Integer -> Integer -> (Integer -> m Bool) -> m Integer Source #

lowerBoundDouble :: Double -> Double -> (Double -> Bool) -> Double Source #

assert (p high)

upperBoundDouble :: Double -> Double -> (Double -> Bool) -> Double Source #

assert (p low)