Bitlist.count_go: def of bend-collections@1.0.0.0
Import: import bend-collections@1.0.0.0/src/containers/bitlist.bend as Bitlist
Lines 201-207 of bend-collections@1.0.0.0/src/containers/bitlist.bend: https://jend.leeeet.dev/read.txt?path=bend-collections@1.0.0.0/src/containers/bitlist.bend&start_line=201&end_line=207

import Base
import bend-collections@1.0.0.0/src/containers/dynamic_array.bend as D

def count_go(k: Nat, p: D.DynArray<&2, U32> & Nat, +q: Nat) -> D.DynArray<&2, U32> & Nat:
  match k:
    case 0n:
      p
    case 1n+r:
      (w, +acc) = p
      count_go(r, count_add(D.get(U32, w, q), acc), 1n+q)

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/bitlist.bend&name=count_add
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/dynamic_array.bend&name=DynArray
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/dynamic_array.bend&name=get