Algo.bitw.ffs.step: def of bend-osdev-algo@0.1.0.0
Import: import bend-osdev-algo@0.1.0.0/algo.bend as Algo
Lines 53-63 of bend-osdev-algo@0.1.0.0/algo.bend: https://jend.leeeet.dev/read.txt?path=bend-osdev-algo@0.1.0.0/algo.bend&start_line=53&end_line=63

import Base

# k is ffs of the bits above the lowest one
def bitw.ffs.step(b: Bool, k: Nat) -> Nat:
  match b:
    case True{}:
      1n
    case False{}:
      match k:
        case 0n:
          0n
        case 1n+j:
          2n+j

Uses (2):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat