binary-search: Binary and exponential searches

[ algorithms, bsd3, library ] [ Propose Tags ]

Introduction

This package provides varieties of binary search functions.

These search function can search for predicates of the type pred :: (Integral a, Eq b) => a -> b, or monadic predicates pred :: (Integral a, 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 [faq] 0.0, 0.1, 0.9, 1.0, 1.0.0.1, 1.0.0.2, 1.0.0.3
Dependencies base (>=4.8 && <5), containers (>=0.4 && <0.6) [details]
License BSD-3-Clause
Author Ross Paterson <ross@soi.city.ac.uk>, Takayuki Muranushi <muranushi@gmail.com>
Maintainer Takayuki Muranushi <muranushi@gmail.com>
Revised Revision 1 made by HerbertValerioRiedel at 2016-11-27T16:04:02Z
Category Algorithms
Source repo head: git clone https://github.com/nushio3/binary-search
Uploaded by TakayukiMuranushi at 2016-01-18T16:09:14Z
Distributions LTSHaskell:1.0.0.3, NixOS:1.0.0.3, Stackage:1.0.0.3
Downloads 7021 total (312 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2016-01-19 [all 1 reports]

Modules

[Index]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees