binary-search: Binary and exponential searches
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.
Downloads
- binary-search-0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.0, 0.1, 0.9, 1.0, 1.0.0.1, 1.0.0.2, 1.0.0.3, 2.0.0 |
---|---|
Dependencies | base [details] |
License | BSD-3-Clause |
Author | Ross Paterson <ross@soi.city.ac.uk> |
Maintainer | Ross Paterson <ross@soi.city.ac.uk> |
Category | Algorithms |
Uploaded | by RossPaterson at 2008-03-18T14:27:49Z |
Distributions | LTSHaskell:2.0.0, NixOS:2.0.0, Stackage:2.0.0 |
Reverse Dependencies | 4 direct, 8 indirect [details] |
Downloads | 10827 total (9 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |