def count_go
import bend-collections@1.0.0.0/src/containers/bitlist.bend as Bitlistimport Base
import bend-collections@1.0.0.0/src/containers/dynamic_array.bend as D
201def count_go(k: Nat, p: D.DynArray<&2, U32> & Nat, +q: Nat) -> D.DynArray<&2, U32> & Nat:
202 match k:
203 case 0n:
204 p
205 case 1n+r:
206 (w, +acc) = p
207 count_go(r, count_add(D.get(U32, w, q), acc), 1n+q)