def probe_node
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTreeimport Base
255def probe_node(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +id: Nat, +k: K, r: TreeMap<K, V, cmp> & Node<K>) -> TreeMap<K, V, cmp> & (Node<K> & Cmp):
256 match r:
257 case Tuple{m, Free{next}}:
258 (m, (Free{next}, EQ{}))
259 case Tuple{m, N{c, l, r, p, +key}}:
260 (m, (N{c, l, r, p, key}, cmp(k, key)))