Binary search on the interval of integers between ok
and ng
.
If ng
< ok
, the result is the smallest integer satisfying p
.
Otherwise, the result is the largest integer satisfying p
.
p
must be monotone such that p(ok)
= Truestd/core/types/True: bool
and p(ng)
= Falsestd/core/types/False: bool
.
Binary search on the interval of float64 between ok
and ng
.
This function returns a number close to the boundary of p
, which divides
a set of numbers into two intervals, all numbers in an interval satisfy p
,
and all numbers in another one do not.
p
must be monotone such that p(ok)
= Truestd/core/types/True: bool
and p(ng)
= Falsestd/core/types/False: bool
.
Binary search
.