The binary-search package

[Tags:bsd3, library, test]


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 b

The 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__


Versions 0.0, 0.1, 0.9, 1.0,,,
Dependencies base (>=4.5 && <5), containers (>=0.4), transformers [details]
License BSD3
Author Ross Paterson <>, Takayuki Muranushi <>
Maintainer Takayuki Muranushi <>
Stability Unknown
Category Algorithms
Source repository head: git clone
Uploaded Fri Jan 22 01:28:44 UTC 2016 by TakayukiMuranushi
Distributions LTSHaskell:, NixOS:, Stackage:, Tumbleweed:
Downloads 1350 total (31 in the last 30 days)
0 []
Status Docs available [build log]
Last success reported on 2016-10-27 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees