Zip a pair of trees of types A and B into a single tree of [A, B].
If their shapes do not match, the result will include only the intersection.
Any nodes not on the shape of the intersection of the two trees will be
discarded.
See zipThese for a zip that does not crop and is therefore pleasantly
associative.
// Zip two trees of identical shape constleft: Tree<string> = branch('a', [branch('b', [of('c')])]), right: Tree<number> = branch( 1 , [branch( 2 , [of( 3 )])])
Zip a pair of trees of types
AandBinto a single tree of[A, B].If their shapes do not match, the result will include only the intersection. Any nodes not on the shape of the intersection of the two trees will be discarded.
See zipThese for a zip that does not crop and is therefore pleasantly associative.