(parent, workInProgress)
| 10879 | } |
| 10880 | |
| 10881 | function appendAllChildren(parent, workInProgress) { |
| 10882 | // We only have the top Fiber that was created but we need recurse down its |
| 10883 | // children to find all the terminal nodes. |
| 10884 | var node = workInProgress.child; |
| 10885 | while (node !== null) { |
| 10886 | if (node.tag === HostComponent || node.tag === HostText) { |
| 10887 | appendInitialChild(parent, node.stateNode); |
| 10888 | } else if (node.tag === HostPortal) { |
| 10889 | // If we have a portal child, then we don't want to traverse |
| 10890 | // down its children. Instead, we'll get insertions from each child in |
| 10891 | // the portal directly. |
| 10892 | } else if (node.child !== null) { |
| 10893 | node.child['return'] = node; |
| 10894 | node = node.child; |
| 10895 | continue; |
| 10896 | } |
| 10897 | if (node === workInProgress) { |
| 10898 | return; |
| 10899 | } |
| 10900 | while (node.sibling === null) { |
| 10901 | if (node['return'] === null || node['return'] === workInProgress) { |
| 10902 | return; |
| 10903 | } |
| 10904 | node = node['return']; |
| 10905 | } |
| 10906 | node.sibling['return'] = node['return']; |
| 10907 | node = node.sibling; |
| 10908 | } |
| 10909 | } |
| 10910 | |
| 10911 | var updateHostContainer = void 0; |
| 10912 | var updateHostComponent = void 0; |
no outgoing calls
no test coverage detected