Perform a binary search in the domain of function f, bounded by the values p and q
to find the least value v such that: @w <= (f v)
Modulehw-prim-0.6.3.2Haskell2010
HaskellWorks.Data.Search
- 1 value
- Packagehw-prim-0.6.3.2
- Exports1
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceSearch.hs