Visgraph.merge_block: def of bend-visgraph@2.0.0.0
Import: import bend-visgraph@2.0.0.0/visgraph.bend as Visgraph
Lines 386-392 of bend-visgraph@2.0.0.0/visgraph.bend: https://jend.leeeet.dev/read.txt?path=bend-visgraph@2.0.0.0/visgraph.bend&start_line=386&end_line=392

import Base

# The merge replays the stack over every point before the block. The points
# the block's own stack could not bound pop it in order; the others sit on
# the block's stack, which goes on top.
def merge_block(b: Block, m: Merged) -> Merged:
  Block{+start, +opening_nans, unbounded, st, +visits} = b
  Merged{g, lefts, rights, +v} = m
  push_block_stack(st, bound_unbounded(in_order(unbounded, UNil{}), Merged{push_opening_nans(U32.to_nat(opening_nans), start, g), lefts, rights, F32.add(v, visits)}))

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.to_nat
  https://jend.leeeet.dev/definition.txt?path=bend-visgraph@2.0.0.0/visgraph.bend&name=Block
  https://jend.leeeet.dev/definition.txt?path=bend-visgraph@2.0.0.0/visgraph.bend&name=Merged
  https://jend.leeeet.dev/definition.txt?path=bend-visgraph@2.0.0.0/visgraph.bend&name=Unbounded
  https://jend.leeeet.dev/definition.txt?path=bend-visgraph@2.0.0.0/visgraph.bend&name=bound_unbounded
  https://jend.leeeet.dev/definition.txt?path=bend-visgraph@2.0.0.0/visgraph.bend&name=in_order
  https://jend.leeeet.dev/definition.txt?path=bend-visgraph@2.0.0.0/visgraph.bend&name=push_block_stack
  https://jend.leeeet.dev/definition.txt?path=bend-visgraph@2.0.0.0/visgraph.bend&name=push_opening_nans