binary-search: Binary and exponential searches
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
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.Search provides the generic search combinator, to search for pure and monadic predicates.
|Versions [RSS] [faq]||0.0, 0.1, 0.9, 1.0, 18.104.22.168, 22.214.171.124, 126.96.36.199, 2.0.0|
|Dependencies||base (>=4.5 && <5), containers (>=0.4), transformers [details]|
|Author||Ross Paterson <firstname.lastname@example.org>, Takayuki Muranushi <email@example.com>|
|Maintainer||Takayuki Muranushi <firstname.lastname@example.org>|
|Source repo||head: git clone https://github.com/nushio3/binary-search|
|Uploaded||by TakayukiMuranushi at 2016-01-21T15:34:30Z|
|Distributions||LTSHaskell:2.0.0, NixOS:2.0.0, Stackage:2.0.0|
|Downloads||8955 total (126 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2016-01-21 [all 1 reports]