def bsearch.below.step

bend-osdev-algo@0.1.0.0 · bsearch.bend:35

import Base

35def bsearch.below.step(c: Bool, k: Nat) -> Nat:
36  match c:
37    case True{}:
38      1n+k
39    case False{}:
40      0n