def tab.count

bend-osdev-gf@0.1.1.0 · check.bend:11

import Base

11# The table path against the reference over every pair of bytes (and every
12# inverse): the number of disagreements. r is the table and its answer for
13# (a, b).
14def tab.count(ok: Bool, bad: Nat) -> Nat:
15  match ok:
16    case True{}:
17      bad
18    case False{}:
19      1n+bad