Plan.walk: def of ezx@1.13.0.0
Import: import ezx@1.13.0.0/src/lock/plan.bend as Plan
Lines 183-190 of ezx@1.13.0.0/src/lock/plan.bend: https://jend.leeeet.dev/read.txt?path=ezx@1.13.0.0/src/lock/plan.bend&start_line=183&end_line=190

import Base
import ezx@1.13.0.0/src/lock/world.bend as W
import ezx@1.13.0.0/src/lock/lock.bend as L

# every package the queue reaches, each one once. A walk that runs out of fuel
# with the queue not empty is a refusal, never a lock of what it had so far.
def walk(fuel: Nat, +orgs: List<&2, L.Origin>, +ns: List<&2, L.Name>, +js: List<&2, W.Judged>, +wk: Walk) -> Walk:
  match fuel:
    case 0n:
      walk.out(walk.done(wk), wk)
    case 1n+f:
      walk.more(walk.done(wk), wk, now => walk(f, orgs, ns, js, walk.step(orgs, ns, js, now)))

Uses (10):
  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=ezx@1.13.0.0/src/lock/lock.bend&name=Name
  https://jend.leeeet.dev/definition.txt?path=ezx@1.13.0.0/src/lock/lock.bend&name=Origin
  https://jend.leeeet.dev/definition.txt?path=ezx@1.13.0.0/src/lock/plan.bend&name=Walk
  https://jend.leeeet.dev/definition.txt?path=ezx@1.13.0.0/src/lock/plan.bend&name=walk.done
  https://jend.leeeet.dev/definition.txt?path=ezx@1.13.0.0/src/lock/plan.bend&name=walk.more
  https://jend.leeeet.dev/definition.txt?path=ezx@1.13.0.0/src/lock/plan.bend&name=walk.out
  https://jend.leeeet.dev/definition.txt?path=ezx@1.13.0.0/src/lock/plan.bend&name=walk.step
  https://jend.leeeet.dev/definition.txt?path=ezx@1.13.0.0/src/lock/world.bend&name=Judged