binary-search-0.9: Numeric/Search.hs

-- | This package provides combinators to construct many variants of
-- binary search.  Most generally, it provides the binary search over
-- predicate of the form @('Eq' b, 'Monad' m) => a -> m b@ . The other
-- searches are derived as special cases of this function.
--
-- 'BinarySearch' assumes two things;
--
-- 1. @b@, the codomain of 'PredicateM' belongs to type class 'Eq'.
--
-- 2. Each value of @b@ form a convex set in the codomain space of the
-- PredicateM. That is, if for certain pair @(left, right) :: (a, a)@
-- satisfies @pred left == val && pred right == val@, then also @pred
-- x == val@ for all @x@ such that @left <= x <= right@ .


module Numeric.Search (
         -- * Evidence
         Evidence(..),
         -- * Search Range
         Range,
         InitializesSearch,
         -- * Splitters
         splitForever, splitTill,

         -- * Search
         search, searchM,
         -- * Postprocess
         smallest, largest

) where

import Numeric.Search.Combinator.Pure
import Numeric.Search.Combinator.Monadic