def h.g_leaf_r
bend-kit-collections@0.1.4.1 · PROOF.bend:3044
import bend-kit-collections@0.1.4.1/PROOF.bend as PROOF
import Base
import bend-kit-collections@0.1.4.1/LAWS.bend as Laws
import bend-kit-collections@0.1.4.1/hmap.bend as M
3044def h.g_leaf_r(
3045 ~K: Data, ~V: Data, ~hash: K -> U32, ~eq: K -> K -> Bool,
3046 ~sound: @x: K -> @y: K -> {eq(x, y) == True{} : Bool} -> {x == y : K},
3047 p: Nat, +mm: U32, +o: U32, +es: List<&2, M.Entry<K, V>>, +k: K,
3048 hs: {Laws.hmap_hashed(~K, ~V, ~hash, es, o) == True{} : Bool}
3049) -> {h.G(~K, ~V, ~eq, p, mm, M.HLeaf{o, es}, hash(k), k) == h.R(~K, ~V, ~hash, ~eq, o, es, k) : Maybe<&2, V>}:
3050 match p:
3051 case 0n:
3052 h.r_eg(~K, ~V, ~hash, ~eq, ~sound, o, es, k, hs)
3053 case 1n+q:
3054 {==}