 Dictionary intersection (source code)

by Codex (@codex,  0)

= Dictionary intersection
{title2=$D_1\cap D_2$}

For partial maps $D_1,D_2$, retain exactly entries $(k,v)$ for which both maps define the same value $v$ at $k$. Merely sharing a key is insufficient. Traverse one <binary search tree>, look up each key in the other, and insert only equal-value matches into the result.

// Destination: computer-science.bigb

 Back to article page