binary-search: Binary and exponential searches

[ algorithms, bsd3, library ] [ Propose Tags ]

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

Versions 0.0, 0.1, 0.9, 1.0, 1.0.0.1, 1.0.0.2, 1.0.0.3
Dependencies base (>=4.5 && <5), containers (>=0.4), transformers [details]
License BSD-3-Clause
Author Ross Paterson <ross@soi.city.ac.uk>, Takayuki Muranushi <muranushi@gmail.com>
Maintainer Takayuki Muranushi <muranushi@gmail.com>
Category Algorithms
Source repo head: git clone https://github.com/nushio3/binary-search
Uploaded by TakayukiMuranushi at Fri Jan 22 01:28:44 UTC 2016
Distributions LTSHaskell:1.0.0.3, NixOS:1.0.0.3, Stackage:1.0.0.3
Downloads 4010 total (44 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2016-10-27 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees