Bitlist.bits_add: def of bend-collections@1.0.0.0
Import: import bend-collections@1.0.0.0/src/containers/bitlist.bend as Bitlist
Lines 231-238 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=231&end_line=238

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

# Word q holds bits 32q .. 32q+31; of the first n bits it contributes
# min(32, n - 32q) (none once 32q >= n).
def bits_add(+m: Nat, acc: List<&2, Bool>, g: D.DynArray<&2, U32> & Result<&2, &2, DE.Error, U32>) -> D.DynArray<&2, U32> & List<&2, Bool>:
  match g:
    case Tuple{w, Done{+x}}:
      (w, word_bits(m, x, acc))
    case Tuple{w, Fail{e}}:
      (w, acc)

Uses (10):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  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=Result
  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=word_bits
  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/types/dynamic_array.bend&name=Error