binary-search

Binary and exponential searches

Version on this page:	0.1
LTS Haskell 23.21:	2.0.0
Stackage Nightly 2025-05-02:	2.0.0
Latest on Hackage:	2.0.0

See all snapshots binary-search appears in

BSD-3-Clause licensed by Ross Paterson, Takayuki Muranushi

Maintained by Takayuki Muranushi

This version can be pinned in stack with:binary-search-0.1@sha256:c0ac966422b5b91dc060be76223854e78c8b1b83f4ed47e8afdcbe4644f56b07,1778

Module documentation for 0.1

Numeric
- Numeric.Search
  - Numeric.Search.Bounded
  - Numeric.Search.Combinator
    - Numeric.Search.Combinator.Monadic
    - Numeric.Search.Combinator.Pure
  - Numeric.Search.Integer
  - Numeric.Search.Range

Depends on 2 packages(full list with versions):

base, containers

Used by 1 package in lts-4.2(full list with versions):

xlsx

These modules 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.