The binary-search package

[Tags: bsd3, library]

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

Properties

Versions0.0, 0.1, 0.9, 1.0, 1.0.0.1, 1.0.0.2, 1.0.0.3
Change logNone available
Dependenciesbase (>=4.5 && <5), containers (>=0.4), transformers [details]
LicenseBSD3
AuthorRoss Paterson <ross@soi.city.ac.uk>, Takayuki Muranushi <muranushi@gmail.com>
MaintainerTakayuki Muranushi <muranushi@gmail.com>
CategoryAlgorithms
Source repositoryhead: git clone https://github.com/nushio3/binary-search
UploadedFri Jan 22 01:28:44 UTC 2016 by TakayukiMuranushi
DistributionsLTSHaskell:1.0.0.3, Stackage:1.0.0.3
Downloads1140 total (60 in last 30 days)
Votes
0 []
StatusDocs pending
Build status unknown [no reports yet]

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees