def E

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/blake/blake3/tree.bend:60

import Base
import bend-collections-laws-crypto@1.0.0.0/src/crypto/blake/blake3/blake3.bend as K

60# The stack t with h empty slots below it (the empty stack stays empty).
61def E(+h: Nat, t: K.Stack) -> K.Stack:
62  match t:
63    case K.StkNil{}: K.StkNil{}
64    case K.SEmpty{r}: emps(h,K.SEmpty{r})
65    case K.SFull{c,r}: emps(h,K.SFull{c,r})