react-test-renderer 16.0.0-beta.5 → 16.0.0

package/LICENSE

@@ -1,31 +1,21 @@
-BSD License
-
-For React software
+MIT License
 
 Copyright (c) 2013-present, Facebook, Inc.
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification,
-are permitted provided that the following conditions are met:
-
- * Redistributions of source code must retain the above copyright notice, this
-   list of conditions and the following disclaimer.
 
- * Redistributions in binary form must reproduce the above copyright notice,
-   this list of conditions and the following disclaimer in the documentation
-   and/or other materials provided with the distribution.
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
 
- * Neither the name Facebook nor the names of its contributors may be used to
-   endorse or promote products derived from this software without specific
-   prior written permission.
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
 
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/cjs/react-test-renderer-shallow.development.js

@@ -1,3 +1,11 @@
+/** @license React v16.0.0
+ * react-test-renderer-shallow.development.js
+ *
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
 'use strict';
 
 
@@ -14,23 +22,19 @@ var invariant = require('fbjs/lib/invariant');
 
 /**
  * Copyright (c) 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule reactProdInvariant
  * 
  */
 
 /**
- * Copyright 2016-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2016-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * 
  * @providesModule describeComponentFrame
@@ -41,12 +45,10 @@ var describeComponentFrame = function (name, source, ownerName) {
 };
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule getComponentName
  * 

package/cjs/react-test-renderer.development.js

@@ -1,3 +1,11 @@
+/** @license React v16.0.0
+ * react-test-renderer.development.js
+ *
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
 'use strict';
 
 
@@ -16,42 +24,35 @@ var shallowEqual = require('fbjs/lib/shallowEqual');
 
 /**
  * Copyright (c) 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule reactProdInvariant
  * 
  */
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactFeatureFlags
  * 
  */
 
 var ReactFeatureFlags = {
-  disableNewFiberFeatures: false,
-  enableAsyncSubtreeAPI: false
+  enableAsyncSubtreeAPI: true
 };
 
 var ReactFeatureFlags_1 = ReactFeatureFlags;
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactTypeOfSideEffect
  * 
@@ -72,12 +73,10 @@ var ReactTypeOfSideEffect = {
   Ref: 128 };
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactPriorityLevel
  * 
@@ -92,12 +91,10 @@ var ReactPriorityLevel = {
   OffscreenPriority: 5 };
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactTypeOfWork
  * 
@@ -147,6 +144,9 @@ var HostRoot$1 = ReactTypeOfWork.HostRoot;
 // When the tree is committed, the work-in-progress becomes the current.
 
 
+var _queue1 = void 0;
+var _queue2 = void 0;
+
 function comparePriority(a, b) {
   // When comparing update priorities, treat sync and Task work as equal.
   // TODO: Could we avoid the need for this by always coercing sync priority
@@ -243,10 +243,9 @@ function ensureUpdateQueues(fiber) {
     queue2 = null;
   }
 
-  // TODO: Refactor to avoid returning a tuple.
-  return [queue1,
+  _queue1 = queue1;
   // Return null if there is no alternate queue, or if its queue is the same.
-  queue2 !== queue1 ? queue2 : null];
+  _queue2 = queue2 !== queue1 ? queue2 : null;
 }
 
 // The work-in-progress queue is a subset of the current queue (if it exists).
@@ -280,13 +279,11 @@ function ensureUpdateQueues(fiber) {
 // If the update is cloned, it returns the cloned update.
 function insertUpdate(fiber, update) {
   // We'll have at least one and at most two distinct update queues.
-  var _ensureUpdateQueues = ensureUpdateQueues(fiber),
-      queue1 = _ensureUpdateQueues[0],
-      queue2 = _ensureUpdateQueues[1];
+  ensureUpdateQueues(fiber);
+  var queue1 = _queue1;
+  var queue2 = _queue2;
 
   // Warn if an update is scheduled from inside an updater function.
-
-
   {
     if (queue1.isProcessing || queue2 !== null && queue2.isProcessing) {
       warning$1(false, 'An update (setState, replaceState, or forceUpdate) was scheduled ' + 'from inside an update function. Update functions should be pure, ' + 'with zero side-effects. Consider using componentDidUpdate or a ' + 'callback.');
@@ -404,14 +401,12 @@ function addTopLevelUpdate$1(fiber, partialState, callback, priorityLevel) {
 
   if (isTopLevelUnmount) {
     // TODO: Redesign the top-level mount/update/unmount API to avoid this
-    var _ensureUpdateQueues2 = ensureUpdateQueues(fiber),
-        queue1 = _ensureUpdateQueues2[0],
-        queue2 = _ensureUpdateQueues2[1];
+    // special case.
+    var queue1 = _queue1;
+    var queue2 = _queue2;
 
     // Drop all updates that are lower-priority, so that the tree is not
     // remounted. We need to do this for both queues.
-
-
     if (queue1 !== null && update.next !== null) {
       update.next = null;
       queue1.last = update;
@@ -545,12 +540,10 @@ var ReactFiberUpdateQueue = {
 };
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule getComponentName
  * 
@@ -580,12 +573,10 @@ function getComponentName$1(instanceOrFiber) {
 var getComponentName_1 = getComponentName$1;
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactInstanceMap
  */
@@ -606,19 +597,19 @@ var ReactInstanceMap = {
    * supported we can rename it.
    */
   remove: function (key) {
-    key._reactInternalInstance = undefined;
+    key._reactInternalFiber = undefined;
   },
 
   get: function (key) {
-    return key._reactInternalInstance;
+    return key._reactInternalFiber;
   },
 
   has: function (key) {
-    return key._reactInternalInstance !== undefined;
+    return key._reactInternalFiber !== undefined;
   },
 
   set: function (key, value) {
-    key._reactInternalInstance = value;
+    key._reactInternalFiber = value;
   }
 };
 
@@ -982,12 +973,10 @@ var ReactFiberStack = {
 };
 
 /**
- * Copyright 2016-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2016-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * 
  * @providesModule describeComponentFrame
@@ -1102,12 +1091,10 @@ var ReactDebugCurrentFiber_1 = ReactDebugCurrentFiber$2;
 
 // Trust the developer to only use this with a true check
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactDebugFiberPerf
  * 
@@ -1562,6 +1549,11 @@ function popContextProvider(fiber) {
 }
 var popContextProvider_1 = popContextProvider;
 
+var popTopLevelContextObject = function (fiber) {
+  pop(didPerformWorkStackCursor, fiber);
+  pop(contextStackCursor, fiber);
+};
+
 var pushTopLevelContextObject = function (fiber, context, didChange) {
   !(contextStackCursor.cursor == null) ? invariant(false, 'Unexpected context found on stack. This error is likely caused by a bug in React. Please file an issue.') : void 0;
 
@@ -1690,6 +1682,7 @@ var ReactFiberContext = {
 	isContextConsumer: isContextConsumer_1,
 	isContextProvider: isContextProvider_1,
 	popContextProvider: popContextProvider_1,
+	popTopLevelContextObject: popTopLevelContextObject,
 	pushTopLevelContextObject: pushTopLevelContextObject,
 	processChildContext: processChildContext_1,
 	pushContextProvider: pushContextProvider,
@@ -1699,12 +1692,10 @@ var ReactFiberContext = {
 };
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactTypeOfInternalContext
  * 
@@ -1735,7 +1726,6 @@ var NoEffect$1 = ReactTypeOfSideEffect.NoEffect;
 
 {
   var getComponentName$5 = getComponentName_1;
-
   var hasBadMapPolyfill = false;
   try {
     var nonExtensibleObject = Object.preventExtensions({});
@@ -1757,69 +1747,66 @@ var NoEffect$1 = ReactTypeOfSideEffect.NoEffect;
   var debugCounter = 1;
 }
 
-// This is a constructor of a POJO instead of a constructor function for a few
-// reasons:
-// 1) Nobody should add any instance methods on this. Instance methods can be
-//    more difficult to predict when they get optimized and they are almost
-//    never inlined properly in static compilers.
-// 2) Nobody should rely on `instanceof Fiber` for type testing. We should
-//    always know when it is a fiber.
-// 3) We can easily go from a createFiber call to calling a constructor if that
-//    is faster. The opposite is not true.
-// 4) We might want to experiment with using numeric keys since they are easier
-//    to optimize in a non-JIT environment.
-// 5) It should be easy to port this to a C struct and keep a C implementation
-//    compatible.
-var createFiber = function (tag, key, internalContextTag) {
-  var fiber = {
-    // Instance
+function FiberNode(tag, key, internalContextTag) {
+  // Instance
+  this.tag = tag;
+  this.key = key;
+  this.type = null;
+  this.stateNode = null;
 
-    tag: tag,
+  // Fiber
+  this['return'] = null;
+  this.child = null;
+  this.sibling = null;
+  this.index = 0;
 
-    key: key,
+  this.ref = null;
 
-    type: null,
+  this.pendingProps = null;
+  this.memoizedProps = null;
+  this.updateQueue = null;
+  this.memoizedState = null;
 
-    stateNode: null,
+  this.internalContextTag = internalContextTag;
 
-    // Fiber
+  // Effects
+  this.effectTag = NoEffect$1;
+  this.nextEffect = null;
 
-    'return': null,
+  this.firstEffect = null;
+  this.lastEffect = null;
 
-    child: null,
-    sibling: null,
-    index: 0,
+  this.pendingWorkPriority = NoWork$1;
 
-    ref: null,
-
-    pendingProps: null,
-    memoizedProps: null,
-    updateQueue: null,
-    memoizedState: null,
-
-    internalContextTag: internalContextTag,
-
-    effectTag: NoEffect$1,
-    nextEffect: null,
-    firstEffect: null,
-    lastEffect: null,
-
-    pendingWorkPriority: NoWork$1,
-
-    alternate: null
-  };
+  this.alternate = null;
 
   {
-    fiber._debugID = debugCounter++;
-    fiber._debugSource = null;
-    fiber._debugOwner = null;
-    fiber._debugIsCurrentlyTiming = false;
+    this._debugID = debugCounter++;
+    this._debugSource = null;
+    this._debugOwner = null;
+    this._debugIsCurrentlyTiming = false;
     if (!hasBadMapPolyfill && typeof Object.preventExtensions === 'function') {
-      Object.preventExtensions(fiber);
+      Object.preventExtensions(this);
     }
   }
+}
 
-  return fiber;
+// This is a constructor function, rather than a POJO constructor, still
+// please ensure we do the following:
+// 1) Nobody should add any instance methods on this. Instance methods can be
+//    more difficult to predict when they get optimized and they are almost
+//    never inlined properly in static compilers.
+// 2) Nobody should rely on `instanceof Fiber` for type testing. We should
+//    always know when it is a fiber.
+// 3) We might want to experiment with using numeric keys since they are easier
+//    to optimize in a non-JIT environment.
+// 4) We can easily go from a constructor to a createFiber object literal if that
+//    is faster.
+// 5) It should be easy to port this to a C struct and keep a C implementation
+//    compatible.
+var createFiber = function (tag, key, internalContextTag) {
+  // $FlowFixMe: the shapes are exact here but Flow doesn't like constructors
+  return new FiberNode(tag, key, internalContextTag);
 };
 
 function shouldConstruct(Component) {
@@ -1851,7 +1838,7 @@ var createWorkInProgress = function (current, renderPriority) {
   } else {
     // We already have an alternate.
     // Reset the effect tag.
-    workInProgress.effectTag = NoWork$1;
+    workInProgress.effectTag = NoEffect$1;
 
     // The effect list is no longer valid.
     workInProgress.nextEffect = null;
@@ -2266,7 +2253,7 @@ var invokeGuardedCallback$1 = function (name, func, context, a, b, c, d, e, f) {
           // The callback errored, but the error event never fired.
           error = new Error('An error was thrown inside one of your components, but React ' + "doesn't know what it was. This is likely due to browser " + 'flakiness. React does its best to preserve the "Pause on ' + 'exceptions" behavior of the DevTools, which requires some ' + "DEV-mode only tricks. It's possible that these don't work in " + 'your browser. Try triggering the error in production mode, ' + 'or switching to a modern browser. If you suspect that this is ' + 'actually an issue with React, please file an issue.');
         } else if (isCrossOriginError) {
-          error = new Error("A cross-origin error was thrown. React doesn't have access to " + 'the actual error because it catches errors using a global ' + 'error handler, in order to preserve the "Pause on exceptions" ' + 'behavior of the DevTools. This is only an issue in DEV-mode; ' + 'in production, React uses a normal try-catch statement.\n\n' + 'If you are using React from a CDN, ensure that the <script> tag ' + 'has a `crossorigin` attribute, and that it is served with the ' + '`Access-Control-Allow-Origin: *` HTTP header. ' + 'See https://fb.me/react-cdn-crossorigin');
+          error = new Error("A cross-origin error was thrown. React doesn't have access to " + 'the actual error object in development. ' + 'See https://fb.me/react-crossorigin-error for more information.');
         }
         ReactErrorUtils._hasCaughtError = true;
         ReactErrorUtils._caughtError = error;
@@ -2295,12 +2282,10 @@ var rethrowCaughtError = function () {
 var ReactErrorUtils_1 = ReactErrorUtils;
 
 /**
- * Copyright 2014-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2014-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactCoroutine
  * 
@@ -2385,12 +2370,10 @@ var ReactCoroutine = {
 };
 
 /**
- * Copyright 2014-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2014-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactPortal
  * 
@@ -2442,7 +2425,6 @@ var REACT_PORTAL_TYPE = ReactPortal.REACT_PORTAL_TYPE;
 
 
 
-
 {
   var _require3$2 = ReactDebugCurrentFiber_1,
       getCurrentFiberStackAddendum$1 = _require3$2.getCurrentFiberStackAddendum;
@@ -2842,8 +2824,7 @@ function ChildReconciler(shouldClone, shouldTrackSideEffects) {
     }
 
     {
-      var disableNewFiberFeatures = ReactFeatureFlags_1.disableNewFiberFeatures;
-      if (!disableNewFiberFeatures && typeof newChild === 'function') {
+      if (typeof newChild === 'function') {
         warnOnFunctionType();
       }
     }
@@ -2921,8 +2902,7 @@ function ChildReconciler(shouldClone, shouldTrackSideEffects) {
     }
 
     {
-      var disableNewFiberFeatures = ReactFeatureFlags_1.disableNewFiberFeatures;
-      if (!disableNewFiberFeatures && typeof newChild === 'function') {
+      if (typeof newChild === 'function') {
         warnOnFunctionType();
       }
     }
@@ -2976,8 +2956,7 @@ function ChildReconciler(shouldClone, shouldTrackSideEffects) {
     }
 
     {
-      var disableNewFiberFeatures = ReactFeatureFlags_1.disableNewFiberFeatures;
-      if (!disableNewFiberFeatures && typeof newChild === 'function') {
+      if (typeof newChild === 'function') {
         warnOnFunctionType();
       }
     }
@@ -3444,63 +3423,23 @@ function ChildReconciler(shouldClone, shouldTrackSideEffects) {
     // not as a fragment. Nested arrays on the other hand will be treated as
     // fragment nodes. Recursion happens at the normal flow.
 
-    var disableNewFiberFeatures = ReactFeatureFlags_1.disableNewFiberFeatures;
-
     // Handle object types
     var isObject = typeof newChild === 'object' && newChild !== null;
     if (isObject) {
       // Support only the subset of return types that Stack supports. Treat
       // everything else as empty, but log a warning.
-      if (disableNewFiberFeatures) {
-        switch (newChild.$$typeof) {
-          case REACT_ELEMENT_TYPE:
-            return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, priority));
-
-          case REACT_PORTAL_TYPE:
-            return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, priority));
-        }
-      } else {
-        switch (newChild.$$typeof) {
-          case REACT_ELEMENT_TYPE:
-            return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, priority));
-
-          case REACT_COROUTINE_TYPE:
-            return placeSingleChild(reconcileSingleCoroutine(returnFiber, currentFirstChild, newChild, priority));
+      switch (newChild.$$typeof) {
+        case REACT_ELEMENT_TYPE:
+          return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, priority));
 
-          case REACT_YIELD_TYPE:
-            return placeSingleChild(reconcileSingleYield(returnFiber, currentFirstChild, newChild, priority));
+        case REACT_COROUTINE_TYPE:
+          return placeSingleChild(reconcileSingleCoroutine(returnFiber, currentFirstChild, newChild, priority));
 
-          case REACT_PORTAL_TYPE:
-            return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, priority));
-        }
-      }
-    }
+        case REACT_YIELD_TYPE:
+          return placeSingleChild(reconcileSingleYield(returnFiber, currentFirstChild, newChild, priority));
 
-    if (disableNewFiberFeatures) {
-      // The new child is not an element. If it's not null or false,
-      // and the return fiber is a composite component, throw an error.
-      switch (returnFiber.tag) {
-        case ClassComponent$8:
-          {
-            {
-              var instance = returnFiber.stateNode;
-              if (instance.render._isMockFunction && typeof newChild === 'undefined') {
-                // We allow auto-mocks to proceed as if they're
-                // returning null.
-                break;
-              }
-            }
-            var Component = returnFiber.type;
-            !(newChild === null || newChild === false) ? invariant(false, '%s.render(): A valid React element (or null) must be returned. You may have returned undefined, an array or some other invalid object.', Component.displayName || Component.name || 'Component') : void 0;
-            break;
-          }
-        case FunctionalComponent$3:
-          {
-            // Composites accept elements, portals, null, or false
-            var _Component = returnFiber.type;
-            !(newChild === null || newChild === false) ? invariant(false, '%s(...): A valid React element (or null) must be returned. You may have returned undefined, an array or some other invalid object.', _Component.displayName || _Component.name || 'Component') : void 0;
-            break;
-          }
+        case REACT_PORTAL_TYPE:
+          return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, priority));
       }
     }
 
@@ -3521,11 +3460,11 @@ function ChildReconciler(shouldClone, shouldTrackSideEffects) {
     }
 
     {
-      if (!disableNewFiberFeatures && typeof newChild === 'function') {
+      if (typeof newChild === 'function') {
         warnOnFunctionType();
       }
     }
-    if (!disableNewFiberFeatures && typeof newChild === 'undefined') {
+    if (typeof newChild === 'undefined') {
       // If the new child is undefined, and the return fiber is a composite
       // component, throw an error. If Fiber return types are disabled,
       // we already threw above.
@@ -3533,8 +3472,8 @@ function ChildReconciler(shouldClone, shouldTrackSideEffects) {
         case ClassComponent$8:
           {
             {
-              var _instance = returnFiber.stateNode;
-              if (_instance.render._isMockFunction) {
+              var instance = returnFiber.stateNode;
+              if (instance.render._isMockFunction) {
                 // We allow auto-mocks to proceed as if they're returning null.
                 break;
               }
@@ -3545,8 +3484,8 @@ function ChildReconciler(shouldClone, shouldTrackSideEffects) {
         // eslint-disable-next-lined no-fallthrough
         case FunctionalComponent$3:
           {
-            var _Component2 = returnFiber.type;
-            invariant(false, '%s(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.', _Component2.displayName || _Component2.name || 'Component');
+            var Component = returnFiber.type;
+            invariant(false, '%s(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.', Component.displayName || Component.name || 'Component');
           }
       }
     }
@@ -3621,6 +3560,7 @@ var isMounted$1 = ReactFiberTreeReflection.isMounted;
 
 
 
+var fakeInternalInstance = {};
 var isArray$1 = Array.isArray;
 
 {
@@ -3632,6 +3572,19 @@ var isArray$1 = Array.isArray;
   var warnOnInvalidCallback = function (callback, callerName) {
     warning$8(callback === null || typeof callback === 'function', '%s(...): Expected the last optional `callback` argument to be a ' + 'function. Instead received: %s.', callerName, callback);
   };
+
+  // This is so gross but it's at least non-critical and can be removed if
+  // it causes problems. This is meant to give a nicer error message for
+  // ReactDOM15.unstable_renderSubtreeIntoContainer(reactDOM16Component,
+  // ...)) which otherwise throws a "_processChildContext is not a function"
+  // exception.
+  Object.defineProperty(fakeInternalInstance, '_processChildContext', {
+    enumerable: false,
+    value: function () {
+      invariant(false, '_processChildContext is not available in React 16+. This likely means you have multiple copies of React and are attempting to nest a React 15 tree inside a React 16 tree using unstable_renderSubtreeIntoContainer, which isn\'t supported. Try to make sure you have only one copy of React (and ideally, switch to ReactDOM.createPortal).');
+    }
+  });
+  Object.freeze(fakeInternalInstance);
 }
 
 var ReactFiberClassComponent = function (scheduleUpdate, getPriorityContext, memoizeProps, memoizeState) {
@@ -3750,6 +3703,9 @@ var ReactFiberClassComponent = function (scheduleUpdate, getPriorityContext, mem
     workInProgress.stateNode = instance;
     // The instance needs access to the fiber so that it can schedule updates
     ReactInstanceMap_1.set(instance, workInProgress);
+    {
+      instance._reactInternalInstance = fakeInternalInstance;
+    }
   }
 
   function constructClassInstance(workInProgress, props) {
@@ -4265,7 +4221,7 @@ var ReactFiberBeginWork = function (config, hostContext, hydrationContext, sched
     return workInProgress.child;
   }
 
-  function updateHostRoot(current, workInProgress, priorityLevel) {
+  function pushHostRootContext(workInProgress) {
     var root = workInProgress.stateNode;
     if (root.pendingContext) {
       pushTopLevelContextObject$1(workInProgress, root.pendingContext, root.pendingContext !== root.context);
@@ -4273,9 +4229,11 @@ var ReactFiberBeginWork = function (config, hostContext, hydrationContext, sched
       // Should always be set
       pushTopLevelContextObject$1(workInProgress, root.context, false);
     }
-
     pushHostContainer(workInProgress, root.containerInfo);
+  }
 
+  function updateHostRoot(current, workInProgress, priorityLevel) {
+    pushHostRootContext(workInProgress);
     var updateQueue = workInProgress.updateQueue;
     if (updateQueue !== null) {
       var prevState = workInProgress.memoizedState;
@@ -4559,6 +4517,9 @@ var ReactFiberBeginWork = function (config, hostContext, hydrationContext, sched
     // TODO: Handle HostComponent tags here as well and call pushHostContext()?
     // See PR 8590 discussion for context
     switch (workInProgress.tag) {
+      case HostRoot$7:
+        pushHostRootContext(workInProgress);
+        break;
       case ClassComponent$7:
         pushContextProvider$1(workInProgress);
         break;
@@ -4630,8 +4591,7 @@ var ReactFiberBeginWork = function (config, hostContext, hydrationContext, sched
         pushContextProvider$1(workInProgress);
         break;
       case HostRoot$7:
-        var root = workInProgress.stateNode;
-        pushHostContainer(workInProgress, root.containerInfo);
+        pushHostRootContext(workInProgress);
         break;
       default:
         invariant(false, 'Invalid type of work. This error is likely caused by a bug in React. Please file an issue.');
@@ -4682,6 +4642,7 @@ var ReactFiberBeginWork = function (config, hostContext, hydrationContext, sched
 var reconcileChildFibers$2 = ReactChildFiber.reconcileChildFibers;
 
 var popContextProvider$2 = ReactFiberContext.popContextProvider;
+var popTopLevelContextObject$1 = ReactFiberContext.popTopLevelContextObject;
 
 
 
@@ -4841,7 +4802,8 @@ var ReactFiberCompleteWork = function (config, hostContext, hydrationContext) {
         }
       case HostRoot$8:
         {
-          // TODO: Pop the host container after #8607 lands.
+          popHostContainer(workInProgress);
+          popTopLevelContextObject$1(workInProgress);
           var fiberRoot = workInProgress.stateNode;
           if (fiberRoot.pendingContext) {
             fiberRoot.context = fiberRoot.pendingContext;
@@ -4901,7 +4863,7 @@ var ReactFiberCompleteWork = function (config, hostContext, hydrationContext) {
             if (wasHydrated) {
               // TOOD: Move this and createInstance step into the beginPhase
               // to consolidate.
-              if (prepareToHydrateHostInstance(workInProgress, rootContainerInstance)) {
+              if (prepareToHydrateHostInstance(workInProgress, rootContainerInstance, _currentHostContext)) {
                 // If changes to the hydrated node needs to be applied at the
                 // commit-phase we mark this as such.
                 markUpdate(workInProgress);
@@ -5106,6 +5068,8 @@ var ReactFiberCommitWork = function (config, captureError) {
   {
     var callComponentWillUnmountWithTimerInDev = function (current, instance) {
       startPhaseTimer$2(current, 'componentWillUnmount');
+      instance.props = current.memoizedProps;
+      instance.state = current.memoizedState;
       instance.componentWillUnmount();
       stopPhaseTimer$2();
     };
@@ -5492,6 +5456,8 @@ var ReactFiberCommitWork = function (config, captureError) {
               {
                 startPhaseTimer$2(finishedWork, 'componentDidMount');
               }
+              instance.props = finishedWork.memoizedProps;
+              instance.state = finishedWork.memoizedState;
               instance.componentDidMount();
               {
                 stopPhaseTimer$2();
@@ -5502,6 +5468,8 @@ var ReactFiberCommitWork = function (config, captureError) {
               {
                 startPhaseTimer$2(finishedWork, 'componentDidUpdate');
               }
+              instance.props = finishedWork.memoizedProps;
+              instance.state = finishedWork.memoizedState;
               instance.componentDidUpdate(prevProps, prevState);
               {
                 stopPhaseTimer$2();
@@ -5851,9 +5819,9 @@ var ReactFiberHydrationContext = function (config) {
     nextHydratableInstance = getFirstHydratableChild(nextInstance);
   }
 
-  function prepareToHydrateHostInstance(fiber, rootContainerInstance) {
+  function prepareToHydrateHostInstance(fiber, rootContainerInstance, hostContext) {
     var instance = fiber.stateNode;
-    var updatePayload = hydrateInstance(instance, fiber.type, fiber.memoizedProps, rootContainerInstance, fiber);
+    var updatePayload = hydrateInstance(instance, fiber.type, fiber.memoizedProps, rootContainerInstance, hostContext, fiber);
     // TODO: Type this specific to this type of component.
     fiber.updateQueue = updatePayload;
     // If the update payload indicates that there is a change or if there
@@ -5930,12 +5898,10 @@ var ReactFiberHydrationContext = function (config) {
 };
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule ReactFiberInstrumentation
  * 
@@ -6131,6 +6097,7 @@ var ReactFiberScheduler = function (config) {
   // Use these to prevent an infinite loop of nested updates
   var NESTED_UPDATE_LIMIT = 1000;
   var nestedUpdateCount = 0;
+  var nextRenderedTree = null;
 
   function resetContextStack() {
     // Reset the stack
@@ -6185,11 +6152,17 @@ var ReactFiberScheduler = function (config) {
       resetContextStack();
 
       nextUnitOfWork = createWorkInProgress$1(highestPriorityRoot.current, highestPriorityLevel);
+      if (highestPriorityRoot !== nextRenderedTree) {
+        // We've switched trees. Reset the nested update counter.
+        nestedUpdateCount = 0;
+        nextRenderedTree = highestPriorityRoot;
+      }
       return;
     }
 
     nextPriorityLevel = NoWork$2;
     nextUnitOfWork = null;
+    nextRenderedTree = null;
     return;
   }
 
@@ -6773,8 +6746,6 @@ var ReactFiberScheduler = function (config) {
     !!isPerformingWork ? invariant(false, 'performWork was called recursively. This error is likely caused by a bug in React. Please file an issue.') : void 0;
     isPerformingWork = true;
 
-    nestedUpdateCount = 0;
-
     // The priority context changes during the render phase. We'll need to
     // reset it at the end.
     var previousPriorityContext = priorityContext;
@@ -6852,6 +6823,9 @@ var ReactFiberScheduler = function (config) {
     firstUncaughtError = null;
     capturedErrors = null;
     failedBoundaries = null;
+    nextRenderedTree = null;
+    nestedUpdateCount = 0;
+
     {
       stopWorkLoopTimer();
     }
@@ -7213,16 +7187,6 @@ var ReactFiberScheduler = function (config) {
     scheduleUpdateImpl(fiber, TaskPriority$1, true);
   }
 
-  function performWithPriority(priorityLevel, fn) {
-    var previousPriorityContext = priorityContext;
-    priorityContext = priorityLevel;
-    try {
-      fn();
-    } finally {
-      priorityContext = previousPriorityContext;
-    }
-  }
-
   function batchedUpdates(fn, a) {
     var previousIsBatchingUpdates = isBatchingUpdates;
     isBatchingUpdates = true;
@@ -7281,7 +7245,6 @@ var ReactFiberScheduler = function (config) {
   return {
     scheduleUpdate: scheduleUpdate,
     getPriorityContext: getPriorityContext,
-    performWithPriority: performWithPriority,
     batchedUpdates: batchedUpdates,
     unbatchedUpdates: unbatchedUpdates,
     flushSync: flushSync,
@@ -7290,12 +7253,10 @@ var ReactFiberScheduler = function (config) {
 };
 
 /**
- * Copyright 2013-present, Facebook, Inc.
- * All rights reserved.
+ * Copyright (c) 2013-present, Facebook, Inc.
  *
- * 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.
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
  *
  * @providesModule getContextForSubtree
  * 
@@ -7364,7 +7325,6 @@ var ReactFiberReconciler = function (config) {
   var _ReactFiberScheduler = ReactFiberScheduler(config),
       scheduleUpdate = _ReactFiberScheduler.scheduleUpdate,
       getPriorityContext = _ReactFiberScheduler.getPriorityContext,
-      performWithPriority = _ReactFiberScheduler.performWithPriority,
       batchedUpdates = _ReactFiberScheduler.batchedUpdates,
       unbatchedUpdates = _ReactFiberScheduler.unbatchedUpdates,
       flushSync = _ReactFiberScheduler.flushSync,
@@ -7422,8 +7382,6 @@ var ReactFiberReconciler = function (config) {
     },
 
 
-    performWithPriority: performWithPriority,
-
     batchedUpdates: batchedUpdates,
 
     unbatchedUpdates: unbatchedUpdates,
@@ -7955,14 +7913,19 @@ function toJSON(inst) {
   }
 }
 
-function nodeAndSiblingsArray(nodeWithSibling) {
+function nodeAndSiblingsTrees(nodeWithSibling) {
   var array = [];
   var node = nodeWithSibling;
   while (node != null) {
     array.push(node);
     node = node.sibling;
   }
-  return array;
+  var trees = array.map(toTree);
+  return trees.length ? trees : null;
+}
+
+function hasSiblings(node) {
+  return node && node.sibling;
 }
 
 function toTree(node) {
@@ -7979,7 +7942,7 @@ function toTree(node) {
         type: node.type,
         props: _assign({}, node.memoizedProps),
         instance: node.stateNode,
-        rendered: toTree(node.child)
+        rendered: hasSiblings(node.child) ? nodeAndSiblingsTrees(node.child) : toTree(node.child)
       };
     case FunctionalComponent:
       // 1
@@ -7988,7 +7951,7 @@ function toTree(node) {
         type: node.type,
         props: _assign({}, node.memoizedProps),
         instance: null,
-        rendered: toTree(node.child)
+        rendered: hasSiblings(node.child) ? nodeAndSiblingsTrees(node.child) : toTree(node.child)
       };
     case HostComponent:
       // 5
@@ -7997,7 +7960,7 @@ function toTree(node) {
         type: node.type,
         props: _assign({}, node.memoizedProps),
         instance: null, // TODO: use createNodeMock here somehow?
-        rendered: nodeAndSiblingsArray(node.child).map(toTree)
+        rendered: nodeAndSiblingsTrees(node.child)
       };
     case HostText:
       // 6
@@ -8222,13 +8185,9 @@ var ReactTestRendererFiber = {
     !(root != null) ? invariant(false, 'something went wrong') : void 0;
     TestRenderer.updateContainer(element, root, null, null);
 
-    return {
-      get root() {
-        if (root === null || root.current.child === null) {
-          throw new Error("Can't access .root on unmounted test renderer");
-        }
-        return wrapFiber(root.current.child);
-      },
+    var entry = {
+      root: undefined, // makes flow happy
+      // we define a 'getter' for 'root' below using 'Object.defineProperty'
       toJSON: function () {
         if (root == null || root.current == null || container == null) {
           return null;
@@ -8268,6 +8227,19 @@ var ReactTestRendererFiber = {
         return TestRenderer.getPublicRootInstance(root);
       }
     };
+
+    Object.defineProperty(entry, 'root', {
+      configurable: true,
+      enumerable: true,
+      get: function () {
+        if (root === null || root.current.child === null) {
+          throw new Error("Can't access .root on unmounted test renderer");
+        }
+        return wrapFiber(root.current.child);
+      }
+    });
+
+    return entry;
   },
 
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "react-test-renderer",
-  "version": "16.0.0-beta.5",
+  "version": "16.0.0",
   "description": "React package for snapshot testing.",
   "main": "index.js",
   "repository": "facebook/react",
@@ -9,21 +9,20 @@
     "react-native",
     "react-testing"
   ],
-  "license": "BSD-3-Clause",
+  "license": "MIT",
   "bugs": {
     "url": "https://github.com/facebook/react/issues"
   },
   "homepage": "https://facebook.github.io/react/",
   "dependencies": {
-    "fbjs": "^0.8.9",
-    "object-assign": "^4.1.0"
+    "fbjs": "^0.8.16",
+    "object-assign": "^4.1.1"
   },
   "peerDependencies": {
     "react": "^16.0.0-beta.5"
   },
   "files": [
     "LICENSE",
-    "PATENTS",
     "README.md",
     "index.js",
     "shallow.js",

package/PATENTS

@@ -1,33 +0,0 @@
-Additional Grant of Patent Rights Version 2
-
-"Software" means the React software distributed by Facebook, Inc.
-
-Facebook, Inc. ("Facebook") hereby grants to each recipient of the Software
-("you") a perpetual, worldwide, royalty-free, non-exclusive, irrevocable
-(subject to the termination provision below) license under any Necessary
-Claims, to make, have made, use, sell, offer to sell, import, and otherwise
-transfer the Software. For avoidance of doubt, no license is granted under
-Facebook's rights in any patent claims that are infringed by (i) modifications
-to the Software made by you or any third party or (ii) the Software in
-combination with any software or other technology.
-
-The license granted hereunder will terminate, automatically and without notice,
-if you (or any of your subsidiaries, corporate affiliates or agents) initiate
-directly or indirectly, or take a direct financial interest in, any Patent
-Assertion: (i) against Facebook or any of its subsidiaries or corporate
-affiliates, (ii) against any party if such Patent Assertion arises in whole or
-in part from any software, technology, product or service of Facebook or any of
-its subsidiaries or corporate affiliates, or (iii) against any party relating
-to the Software. Notwithstanding the foregoing, if Facebook or any of its
-subsidiaries or corporate affiliates files a lawsuit alleging patent
-infringement against you in the first instance, and you respond by filing a
-patent infringement counterclaim in that lawsuit against that party that is
-unrelated to the Software, the license granted hereunder will not terminate
-under section (i) of this paragraph due to such counterclaim.
-
-A "Necessary Claim" is a claim of a patent owned by Facebook that is
-necessarily infringed by the Software standing alone.
-
-A "Patent Assertion" is any lawsuit or other action alleging direct, indirect,
-or contributory infringement or inducement to infringe any patent, including a
-cross-claim or counterclaim.