mirror of
https://github.com/facebook/react-native.git
synced 2025-11-01 09:14:26 +00:00
be51d0564b
Summary: The algorithm is quite simply: 1. Get family objects of the two nodes (inner and outer). 2. Traverse the list of family objects starting from the inner one and form a reversed list of them. 3. tarting from the inner node, traverse the tree layer-by-layer choosing a next element of the path by comparing the family object of each node on the level and an object from the list. Reviewed By: JoshuaGross Differential Revision: D14416950 fbshipit-source-id: 23c659a9e01690f90174193650a2b0ef09eadb4d