def Map.ins
import Base2799def Map.ins(
2800 -a: Quant, -V: Kind(a), m: Map<a, V>, key: String, x: V, +p: Nat
2801) -> Map<a, V>:
2802 match m:
2803 case MTip{}:
2804 MLeaf{key, x}
2805 case MLeaf{k, v}:
2806 Map.ins.splice(a, V, p, key, x, MLeaf{k, v})
2807 case MNode{+pos, lo, hi}:
2808 Map.ins.go(a, V, MNode{pos, lo, hi}, x, p, Map.bit(key, pos), Nat.is_lt(pos, p))
Uses (7)
Used by (11)
- Map.set.fin.go
- bend-collections-laws-crypto@1.0.0.0/proofs/lib/lemmas/proofs/map_bridge:ins_deep
- bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/proofs/map_bridge:ins_deep
- bend-collections-laws-crypto@1.0.0.0/proofs/lib/lemmas/proofs/map_bridge:ins_node
- bend-collections-laws-crypto@1.0.0.0/proofs/lib/lemmas/proofs/map_insert:deep_same_bit
- …