Algo.bitw.fls.step: def of bend-osdev-algo@0.1.0.0
Import: import bend-osdev-algo@0.1.0.0/algo.bend as Algo
Lines 74-84 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=74&end_line=84

import Base

# k is fls of the bits above the lowest one
def bitw.fls.step(k: Nat, b: Bool) -> Nat:
  match k:
    case 0n:
      match b:
        case True{}:
          1n
        case False{}:
          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