react-test-renderer 15.5.0 → 15.5.4

package/lib/shallow/ReactFiberBeginWork.js

@@ -0,0 +1,380 @@
+/**
+ * Copyright 2013-present, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ *
+ * 
+ */
+
+'use strict';
+
+var _require = require('./ReactChildFiber'),
+    reconcileChildFibers = _require.reconcileChildFibers,
+    reconcileChildFibersInPlace = _require.reconcileChildFibersInPlace,
+    cloneChildFibers = _require.cloneChildFibers;
+
+var _require2 = require('./ReactPriorityLevel'),
+    LowPriority = _require2.LowPriority;
+
+var ReactTypeOfWork = require('./ReactTypeOfWork');
+var IndeterminateComponent = ReactTypeOfWork.IndeterminateComponent,
+    FunctionalComponent = ReactTypeOfWork.FunctionalComponent,
+    ClassComponent = ReactTypeOfWork.ClassComponent,
+    HostContainer = ReactTypeOfWork.HostContainer,
+    HostComponent = ReactTypeOfWork.HostComponent,
+    CoroutineComponent = ReactTypeOfWork.CoroutineComponent,
+    CoroutineHandlerPhase = ReactTypeOfWork.CoroutineHandlerPhase,
+    YieldComponent = ReactTypeOfWork.YieldComponent;
+
+var _require3 = require('./ReactPriorityLevel'),
+    NoWork = _require3.NoWork,
+    OffscreenPriority = _require3.OffscreenPriority;
+
+var _require4 = require('./ReactFiberUpdateQueue'),
+    createUpdateQueue = _require4.createUpdateQueue,
+    addToQueue = _require4.addToQueue,
+    addCallbackToQueue = _require4.addCallbackToQueue,
+    mergeUpdateQueue = _require4.mergeUpdateQueue;
+
+var ReactInstanceMap = require('./ReactInstanceMap');
+
+module.exports = function (config, getScheduler) {
+
+  function markChildAsProgressed(current, workInProgress, priorityLevel) {
+    // We now have clones. Let's store them as the currently progressed work.
+    workInProgress.progressedChild = workInProgress.child;
+    workInProgress.progressedPriority = priorityLevel;
+    if (current) {
+      // We also store it on the current. When the alternate swaps in we can
+      // continue from this point.
+      current.progressedChild = workInProgress.progressedChild;
+      current.progressedPriority = workInProgress.progressedPriority;
+    }
+  }
+
+  function reconcileChildren(current, workInProgress, nextChildren) {
+    var priorityLevel = workInProgress.pendingWorkPriority;
+    reconcileChildrenAtPriority(current, workInProgress, nextChildren, priorityLevel);
+  }
+
+  function reconcileChildrenAtPriority(current, workInProgress, nextChildren, priorityLevel) {
+    // At this point any memoization is no longer valid since we'll have changed
+    // the children.
+    workInProgress.memoizedProps = null;
+    if (current && current.child === workInProgress.child) {
+      // If the current child is the same as the work in progress, it means that
+      // we haven't yet started any work on these children. Therefore, we use
+      // the clone algorithm to create a copy of all the current children.
+      workInProgress.child = reconcileChildFibers(workInProgress, workInProgress.child, nextChildren, priorityLevel);
+    } else {
+      // If, on the other hand, we don't have a current fiber or if it is
+      // already using a clone, that means we've already begun some work on this
+      // tree and we can continue where we left off by reconciling against the
+      // existing children.
+      workInProgress.child = reconcileChildFibersInPlace(workInProgress, workInProgress.child, nextChildren, priorityLevel);
+    }
+    markChildAsProgressed(current, workInProgress, priorityLevel);
+  }
+
+  function updateFunctionalComponent(current, workInProgress) {
+    var fn = workInProgress.type;
+    var props = workInProgress.pendingProps;
+
+    // TODO: Disable this before release, since it is not part of the public API
+    // I use this for testing to compare the relative overhead of classes.
+    if (typeof fn.shouldComponentUpdate === 'function') {
+      if (workInProgress.memoizedProps !== null) {
+        if (!fn.shouldComponentUpdate(workInProgress.memoizedProps, props)) {
+          return bailoutOnAlreadyFinishedWork(current, workInProgress);
+        }
+      }
+    }
+
+    var nextChildren = fn(props);
+    reconcileChildren(current, workInProgress, nextChildren);
+    return workInProgress.child;
+  }
+
+  function scheduleUpdate(fiber, updateQueue, priorityLevel) {
+    var _getScheduler = getScheduler(),
+        scheduleDeferredWork = _getScheduler.scheduleDeferredWork;
+
+    fiber.updateQueue = updateQueue;
+    // Schedule update on the alternate as well, since we don't know which tree
+    // is current.
+    if (fiber.alternate) {
+      fiber.alternate.updateQueue = updateQueue;
+    }
+    while (true) {
+      if (fiber.pendingWorkPriority === NoWork || fiber.pendingWorkPriority >= priorityLevel) {
+        fiber.pendingWorkPriority = priorityLevel;
+      }
+      if (fiber.alternate) {
+        if (fiber.alternate.pendingWorkPriority === NoWork || fiber.alternate.pendingWorkPriority >= priorityLevel) {
+          fiber.alternate.pendingWorkPriority = priorityLevel;
+        }
+      }
+      // Duck type root
+      if (fiber.stateNode && fiber.stateNode.containerInfo) {
+        var root = fiber.stateNode;
+        scheduleDeferredWork(root, priorityLevel);
+        return;
+      }
+      if (!fiber['return']) {
+        throw new Error('No root!');
+      }
+      fiber = fiber['return'];
+    }
+  }
+
+  // Class component state updater
+  var updater = {
+    enqueueSetState: function (instance, partialState) {
+      var fiber = ReactInstanceMap.get(instance);
+      var updateQueue = fiber.updateQueue ? addToQueue(fiber.updateQueue, partialState) : createUpdateQueue(partialState);
+      scheduleUpdate(fiber, updateQueue, LowPriority);
+    },
+    enqueueReplaceState: function (instance, state) {
+      var fiber = ReactInstanceMap.get(instance);
+      var updateQueue = createUpdateQueue(state);
+      updateQueue.isReplace = true;
+      scheduleUpdate(fiber, updateQueue, LowPriority);
+    },
+    enqueueForceUpdate: function (instance) {
+      var fiber = ReactInstanceMap.get(instance);
+      var updateQueue = fiber.updateQueue || createUpdateQueue(null);
+      updateQueue.isForced = true;
+      scheduleUpdate(fiber, updateQueue, LowPriority);
+    },
+    enqueueCallback: function (instance, callback) {
+      var fiber = ReactInstanceMap.get(instance);
+      var updateQueue = fiber.updateQueue ? fiber.updateQueue : createUpdateQueue(null);
+      addCallbackToQueue(updateQueue, callback);
+      fiber.updateQueue = updateQueue;
+      if (fiber.alternate) {
+        fiber.alternate.updateQueue = updateQueue;
+      }
+    }
+  };
+
+  function updateClassComponent(current, workInProgress) {
+    // A class component update is the result of either new props or new state.
+    // Account for the possibly of missing pending props by falling back to the
+    // memoized props.
+    var props = workInProgress.pendingProps;
+    if (!props && current) {
+      props = current.memoizedProps;
+    }
+    // Compute the state using the memoized state and the update queue.
+    var updateQueue = workInProgress.updateQueue;
+    var previousState = current ? current.memoizedState : null;
+    var state = updateQueue ? mergeUpdateQueue(updateQueue, previousState, props) : previousState;
+
+    var instance = workInProgress.stateNode;
+    if (!instance) {
+      var ctor = workInProgress.type;
+      workInProgress.stateNode = instance = new ctor(props);
+      state = instance.state || null;
+      // The initial state must be added to the update queue in case
+      // setState is called before the initial render.
+      if (state !== null) {
+        workInProgress.updateQueue = createUpdateQueue(state);
+      }
+      // The instance needs access to the fiber so that it can schedule updates
+      ReactInstanceMap.set(instance, workInProgress);
+      instance.updater = updater;
+    } else if (typeof instance.shouldComponentUpdate === 'function' && !(updateQueue && updateQueue.isForced)) {
+      if (workInProgress.memoizedProps !== null) {
+        // Reset the props, in case this is a ping-pong case rather than a
+        // completed update case. For the completed update case, the instance
+        // props will already be the memoizedProps.
+        instance.props = workInProgress.memoizedProps;
+        instance.state = workInProgress.memoizedState;
+        if (!instance.shouldComponentUpdate(props, state)) {
+          return bailoutOnAlreadyFinishedWork(current, workInProgress);
+        }
+      }
+    }
+
+    instance.props = props;
+    instance.state = state;
+    var nextChildren = instance.render();
+    reconcileChildren(current, workInProgress, nextChildren);
+
+    return workInProgress.child;
+  }
+
+  function updateHostComponent(current, workInProgress) {
+    var nextChildren = workInProgress.pendingProps.children;
+    if (workInProgress.pendingProps.hidden && workInProgress.pendingWorkPriority !== OffscreenPriority) {
+      // If this host component is hidden, we can bail out on the children.
+      // We'll rerender the children later at the lower priority.
+
+      // It is unfortunate that we have to do the reconciliation of these
+      // children already since that will add them to the tree even though
+      // they are not actually done yet. If this is a large set it is also
+      // confusing that this takes time to do right now instead of later.
+
+      if (workInProgress.progressedPriority === OffscreenPriority) {
+        // If we already made some progress on the offscreen priority before,
+        // then we should continue from where we left off.
+        workInProgress.child = workInProgress.progressedChild;
+      }
+
+      // Reconcile the children and stash them for later work.
+      reconcileChildrenAtPriority(current, workInProgress, nextChildren, OffscreenPriority);
+      workInProgress.child = current ? current.child : null;
+      // Abort and don't process children yet.
+      return null;
+    } else {
+      reconcileChildren(current, workInProgress, nextChildren);
+      return workInProgress.child;
+    }
+  }
+
+  function mountIndeterminateComponent(current, workInProgress) {
+    var fn = workInProgress.type;
+    var props = workInProgress.pendingProps;
+    var value = fn(props);
+    if (typeof value === 'object' && value && typeof value.render === 'function') {
+      // Proceed under the assumption that this is a class instance
+      workInProgress.tag = ClassComponent;
+      if (current) {
+        current.tag = ClassComponent;
+      }
+      value = value.render();
+    } else {
+      // Proceed under the assumption that this is a functional component
+      workInProgress.tag = FunctionalComponent;
+      if (current) {
+        current.tag = FunctionalComponent;
+      }
+    }
+    reconcileChildren(current, workInProgress, value);
+    return workInProgress.child;
+  }
+
+  function updateCoroutineComponent(current, workInProgress) {
+    var coroutine = workInProgress.pendingProps;
+    if (!coroutine) {
+      throw new Error('Should be resolved by now');
+    }
+    reconcileChildren(current, workInProgress, coroutine.children);
+  }
+
+  /*
+  function reuseChildrenEffects(returnFiber : Fiber, firstChild : Fiber) {
+    let child = firstChild;
+    do {
+      // Ensure that the first and last effect of the parent corresponds
+      // to the children's first and last effect.
+      if (!returnFiber.firstEffect) {
+        returnFiber.firstEffect = child.firstEffect;
+      }
+      if (child.lastEffect) {
+        if (returnFiber.lastEffect) {
+          returnFiber.lastEffect.nextEffect = child.firstEffect;
+        }
+        returnFiber.lastEffect = child.lastEffect;
+      }
+    } while (child = child.sibling);
+  }
+  */
+
+  function bailoutOnAlreadyFinishedWork(current, workInProgress) {
+    var priorityLevel = workInProgress.pendingWorkPriority;
+
+    // TODO: We should ideally be able to bail out early if the children have no
+    // more work to do. However, since we don't have a separation of this
+    // Fiber's priority and its children yet - we don't know without doing lots
+    // of the same work we do anyway. Once we have that separation we can just
+    // bail out here if the children has no more work at this priority level.
+    // if (workInProgress.priorityOfChildren <= priorityLevel) {
+    //   // If there are side-effects in these children that have not yet been
+    //   // committed we need to ensure that they get properly transferred up.
+    //   if (current && current.child !== workInProgress.child) {
+    //     reuseChildrenEffects(workInProgress, child);
+    //   }
+    //   return null;
+    // }
+
+    cloneChildFibers(current, workInProgress);
+    markChildAsProgressed(current, workInProgress, priorityLevel);
+    return workInProgress.child;
+  }
+
+  function bailoutOnLowPriority(current, workInProgress) {
+    if (current) {
+      workInProgress.child = current.child;
+      workInProgress.memoizedProps = current.memoizedProps;
+      workInProgress.output = current.output;
+    }
+    return null;
+  }
+
+  function beginWork(current, workInProgress, priorityLevel) {
+    if (workInProgress.pendingWorkPriority === NoWork || workInProgress.pendingWorkPriority > priorityLevel) {
+      return bailoutOnLowPriority(current, workInProgress);
+    }
+
+    if (workInProgress.progressedPriority === priorityLevel) {
+      // If we have progressed work on this priority level already, we can
+      // proceed this that as the child.
+      workInProgress.child = workInProgress.progressedChild;
+    }
+
+    if ((workInProgress.pendingProps === null || workInProgress.memoizedProps !== null && workInProgress.pendingProps === workInProgress.memoizedProps) && workInProgress.updateQueue === null) {
+      return bailoutOnAlreadyFinishedWork(current, workInProgress);
+    }
+
+    switch (workInProgress.tag) {
+      case IndeterminateComponent:
+        return mountIndeterminateComponent(current, workInProgress);
+      case FunctionalComponent:
+        return updateFunctionalComponent(current, workInProgress);
+      case ClassComponent:
+        return updateClassComponent(current, workInProgress);
+      case HostContainer:
+        reconcileChildren(current, workInProgress, workInProgress.pendingProps);
+        // A yield component is just a placeholder, we can just run through the
+        // next one immediately.
+        if (workInProgress.child) {
+          return beginWork(workInProgress.child.alternate, workInProgress.child, priorityLevel);
+        }
+        return null;
+      case HostComponent:
+        if (workInProgress.stateNode && typeof config.beginUpdate === 'function') {
+          config.beginUpdate(workInProgress.stateNode);
+        }
+        return updateHostComponent(current, workInProgress);
+      case CoroutineHandlerPhase:
+        // This is a restart. Reset the tag to the initial phase.
+        workInProgress.tag = CoroutineComponent;
+      // Intentionally fall through since this is now the same.
+      case CoroutineComponent:
+        updateCoroutineComponent(current, workInProgress);
+        // This doesn't take arbitrary time so we could synchronously just begin
+        // eagerly do the work of workInProgress.child as an optimization.
+        if (workInProgress.child) {
+          return beginWork(workInProgress.child.alternate, workInProgress.child, priorityLevel);
+        }
+        return workInProgress.child;
+      case YieldComponent:
+        // A yield component is just a placeholder, we can just run through the
+        // next one immediately.
+        if (workInProgress.sibling) {
+          return beginWork(workInProgress.sibling.alternate, workInProgress.sibling, priorityLevel);
+        }
+        return null;
+      default:
+        throw new Error('Unknown unit of work tag');
+    }
+  }
+
+  return {
+    beginWork: beginWork
+  };
+};

package/lib/shallow/ReactFiberCommitWork.js

@@ -0,0 +1,78 @@
+/**
+ * Copyright 2013-present, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ *
+ * 
+ */
+
+'use strict';
+
+var ReactTypeOfWork = require('./ReactTypeOfWork');
+var ClassComponent = ReactTypeOfWork.ClassComponent,
+    HostContainer = ReactTypeOfWork.HostContainer,
+    HostComponent = ReactTypeOfWork.HostComponent;
+
+var _require = require('./ReactFiberUpdateQueue'),
+    callCallbacks = _require.callCallbacks;
+
+module.exports = function (config) {
+
+  var updateContainer = config.updateContainer;
+  var commitUpdate = config.commitUpdate;
+
+  function commitWork(current, finishedWork) {
+    switch (finishedWork.tag) {
+      case ClassComponent:
+        {
+          // Clear updates from current fiber. This must go before the callbacks
+          // are reset, in case an update is triggered from inside a callback. Is
+          // this safe? Relies on the assumption that work is only committed if
+          // the update queue is empty.
+          if (finishedWork.alternate) {
+            finishedWork.alternate.updateQueue = null;
+          }
+          if (finishedWork.callbackList) {
+            var callbackList = finishedWork.callbackList;
+
+            finishedWork.callbackList = null;
+            callCallbacks(callbackList, finishedWork.stateNode);
+          }
+          // TODO: Fire componentDidMount/componentDidUpdate, update refs
+          return;
+        }
+      case HostContainer:
+        {
+          // TODO: Attach children to root container.
+          var children = finishedWork.output;
+          var root = finishedWork.stateNode;
+          var containerInfo = root.containerInfo;
+          updateContainer(containerInfo, children);
+          return;
+        }
+      case HostComponent:
+        {
+          if (finishedWork.stateNode == null || !current) {
+            throw new Error('This should only be done during updates.');
+          }
+          // Commit the work prepared earlier.
+          var child = finishedWork.child;
+          var _children = child && !child.sibling ? child.output : child;
+          var newProps = finishedWork.memoizedProps;
+          var oldProps = current.memoizedProps;
+          var instance = finishedWork.stateNode;
+          commitUpdate(instance, oldProps, newProps, _children);
+          return;
+        }
+      default:
+        throw new Error('This unit of work tag should not have side-effects.');
+    }
+  }
+
+  return {
+    commitWork: commitWork
+  };
+};

package/lib/shallow/ReactFiberCompleteWork.js

@@ -0,0 +1,208 @@
+/**
+ * Copyright 2013-present, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ *
+ * 
+ */
+
+'use strict';
+
+var _require = require('./ReactChildFiber'),
+    reconcileChildFibers = _require.reconcileChildFibers;
+
+var ReactTypeOfWork = require('./ReactTypeOfWork');
+var IndeterminateComponent = ReactTypeOfWork.IndeterminateComponent,
+    FunctionalComponent = ReactTypeOfWork.FunctionalComponent,
+    ClassComponent = ReactTypeOfWork.ClassComponent,
+    HostContainer = ReactTypeOfWork.HostContainer,
+    HostComponent = ReactTypeOfWork.HostComponent,
+    CoroutineComponent = ReactTypeOfWork.CoroutineComponent,
+    CoroutineHandlerPhase = ReactTypeOfWork.CoroutineHandlerPhase,
+    YieldComponent = ReactTypeOfWork.YieldComponent;
+
+
+module.exports = function (config) {
+
+  var createInstance = config.createInstance;
+  var prepareUpdate = config.prepareUpdate;
+
+  function markForPreEffect(workInProgress) {
+    // Schedule a side-effect on this fiber, BEFORE the children's side-effects.
+    if (workInProgress.firstEffect) {
+      workInProgress.nextEffect = workInProgress.firstEffect;
+      workInProgress.firstEffect = workInProgress;
+    } else {
+      workInProgress.firstEffect = workInProgress;
+      workInProgress.lastEffect = workInProgress;
+    }
+  }
+
+  // TODO: It's possible this will create layout thrash issues because mutations
+  // of the DOM and life-cycles are interleaved. E.g. if a componentDidMount
+  // of a sibling reads, then the next sibling updates and reads etc.
+  function markForPostEffect(workInProgress) {
+    // Schedule a side-effect on this fiber, AFTER the children's side-effects.
+    if (workInProgress.lastEffect) {
+      workInProgress.lastEffect.nextEffect = workInProgress;
+    } else {
+      workInProgress.firstEffect = workInProgress;
+    }
+    workInProgress.lastEffect = workInProgress;
+  }
+
+  function transferOutput(child, returnFiber) {
+    // If we have a single result, we just pass that through as the output to
+    // avoid unnecessary traversal. When we have multiple output, we just pass
+    // the linked list of fibers that has the individual output values.
+    returnFiber.output = child && !child.sibling ? child.output : child;
+    returnFiber.memoizedProps = returnFiber.pendingProps;
+  }
+
+  function recursivelyFillYields(yields, output) {
+    if (!output) {
+      // Ignore nulls etc.
+    } else if (output.tag !== undefined) {
+      // TODO: Fix this fragile duck test.
+      // Detect if this is a fiber, if so it is a fragment result.
+      // $FlowFixMe: Refinement issue.
+      var item = output;
+      do {
+        recursivelyFillYields(yields, item.output);
+        item = item.sibling;
+      } while (item);
+    } else {
+      // $FlowFixMe: Refinement issue. If it is not a Fiber or null, it is a yield
+      yields.push(output);
+    }
+  }
+
+  function moveCoroutineToHandlerPhase(current, workInProgress) {
+    var coroutine = workInProgress.pendingProps;
+    if (!coroutine) {
+      throw new Error('Should be resolved by now');
+    }
+
+    // First step of the coroutine has completed. Now we need to do the second.
+    // TODO: It would be nice to have a multi stage coroutine represented by a
+    // single component, or at least tail call optimize nested ones. Currently
+    // that requires additional fields that we don't want to add to the fiber.
+    // So this requires nested handlers.
+    // Note: This doesn't mutate the alternate node. I don't think it needs to
+    // since this stage is reset for every pass.
+    workInProgress.tag = CoroutineHandlerPhase;
+
+    // Build up the yields.
+    // TODO: Compare this to a generator or opaque helpers like Children.
+    var yields = [];
+    var child = workInProgress.child;
+    while (child) {
+      recursivelyFillYields(yields, child.output);
+      child = child.sibling;
+    }
+    var fn = coroutine.handler;
+    var props = coroutine.props;
+    var nextChildren = fn(props, yields);
+
+    var currentFirstChild = current ? current.stateNode : null;
+    // Inherit the priority of the returnFiber.
+    var priority = workInProgress.pendingWorkPriority;
+    workInProgress.stateNode = reconcileChildFibers(workInProgress, currentFirstChild, nextChildren, priority);
+    return workInProgress.stateNode;
+  }
+
+  function completeWork(current, workInProgress) {
+    switch (workInProgress.tag) {
+      case FunctionalComponent:
+        transferOutput(workInProgress.child, workInProgress);
+        return null;
+      case ClassComponent:
+        transferOutput(workInProgress.child, workInProgress);
+        // Don't use the state queue to compute the memoized state. We already
+        // merged it and assigned it to the instance. Transfer it from there.
+        // Also need to transfer the props, because pendingProps will be null
+        // in the case of an update
+        var _workInProgress$state = workInProgress.stateNode,
+            state = _workInProgress$state.state,
+            props = _workInProgress$state.props;
+
+        workInProgress.memoizedState = state;
+        workInProgress.memoizedProps = props;
+        // Transfer update queue to callbackList field so callbacks can be
+        // called during commit phase.
+        workInProgress.callbackList = workInProgress.updateQueue;
+        markForPostEffect(workInProgress);
+        return null;
+      case HostContainer:
+        transferOutput(workInProgress.child, workInProgress);
+        // We don't know if a container has updated any children so we always
+        // need to update it right now. We schedule this side-effect before
+        // all the other side-effects in the subtree. We need to schedule it
+        // before so that the entire tree is up-to-date before the life-cycles
+        // are invoked.
+        markForPreEffect(workInProgress);
+        return null;
+      case HostComponent:
+        var newProps = workInProgress.pendingProps;
+        var child = workInProgress.child;
+        var children = child && !child.sibling ? child.output : child;
+        if (current && workInProgress.stateNode != null) {
+          // If we have an alternate, that means this is an update and we need to
+          // schedule a side-effect to do the updates.
+          var oldProps = current.memoizedProps;
+          // If we get updated because one of our children updated, we don't
+          // have newProps so we'll have to reuse them.
+          // TODO: Split the update API as separate for the props vs. children.
+          // Even better would be if children weren't special cased at all tho.
+          if (!newProps) {
+            newProps = oldProps;
+          }
+          var instance = workInProgress.stateNode;
+          if (prepareUpdate(instance, oldProps, newProps, children)) {
+            // This returns true if there was something to update.
+            markForPreEffect(workInProgress);
+          }
+          // TODO: Is this actually ever going to change? Why set it every time?
+          workInProgress.output = instance;
+        } else {
+          if (!newProps) {
+            if (workInProgress.stateNode === null) {
+              throw new Error('We must have new props for new mounts.');
+            } else {
+              // This can happen when we abort work.
+              return null;
+            }
+          }
+          var _instance = createInstance(workInProgress.type, newProps, children);
+          // TODO: This seems like unnecessary duplication.
+          workInProgress.stateNode = _instance;
+          workInProgress.output = _instance;
+        }
+        workInProgress.memoizedProps = newProps;
+        return null;
+      case CoroutineComponent:
+        return moveCoroutineToHandlerPhase(current, workInProgress);
+      case CoroutineHandlerPhase:
+        transferOutput(workInProgress.stateNode, workInProgress);
+        // Reset the tag to now be a first phase coroutine.
+        workInProgress.tag = CoroutineComponent;
+        return null;
+      case YieldComponent:
+        // Does nothing.
+        return null;
+
+      // Error cases
+      case IndeterminateComponent:
+        throw new Error('An indeterminate component should have become determinate before completing.');
+      default:
+        throw new Error('Unknown unit of work tag');
+    }
+  }
+
+  return {
+    completeWork: completeWork
+  };
+};