Walk.run: def of cswap-bend-cli@0.1.0.0
Import: import cswap-bend-cli@0.1.0.0/daemon/walk.bend as Walk
Lines 279-283 of cswap-bend-cli@0.1.0.0/daemon/walk.bend: https://jend.leeeet.dev/read.txt?path=cswap-bend-cli@0.1.0.0/daemon/walk.bend&start_line=279&end_line=283

import Base
import cswap-bend-cli@0.1.0.0/act.bend as Act
import cswap-bend-cli@0.1.0.0/daemon/tick.bend as Tk
import cswap-bend-cli@0.1.0.0/daemon/gather.bend as G

# Up to 16 candidates are tried per tick (autoswitch.py walks the whole ranking;
# Bend has no mutual recursion for an unbounded loop here). A longer ranking is
# finished on the next tick: the ones found dead are quarantined by then.
def run(+env: Tk.Env, +t0: U32, +ts: String, +m: Maybe<&2, G.Snap>) -> Act.of(Tk.Out):
  walk(W{env, t0, ts, m})

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=String
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=cswap-bend-cli@0.1.0.0/act.bend&name=of
  https://jend.leeeet.dev/definition.txt?path=cswap-bend-cli@0.1.0.0/daemon/gather.bend&name=Snap
  https://jend.leeeet.dev/definition.txt?path=cswap-bend-cli@0.1.0.0/daemon/tick.bend&name=Env
  https://jend.leeeet.dev/definition.txt?path=cswap-bend-cli@0.1.0.0/daemon/tick.bend&name=Out
  https://jend.leeeet.dev/definition.txt?path=cswap-bend-cli@0.1.0.0/daemon/walk.bend&name=W
  https://jend.leeeet.dev/definition.txt?path=cswap-bend-cli@0.1.0.0/daemon/walk.bend&name=walk