The index i
in candidates.indices
such that candidates(i) <= x
and
candidates(i)
is closest to x
, determined by binary search, or -1
if x < candidates(0)
.
The index i
in candidates.indices
such that candidates(i) <= x
and
candidates(i)
is closest to x
, determined by binary search, or -1
if x < candidates(0)
.
If between 0 and candidates.length
use this
as the first search point, otherwise use
candidates.length/2
.
An array twice the size of given array, with existing elements copied over