(parent, workInProgress)
| 10721 | } |
| 10722 | |
| 10723 | function appendAllChildren(parent, workInProgress) { |
| 10724 | // We only have the top Fiber that was created but we need recurse down its |
| 10725 | // children to find all the terminal nodes. |
| 10726 | var node = workInProgress.child; |
| 10727 | while (node !== null) { |
| 10728 | if (node.tag === HostComponent || node.tag === HostText) { |
| 10729 | appendInitialChild(parent, node.stateNode); |
| 10730 | } else if (node.tag === HostPortal) { |
| 10731 | // If we have a portal child, then we don't want to traverse |
| 10732 | // down its children. Instead, we'll get insertions from each child in |
| 10733 | // the portal directly. |
| 10734 | } else if (node.child !== null) { |
| 10735 | node.child['return'] = node; |
| 10736 | node = node.child; |
| 10737 | continue; |
| 10738 | } |
| 10739 | if (node === workInProgress) { |
| 10740 | return; |
| 10741 | } |
| 10742 | while (node.sibling === null) { |
| 10743 | if (node['return'] === null || node['return'] === workInProgress) { |
| 10744 | return; |
| 10745 | } |
| 10746 | node = node['return']; |
| 10747 | } |
| 10748 | node.sibling['return'] = node['return']; |
| 10749 | node = node.sibling; |
| 10750 | } |
| 10751 | } |
| 10752 | |
| 10753 | var updateHostContainer = void 0; |
| 10754 | var updateHostComponent = void 0; |
no outgoing calls
no test coverage detected