def h.hashed_del

bend-kit-collections@0.1.4.1 · PROOF.bend:2533

import Base
import bend-mathlib@0.7.4.0/bool.bend as MBool
import bend-kit-collections@0.1.4.1/LAWS.bend as Laws
import bend-kit-collections@0.1.4.1/hmap.bend as M

2533def h.hashed_del(
2534  ~K: Data, ~V: Data, ~hash: K -> U32, ~eq: K -> K -> Bool,
2535  xs: List<&2, M.Entry<K, V>>, +o: U32, +k: K,
2536  hs: {Laws.hmap_hashed(~K, ~V, ~hash, xs, o) == True{} : Bool}
2537) -> {Laws.hmap_hashed(~K, ~V, ~hash, M.HMap.entries.del(~K, ~V, ~eq, xs, k), o) == True{} : Bool}:
2538  match xs:
2539    case Nil{}:
2540      {==}
2541    case Con{M.Entry{+key, +val}, +rest}:
2542      +hs = hs
2543      h.hashed_del.c(~K, ~V, ~hash, ~eq, key, val, rest, o, k, eq(k, key), hs,
2544        h.hashed_del(~K, ~V, ~hash, ~eq, rest, o, k,
2545          MBool.eq_true_of_and_right(U32.is_eq(o, hash(key)), Laws.hmap_hashed(~K, ~V, ~hash, rest, o), hs)))