(parent, workInProgress)
| 9952 | } |
| 9953 | |
| 9954 | function appendAllChildren(parent, workInProgress) { |
| 9955 | // We only have the top Fiber that was created but we need recurse down its |
| 9956 | // children to find all the terminal nodes. |
| 9957 | var node = workInProgress.child; |
| 9958 | while (node !== null) { |
| 9959 | if (node.tag === HostComponent || node.tag === HostText) { |
| 9960 | appendInitialChild(parent, node.stateNode); |
| 9961 | } else if (node.tag === HostPortal) { |
| 9962 | // If we have a portal child, then we don't want to traverse |
| 9963 | // down its children. Instead, we'll get insertions from each child in |
| 9964 | // the portal directly. |
| 9965 | } else if (node.child !== null) { |
| 9966 | node.child['return'] = node; |
| 9967 | node = node.child; |
| 9968 | continue; |
| 9969 | } |
| 9970 | if (node === workInProgress) { |
| 9971 | return; |
| 9972 | } |
| 9973 | while (node.sibling === null) { |
| 9974 | if (node['return'] === null || node['return'] === workInProgress) { |
| 9975 | return; |
| 9976 | } |
| 9977 | node = node['return']; |
| 9978 | } |
| 9979 | node.sibling['return'] = node['return']; |
| 9980 | node = node.sibling; |
| 9981 | } |
| 9982 | } |
| 9983 | |
| 9984 | var updateHostContainer = void 0; |
| 9985 | var updateHostComponent = void 0; |
no outgoing calls
no test coverage detected