Plan.walk.fuel: def of ezx@1.13.0.0
Import: import ezx@1.13.0.0/src/lock/plan.bend as Plan
Lines 253-261 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=253&end_line=261

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

# how many steps the walk may take: one for each hash the queue starts with,
# one for each import a verdict can queue, since a hash is resolved at most
# once, and one more to spare. That is a step for every hash the walk can
# queue, and it is a function of the walk's inputs rather than a fixed
# number, as the add walk's is: a proof about inputs it does not know leaves it unevaluated,
# where bend 2.0.33 and 2.0.34 compare a fixed fuel's walk one stack frame a
# step and overflow the checker past about 10000.
def walk.fuel(queue: List<&2, String>, ns: List<&2, L.Name>, js: List<&2, W.Judged>) -> Nat:
  Nat.add(1n, Nat.add(List.length(&2, String, queue), fuel.judged(js, ns)))

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.length
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=String
  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/plan.bend&name=fuel.judged
  https://jend.leeeet.dev/definition.txt?path=ezx@1.13.0.0/src/lock/world.bend&name=Judged