def bitw.fls.step
import bend-osdev-algo@0.1.0.0/algo.bend as Algoimport Base
74# k is fls of the bits above the lowest one
75def bitw.fls.step(k: Nat, b: Bool) -> Nat:
76 match k:
77 case 0n:
78 match b:
79 case True{}:
80 1n
81 case False{}:
82 0n
83 case 1n+j:
84 2n+j