def bitw.to_list

bend-osdev-algo@0.1.0.0 · algo.bend:122

import Base

122# the bits of w, least significant first, in front of rest
123def bitw.to_list(n: Nat, w: Word(n), rest: List<&2, Bool>) -> List<&2, Bool>:
124  match n:
125    case 0n:
126      rest
127    case 1n+p:
128      match w:
129        case WCon{b, t}:
130          Con{b, bitw.to_list(p, t, rest)}