(parent, workInProgress)
| 10628 | } |
| 10629 | |
| 10630 | function appendAllChildren(parent, workInProgress) { |
| 10631 | // We only have the top Fiber that was created but we need recurse down its |
| 10632 | // children to find all the terminal nodes. |
| 10633 | var node = workInProgress.child; |
| 10634 | while (node !== null) { |
| 10635 | if (node.tag === HostComponent || node.tag === HostText) { |
| 10636 | appendInitialChild(parent, node.stateNode); |
| 10637 | } else if (node.tag === HostPortal) { |
| 10638 | // If we have a portal child, then we don't want to traverse |
| 10639 | // down its children. Instead, we'll get insertions from each child in |
| 10640 | // the portal directly. |
| 10641 | } else if (node.child !== null) { |
| 10642 | node.child['return'] = node; |
| 10643 | node = node.child; |
| 10644 | continue; |
| 10645 | } |
| 10646 | if (node === workInProgress) { |
| 10647 | return; |
| 10648 | } |
| 10649 | while (node.sibling === null) { |
| 10650 | if (node['return'] === null || node['return'] === workInProgress) { |
| 10651 | return; |
| 10652 | } |
| 10653 | node = node['return']; |
| 10654 | } |
| 10655 | node.sibling['return'] = node['return']; |
| 10656 | node = node.sibling; |
| 10657 | } |
| 10658 | } |
| 10659 | |
| 10660 | var updateHostContainer = void 0; |
| 10661 | var updateHostComponent = void 0; |
no outgoing calls
no test coverage detected