def named.step

ezx@1.11.0.0 · src/git/git.bend:124

import Base

124# one step of the search, with the head's answer in hand. A recursive call in
125# an arm of a `Bool.pick` is not an arm at all: it is built whatever the
126# condition says, so the first row that answered still cost a walk of every
127# row after it.
128def named.step(here: Bool, rev: String, rest: Unit -> String) -> String:
129  match here:
130    case True{}:
131      rev
132    case False{}:
133      rest(Unit{})