binary-search
Binary and exponential searches
| Version on this page: | 1.0.0.3 |
| LTS Haskell 24.0: | 2.0.0 |
| Stackage Nightly 2025-07-14: | 2.0.0 |
| Latest on Hackage: | 2.0.0 |
binary-search-1.0.0.3@sha256:3db15438f8bfe00e4076a666090282722a3ff7edb6029303846668a4a05e68f0,2896Module documentation for 1.0.0.3
Introduction
This package provides varieties of binary search functions.
c.f. Numeric.Search for the examples.
These search function can search for pure and monadic predicates, of type:
pred :: Eq b => a -> b
pred :: (Eq b, Monad m) => a -> m bThe predicates must satisfy that the domain range for any codomain value
is continuous; that is, ∀x≦y≦z. pred x == pred z ⇒ pred y == pred x .
For example, we can address the problem of finding the boundary of an upward-closed set of integers, using a combination of exponential and binary searches.
Variants are provided
for searching within bounded and unbounded intervals of
both Integer and bounded integral types.
The package was created by Ross Paterson, and extended by Takayuki Muranushi, to be used together with SMT solvers.
The Module Structure
Numeric.Searchprovides the generic search combinator, to search for pure and monadic predicates.Numeric.Search.Bounded,Numeric.Search.Integer,Numeric.Search.Rangeprovides the various specialized searchers, which means less number of function arguments, and easier to use.
